Distribution.Compat.Semigroup

Compatibility layer for Data.Semigroup

Documentation

class Semigroup a where

The class of semigroups (types with an associative binary operation).

Instances should satisfy the following:

Associativity

x <> (y <> z) = (x <> y) <> z

Since: base-4.9.0.0

Methods

(<>) :: a -> a -> a infixr 6

An associative operation.

>>> [1,2,3] <> [4,5,6]
[1,2,3,4,5,6]

Instances

Semigroup Benchmark

Defined in Distribution.Types.Benchmark

Methods

(<>) :: Benchmark -> Benchmark -> Benchmark

sconcat :: NonEmpty Benchmark -> Benchmark

stimes :: Integral b => b -> Benchmark -> Benchmark

Semigroup BenchmarkInterface

Defined in Distribution.Types.BenchmarkInterface

Methods

(<>) :: BenchmarkInterface -> BenchmarkInterface -> BenchmarkInterface

sconcat :: NonEmpty BenchmarkInterface -> BenchmarkInterface

stimes :: Integral b => b -> BenchmarkInterface -> BenchmarkInterface

Semigroup BuildInfo

Defined in Distribution.Types.BuildInfo

Methods

(<>) :: BuildInfo -> BuildInfo -> BuildInfo

sconcat :: NonEmpty BuildInfo -> BuildInfo

stimes :: Integral b => b -> BuildInfo -> BuildInfo

Semigroup Component

Defined in Distribution.Types.Component

Methods

(<>) :: Component -> Component -> Component

sconcat :: NonEmpty Component -> Component

stimes :: Integral b => b -> Component -> Component

Semigroup DependencyMap

Defined in Distribution.Types.DependencyMap

Methods

(<>) :: DependencyMap -> DependencyMap -> DependencyMap

sconcat :: NonEmpty DependencyMap -> DependencyMap

stimes :: Integral b => b -> DependencyMap -> DependencyMap

Semigroup Executable

Defined in Distribution.Types.Executable

Methods

(<>) :: Executable -> Executable -> Executable

sconcat :: NonEmpty Executable -> Executable

stimes :: Integral b => b -> Executable -> Executable

Semigroup ExecutableScope

Any like semigroup, where ExecutablePrivate is 'Any True'

Defined in Distribution.Types.ExecutableScope

Methods

(<>) :: ExecutableScope -> ExecutableScope -> ExecutableScope

sconcat :: NonEmpty ExecutableScope -> ExecutableScope

stimes :: Integral b => b -> ExecutableScope -> ExecutableScope

Semigroup FlagAssignment

Defined in Distribution.Types.Flag

Methods

(<>) :: FlagAssignment -> FlagAssignment -> FlagAssignment

sconcat :: NonEmpty FlagAssignment -> FlagAssignment

stimes :: Integral b => b -> FlagAssignment -> FlagAssignment

Semigroup ForeignLib

Defined in Distribution.Types.ForeignLib

Methods

(<>) :: ForeignLib -> ForeignLib -> ForeignLib

sconcat :: NonEmpty ForeignLib -> ForeignLib

stimes :: Integral b => b -> ForeignLib -> ForeignLib

Semigroup ForeignLibType

Defined in Distribution.Types.ForeignLibType

Methods

(<>) :: ForeignLibType -> ForeignLibType -> ForeignLibType

sconcat :: NonEmpty ForeignLibType -> ForeignLibType

stimes :: Integral b => b -> ForeignLibType -> ForeignLibType

Semigroup Library

Defined in Distribution.Types.Library

Methods

(<>) :: Library -> Library -> Library

sconcat :: NonEmpty Library -> Library

stimes :: Integral b => b -> Library -> Library

Semigroup LibraryVisibility

Defined in Distribution.Types.LibraryVisibility

Methods

(<>) :: LibraryVisibility -> LibraryVisibility -> LibraryVisibility

sconcat :: NonEmpty LibraryVisibility -> LibraryVisibility

stimes :: Integral b => b -> LibraryVisibility -> LibraryVisibility

Semigroup SetupBuildInfo

Defined in Distribution.Types.SetupBuildInfo

Methods

(<>) :: SetupBuildInfo -> SetupBuildInfo -> SetupBuildInfo

sconcat :: NonEmpty SetupBuildInfo -> SetupBuildInfo

stimes :: Integral b => b -> SetupBuildInfo -> SetupBuildInfo

Semigroup TestSuite

Defined in Distribution.Types.TestSuite

Methods

(<>) :: TestSuite -> TestSuite -> TestSuite

sconcat :: NonEmpty TestSuite -> TestSuite

stimes :: Integral b => b -> TestSuite -> TestSuite

Semigroup TestSuiteInterface

Defined in Distribution.Types.TestSuiteInterface

Methods

(<>) :: TestSuiteInterface -> TestSuiteInterface -> TestSuiteInterface

sconcat :: NonEmpty TestSuiteInterface -> TestSuiteInterface

stimes :: Integral b => b -> TestSuiteInterface -> TestSuiteInterface

Semigroup UnqualComponentName

Defined in Distribution.Types.UnqualComponentName

Methods

(<>) :: UnqualComponentName -> UnqualComponentName -> UnqualComponentName

sconcat :: NonEmpty UnqualComponentName -> UnqualComponentName

stimes :: Integral b => b -> UnqualComponentName -> UnqualComponentName

Semigroup ShortText

Defined in Distribution.Utils.ShortText

Methods

(<>) :: ShortText -> ShortText -> ShortText

sconcat :: NonEmpty ShortText -> ShortText

stimes :: Integral b => b -> ShortText -> ShortText

Semigroup All

Since: base-4.9.0.0

Defined in Data.Semigroup.Internal

Methods

(<>) :: All -> All -> All

sconcat :: NonEmpty All -> All

stimes :: Integral b => b -> All -> All

Semigroup Any

Since: base-4.9.0.0

Defined in Data.Semigroup.Internal

Methods

(<>) :: Any -> Any -> Any

sconcat :: NonEmpty Any -> Any

stimes :: Integral b => b -> Any -> Any

Semigroup Void

Since: base-4.9.0.0

Defined in Data.Void

Methods

(<>) :: Void -> Void -> Void

sconcat :: NonEmpty Void -> Void

stimes :: Integral b => b -> Void -> Void

Semigroup Builder

Defined in Data.ByteString.Builder.Internal

Methods

(<>) :: Builder -> Builder -> Builder

sconcat :: NonEmpty Builder -> Builder

stimes :: Integral b => b -> Builder -> Builder

Semigroup ByteString

Defined in Data.ByteString.Internal

Methods

(<>) :: ByteString -> ByteString -> ByteString

sconcat :: NonEmpty ByteString -> ByteString

stimes :: Integral b => b -> ByteString -> ByteString

Semigroup ByteString

Defined in Data.ByteString.Lazy.Internal

Methods

(<>) :: ByteString -> ByteString -> ByteString

sconcat :: NonEmpty ByteString -> ByteString

stimes :: Integral b => b -> ByteString -> ByteString

Semigroup ShortByteString

Defined in Data.ByteString.Short.Internal

Methods

(<>) :: ShortByteString -> ShortByteString -> ShortByteString

sconcat :: NonEmpty ShortByteString -> ShortByteString

stimes :: Integral b => b -> ShortByteString -> ShortByteString

Semigroup IntSet

Since: containers-0.5.7

Defined in Data.IntSet.Internal

Methods

(<>) :: IntSet -> IntSet -> IntSet

sconcat :: NonEmpty IntSet -> IntSet

stimes :: Integral b => b -> IntSet -> IntSet

Semigroup Ordering

Since: base-4.9.0.0

Defined in GHC.Base

Methods

(<>) :: Ordering -> Ordering -> Ordering

sconcat :: NonEmpty Ordering -> Ordering

stimes :: Integral b => b -> Ordering -> Ordering

Semigroup Doc

Defined in Text.PrettyPrint.HughesPJ

Methods

(<>) :: Doc -> Doc -> Doc

sconcat :: NonEmpty Doc -> Doc

stimes :: Integral b => b -> Doc -> Doc

Semigroup ()

Since: base-4.9.0.0

Defined in GHC.Base

Methods

(<>) :: () -> () -> ()

sconcat :: NonEmpty () -> ()

stimes :: Integral b => b -> () -> ()

Semigroup (DList a)

Defined in Distribution.Compat.DList

Methods

(<>) :: DList a -> DList a -> DList a

sconcat :: NonEmpty (DList a) -> DList a

stimes :: Integral b => b -> DList a -> DList a

Ord a => Semigroup (NonEmptySet a)

Note: there aren't Monoid instance.

Defined in Distribution.Compat.NonEmptySet

Methods

(<>) :: NonEmptySet a -> NonEmptySet a -> NonEmptySet a

sconcat :: NonEmpty (NonEmptySet a) -> NonEmptySet a

stimes :: Integral b => b -> NonEmptySet a -> NonEmptySet a

Semigroup (First' a)

Defined in Distribution.Compat.Semigroup

Methods

(<>) :: First' a -> First' a -> First' a

sconcat :: NonEmpty (First' a) -> First' a

stimes :: Integral b => b -> First' a -> First' a

Semigroup (Last' a)

Defined in Distribution.Compat.Semigroup

Methods

(<>) :: Last' a -> Last' a -> Last' a

sconcat :: NonEmpty (Last' a) -> Last' a

stimes :: Integral b => b -> Last' a -> Last' a

Semigroup a => Semigroup (Option' a)

Defined in Distribution.Compat.Semigroup

Methods

(<>) :: Option' a -> Option' a -> Option' a

sconcat :: NonEmpty (Option' a) -> Option' a

stimes :: Integral b => b -> Option' a -> Option' a

Semigroup a => Semigroup (PerCompilerFlavor a)

Defined in Distribution.Compiler

Methods

(<>) :: PerCompilerFlavor a -> PerCompilerFlavor a -> PerCompilerFlavor a

sconcat :: NonEmpty (PerCompilerFlavor a) -> PerCompilerFlavor a

stimes :: Integral b => b -> PerCompilerFlavor a -> PerCompilerFlavor a

Semigroup (Condition a)

Defined in Distribution.Types.Condition

Methods

(<>) :: Condition a -> Condition a -> Condition a

sconcat :: NonEmpty (Condition a) -> Condition a

stimes :: Integral b => b -> Condition a -> Condition a

Bits a => Semigroup (And a)

Since: base-4.16

Defined in Data.Bits

Methods

(<>) :: And a -> And a -> And a

sconcat :: NonEmpty (And a) -> And a

stimes :: Integral b => b -> And a -> And a

FiniteBits a => Semigroup (Iff a)

This constraint is arguably too strong. However, as some types (such as Natural) have undefined complement, this is the only safe choice.

Since: base-4.16

Defined in Data.Bits

Methods

(<>) :: Iff a -> Iff a -> Iff a

sconcat :: NonEmpty (Iff a) -> Iff a

stimes :: Integral b => b -> Iff a -> Iff a

Bits a => Semigroup (Ior a)

Since: base-4.16

Defined in Data.Bits

Methods

(<>) :: Ior a -> Ior a -> Ior a

sconcat :: NonEmpty (Ior a) -> Ior a

stimes :: Integral b => b -> Ior a -> Ior a

Bits a => Semigroup (Xor a)

Since: base-4.16

Defined in Data.Bits

Methods

(<>) :: Xor a -> Xor a -> Xor a

sconcat :: NonEmpty (Xor a) -> Xor a

stimes :: Integral b => b -> Xor a -> Xor a

Semigroup a => Semigroup (Identity a)

Since: base-4.9.0.0

Defined in Data.Functor.Identity

Methods

(<>) :: Identity a -> Identity a -> Identity a

sconcat :: NonEmpty (Identity a) -> Identity a

stimes :: Integral b => b -> Identity a -> Identity a

Ord a => Semigroup (Max a)

Since: base-4.11.0.0

Defined in Data.Functor.Utils

Methods

(<>) :: Max a -> Max a -> Max a

sconcat :: NonEmpty (Max a) -> Max a

stimes :: Integral b => b -> Max a -> Max a

Ord a => Semigroup (Min a)

Since: base-4.11.0.0

Defined in Data.Functor.Utils

Methods

(<>) :: Min a -> Min a -> Min a

sconcat :: NonEmpty (Min a) -> Min a

stimes :: Integral b => b -> Min a -> Min a

Semigroup (First a)

Since: base-4.9.0.0

Defined in Data.Monoid

Methods

(<>) :: First a -> First a -> First a

sconcat :: NonEmpty (First a) -> First a

stimes :: Integral b => b -> First a -> First a

Semigroup (Last a)

Since: base-4.9.0.0

Defined in Data.Monoid

Methods

(<>) :: Last a -> Last a -> Last a

sconcat :: NonEmpty (Last a) -> Last a

stimes :: Integral b => b -> Last a -> Last a

Semigroup a => Semigroup (Down a)

Since: base-4.11.0.0

Defined in Data.Ord

Methods

(<>) :: Down a -> Down a -> Down a

sconcat :: NonEmpty (Down a) -> Down a

stimes :: Integral b => b -> Down a -> Down a

Semigroup (First a)

Since: base-4.9.0.0

Defined in Data.Semigroup

Methods

(<>) :: First a -> First a -> First a

sconcat :: NonEmpty (First a) -> First a

stimes :: Integral b => b -> First a -> First a

Semigroup (Last a)

Since: base-4.9.0.0

Defined in Data.Semigroup

Methods

(<>) :: Last a -> Last a -> Last a

sconcat :: NonEmpty (Last a) -> Last a

stimes :: Integral b => b -> Last a -> Last a

Ord a => Semigroup (Max a)

Since: base-4.9.0.0

Defined in Data.Semigroup

Methods

(<>) :: Max a -> Max a -> Max a

sconcat :: NonEmpty (Max a) -> Max a

stimes :: Integral b => b -> Max a -> Max a

Ord a => Semigroup (Min a)

Since: base-4.9.0.0

Defined in Data.Semigroup

Methods

(<>) :: Min a -> Min a -> Min a

sconcat :: NonEmpty (Min a) -> Min a

stimes :: Integral b => b -> Min a -> Min a

Monoid m => Semigroup (WrappedMonoid m)

Since: base-4.9.0.0

Defined in Data.Semigroup

Methods

(<>) :: WrappedMonoid m -> WrappedMonoid m -> WrappedMonoid m

sconcat :: NonEmpty (WrappedMonoid m) -> WrappedMonoid m

stimes :: Integral b => b -> WrappedMonoid m -> WrappedMonoid m

Semigroup a => Semigroup (Dual a)

Since: base-4.9.0.0

Defined in Data.Semigroup.Internal

Methods

(<>) :: Dual a -> Dual a -> Dual a

sconcat :: NonEmpty (Dual a) -> Dual a

stimes :: Integral b => b -> Dual a -> Dual a

Semigroup (Endo a)

Since: base-4.9.0.0

Defined in Data.Semigroup.Internal

Methods

(<>) :: Endo a -> Endo a -> Endo a

sconcat :: NonEmpty (Endo a) -> Endo a

stimes :: Integral b => b -> Endo a -> Endo a

Num a => Semigroup (Product a)

Since: base-4.9.0.0

Defined in Data.Semigroup.Internal

Methods

(<>) :: Product a -> Product a -> Product a

sconcat :: NonEmpty (Product a) -> Product a

stimes :: Integral b => b -> Product a -> Product a

Num a => Semigroup (Sum a)

Since: base-4.9.0.0

Defined in Data.Semigroup.Internal

Methods

(<>) :: Sum a -> Sum a -> Sum a

sconcat :: NonEmpty (Sum a) -> Sum a

stimes :: Integral b => b -> Sum a -> Sum a

Semigroup p => Semigroup (Par1 p)

Since: base-4.12.0.0

Defined in GHC.Generics

Methods

(<>) :: Par1 p -> Par1 p -> Par1 p

sconcat :: NonEmpty (Par1 p) -> Par1 p

stimes :: Integral b => b -> Par1 p -> Par1 p

Semigroup (PutM ())

Defined in Data.Binary.Put

Methods

(<>) :: PutM () -> PutM () -> PutM ()

sconcat :: NonEmpty (PutM ()) -> PutM ()

stimes :: Integral b => b -> PutM () -> PutM ()

Semigroup (IntMap a)

Since: containers-0.5.7

Defined in Data.IntMap.Internal

Methods

(<>) :: IntMap a -> IntMap a -> IntMap a

sconcat :: NonEmpty (IntMap a) -> IntMap a

stimes :: Integral b => b -> IntMap a -> IntMap a

Semigroup (Seq a)

Since: containers-0.5.7

Defined in Data.Sequence.Internal

Methods

(<>) :: Seq a -> Seq a -> Seq a

sconcat :: NonEmpty (Seq a) -> Seq a

stimes :: Integral b => b -> Seq a -> Seq a

Semigroup (MergeSet a)

Defined in Data.Set.Internal

Methods

(<>) :: MergeSet a -> MergeSet a -> MergeSet a

sconcat :: NonEmpty (MergeSet a) -> MergeSet a

stimes :: Integral b => b -> MergeSet a -> MergeSet a

Ord a => Semigroup (Set a)

Since: containers-0.5.7

Defined in Data.Set.Internal

Methods

(<>) :: Set a -> Set a -> Set a

sconcat :: NonEmpty (Set a) -> Set a

stimes :: Integral b => b -> Set a -> Set a

Semigroup a => Semigroup (IO a)

Since: base-4.10.0.0

Defined in GHC.Base

Methods

(<>) :: IO a -> IO a -> IO a

sconcat :: NonEmpty (IO a) -> IO a

stimes :: Integral b => b -> IO a -> IO a

Semigroup (Doc a)

Defined in Text.PrettyPrint.Annotated.HughesPJ

Methods

(<>) :: Doc a -> Doc a -> Doc a

sconcat :: NonEmpty (Doc a) -> Doc a

stimes :: Integral b => b -> Doc a -> Doc a

Semigroup a => Semigroup (Q a)

Since: template-haskell-2.17.0.0

Defined in Language.Haskell.TH.Syntax

Methods

(<>) :: Q a -> Q a -> Q a

sconcat :: NonEmpty (Q a) -> Q a

stimes :: Integral b => b -> Q a -> Q a

Semigroup (NonEmpty a)

Since: base-4.9.0.0

Defined in GHC.Base

Methods

(<>) :: NonEmpty a -> NonEmpty a -> NonEmpty a

sconcat :: NonEmpty (NonEmpty a) -> NonEmpty a

stimes :: Integral b => b -> NonEmpty a -> NonEmpty a

Semigroup a => Semigroup (Maybe a)

Since: base-4.9.0.0

Defined in GHC.Base

Methods

(<>) :: Maybe a -> Maybe a -> Maybe a

sconcat :: NonEmpty (Maybe a) -> Maybe a

stimes :: Integral b => b -> Maybe a -> Maybe a

Semigroup a => Semigroup (a)

Since: base-4.15

Defined in GHC.Base

Methods

(<>) :: (a) -> (a) -> (a)

sconcat :: NonEmpty (a) -> (a)

stimes :: Integral b => b -> (a) -> (a)

Semigroup [a]

Since: base-4.9.0.0

Defined in GHC.Base

Methods

(<>) :: [a] -> [a] -> [a]

sconcat :: NonEmpty [a] -> [a]

stimes :: Integral b => b -> [a] -> [a]

Semigroup (Either a b)

Since: base-4.9.0.0

Defined in Data.Either

Methods

(<>) :: Either a b -> Either a b -> Either a b

sconcat :: NonEmpty (Either a b) -> Either a b

stimes :: Integral b0 => b0 -> Either a b -> Either a b

Semigroup (Proxy s)

Since: base-4.9.0.0

Defined in Data.Proxy

Methods

(<>) :: Proxy s -> Proxy s -> Proxy s

sconcat :: NonEmpty (Proxy s) -> Proxy s

stimes :: Integral b => b -> Proxy s -> Proxy s

Semigroup (U1 p)

Since: base-4.12.0.0

Defined in GHC.Generics

Methods

(<>) :: U1 p -> U1 p -> U1 p

sconcat :: NonEmpty (U1 p) -> U1 p

stimes :: Integral b => b -> U1 p -> U1 p

Semigroup (V1 p)

Since: base-4.12.0.0

Defined in GHC.Generics

Methods

(<>) :: V1 p -> V1 p -> V1 p

sconcat :: NonEmpty (V1 p) -> V1 p

stimes :: Integral b => b -> V1 p -> V1 p

Ord k => Semigroup (Map k v)

Defined in Data.Map.Internal

Methods

(<>) :: Map k v -> Map k v -> Map k v

sconcat :: NonEmpty (Map k v) -> Map k v

stimes :: Integral b => b -> Map k v -> Map k v

Semigroup b => Semigroup (a -> b)

Since: base-4.9.0.0

Defined in GHC.Base

Methods

(<>) :: (a -> b) -> (a -> b) -> a -> b

sconcat :: NonEmpty (a -> b) -> a -> b

stimes :: Integral b0 => b0 -> (a -> b) -> a -> b

(Semigroup a, Semigroup b) => Semigroup (a, b)

Since: base-4.9.0.0

Defined in GHC.Base

Methods

(<>) :: (a, b) -> (a, b) -> (a, b)

sconcat :: NonEmpty (a, b) -> (a, b)

stimes :: Integral b0 => b0 -> (a, b) -> (a, b)

(Semigroup a, Semigroup c) => Semigroup (CondTree v c a)

Defined in Distribution.Types.CondTree

Methods

(<>) :: CondTree v c a -> CondTree v c a -> CondTree v c a

sconcat :: NonEmpty (CondTree v c a) -> CondTree v c a

stimes :: Integral b => b -> CondTree v c a -> CondTree v c a

Semigroup a => Semigroup (Const a b)

Since: base-4.9.0.0

Defined in Data.Functor.Const

Methods

(<>) :: Const a b -> Const a b -> Const a b

sconcat :: NonEmpty (Const a b) -> Const a b

stimes :: Integral b0 => b0 -> Const a b -> Const a b

(Applicative f, Semigroup a) => Semigroup (Ap f a)

Since: base-4.12.0.0

Defined in Data.Monoid

Methods

(<>) :: Ap f a -> Ap f a -> Ap f a

sconcat :: NonEmpty (Ap f a) -> Ap f a

stimes :: Integral b => b -> Ap f a -> Ap f a

Alternative f => Semigroup (Alt f a)

Since: base-4.9.0.0

Defined in Data.Semigroup.Internal

Methods

(<>) :: Alt f a -> Alt f a -> Alt f a

sconcat :: NonEmpty (Alt f a) -> Alt f a

stimes :: Integral b => b -> Alt f a -> Alt f a

Semigroup (f p) => Semigroup (Rec1 f p)

Since: base-4.12.0.0

Defined in GHC.Generics

Methods

(<>) :: Rec1 f p -> Rec1 f p -> Rec1 f p

sconcat :: NonEmpty (Rec1 f p) -> Rec1 f p

stimes :: Integral b => b -> Rec1 f p -> Rec1 f p

(Semigroup a, Semigroup b, Semigroup c) => Semigroup (a, b, c)

Since: base-4.9.0.0

Defined in GHC.Base

Methods

(<>) :: (a, b, c) -> (a, b, c) -> (a, b, c)

sconcat :: NonEmpty (a, b, c) -> (a, b, c)

stimes :: Integral b0 => b0 -> (a, b, c) -> (a, b, c)

(Semigroup (f a), Semigroup (g a)) => Semigroup (Product f g a)

Since: base-4.16.0.0

Defined in Data.Functor.Product

Methods

(<>) :: Product f g a -> Product f g a -> Product f g a

sconcat :: NonEmpty (Product f g a) -> Product f g a

stimes :: Integral b => b -> Product f g a -> Product f g a

(Semigroup (f p), Semigroup (g p)) => Semigroup ((f :*: g) p)

Since: base-4.12.0.0

Defined in GHC.Generics

Methods

(<>) :: (f :*: g) p -> (f :*: g) p -> (f :*: g) p

sconcat :: NonEmpty ((f :*: g) p) -> (f :*: g) p

stimes :: Integral b => b -> (f :*: g) p -> (f :*: g) p

Semigroup c => Semigroup (K1 i c p)

Since: base-4.12.0.0

Defined in GHC.Generics

Methods

(<>) :: K1 i c p -> K1 i c p -> K1 i c p

sconcat :: NonEmpty (K1 i c p) -> K1 i c p

stimes :: Integral b => b -> K1 i c p -> K1 i c p

Semigroup a => Semigroup (ParsecT s u m a)

The Semigroup instance for ParsecT is used to append the result of several parsers, for example:

(many $ char a) <> (many $ char b)

The above will parse a string like "aabbb" and return a successful parse result "aabbb". Compare against the below which will produce a result of "bbb" for the same input:

(many $ char a) >> (many $ char b)
(many $ char a) *> (many $ char b)

Since: parsec-3.1.12

Defined in Text.Parsec.Prim

Methods

(<>) :: ParsecT s u m a -> ParsecT s u m a -> ParsecT s u m a

sconcat :: NonEmpty (ParsecT s u m a) -> ParsecT s u m a

stimes :: Integral b => b -> ParsecT s u m a -> ParsecT s u m a

(Semigroup a, Semigroup b, Semigroup c, Semigroup d) => Semigroup (a, b, c, d)

Since: base-4.9.0.0

Defined in GHC.Base

Methods

(<>) :: (a, b, c, d) -> (a, b, c, d) -> (a, b, c, d)

sconcat :: NonEmpty (a, b, c, d) -> (a, b, c, d)

stimes :: Integral b0 => b0 -> (a, b, c, d) -> (a, b, c, d)

Semigroup (f (g a)) => Semigroup (Compose f g a)

Since: base-4.16.0.0

Defined in Data.Functor.Compose

Methods

(<>) :: Compose f g a -> Compose f g a -> Compose f g a

sconcat :: NonEmpty (Compose f g a) -> Compose f g a

stimes :: Integral b => b -> Compose f g a -> Compose f g a

Semigroup (f (g p)) => Semigroup ((f :.: g) p)

Since: base-4.12.0.0

Defined in GHC.Generics

Methods

(<>) :: (f :.: g) p -> (f :.: g) p -> (f :.: g) p

sconcat :: NonEmpty ((f :.: g) p) -> (f :.: g) p

stimes :: Integral b => b -> (f :.: g) p -> (f :.: g) p

Semigroup (f p) => Semigroup (M1 i c f p)

Since: base-4.12.0.0

Defined in GHC.Generics

Methods

(<>) :: M1 i c f p -> M1 i c f p -> M1 i c f p

sconcat :: NonEmpty (M1 i c f p) -> M1 i c f p

stimes :: Integral b => b -> M1 i c f p -> M1 i c f p

(Semigroup a, Semigroup b, Semigroup c, Semigroup d, Semigroup e) => Semigroup (a, b, c, d, e)

Since: base-4.9.0.0

Defined in GHC.Base

Methods

(<>) :: (a, b, c, d, e) -> (a, b, c, d, e) -> (a, b, c, d, e)

sconcat :: NonEmpty (a, b, c, d, e) -> (a, b, c, d, e)

stimes :: Integral b0 => b0 -> (a, b, c, d, e) -> (a, b, c, d, e)

class Semigroup a => Monoid a where

The class of monoids (types with an associative binary operation that has an identity). Instances should satisfy the following:

Right identity

x <> mempty = x

Left identity

mempty <> x = x

Associativity

x <> (y <> z) = (x <> y) <> z (Semigroup law)

Concatenation

mconcat = foldr (<>) mempty

The method names refer to the monoid of lists under concatenation, but there are many other instances.

Some types can be viewed as a monoid in more than one way, e.g. both addition and multiplication on numbers. In such cases we often define newtypes and make those instances of Monoid, e.g. Sum and Product.

NOTE: Semigroup is a superclass of Monoid since base-4.11.0.0.

Minimal complete definition

mempty

Methods

mempty :: a

Identity of mappend

>>> "Hello world" <> mempty
"Hello world"

mappend :: a -> a -> a

An associative operation

NOTE: This method is redundant and has the default implementation mappend = (<>) since base-4.11.0.0. Should it be implemented manually, since mappend is a synonym for (<>), it is expected that the two functions are defined the same way. In a future GHC release mappend will be removed from Monoid.

mconcat :: [a] -> a

Fold a list using the monoid.

For most types, the default definition for mconcat will be used, but the function is included in the class definition so that an optimized version can be provided for specific types.

>>> mconcat ["Hello", " ", "Haskell", "!"]
"Hello Haskell!"

Instances

Monoid Benchmark

Defined in Distribution.Types.Benchmark

Methods

mempty :: Benchmark

mappend :: Benchmark -> Benchmark -> Benchmark

mconcat :: [Benchmark] -> Benchmark

Monoid BenchmarkInterface

Defined in Distribution.Types.BenchmarkInterface

Methods

mempty :: BenchmarkInterface

mappend :: BenchmarkInterface -> BenchmarkInterface -> BenchmarkInterface

mconcat :: [BenchmarkInterface] -> BenchmarkInterface

Monoid BuildInfo

Defined in Distribution.Types.BuildInfo

Methods

mempty :: BuildInfo

mappend :: BuildInfo -> BuildInfo -> BuildInfo

mconcat :: [BuildInfo] -> BuildInfo

Monoid DependencyMap

Defined in Distribution.Types.DependencyMap

Methods

mempty :: DependencyMap

mappend :: DependencyMap -> DependencyMap -> DependencyMap

mconcat :: [DependencyMap] -> DependencyMap

Monoid Executable

Defined in Distribution.Types.Executable

Methods

mempty :: Executable

mappend :: Executable -> Executable -> Executable

mconcat :: [Executable] -> Executable

Monoid ExecutableScope

mempty = ExecutablePublic

Defined in Distribution.Types.ExecutableScope

Methods

mempty :: ExecutableScope

mappend :: ExecutableScope -> ExecutableScope -> ExecutableScope

mconcat :: [ExecutableScope] -> ExecutableScope

Monoid FlagAssignment

Defined in Distribution.Types.Flag

Methods

mempty :: FlagAssignment

mappend :: FlagAssignment -> FlagAssignment -> FlagAssignment

mconcat :: [FlagAssignment] -> FlagAssignment

Monoid ForeignLib

Defined in Distribution.Types.ForeignLib

Methods

mempty :: ForeignLib

mappend :: ForeignLib -> ForeignLib -> ForeignLib

mconcat :: [ForeignLib] -> ForeignLib

Monoid ForeignLibType

Defined in Distribution.Types.ForeignLibType

Methods

mempty :: ForeignLibType

mappend :: ForeignLibType -> ForeignLibType -> ForeignLibType

mconcat :: [ForeignLibType] -> ForeignLibType

Monoid Library

This instance is not good.

We need it for addBuildableCondition. More correct method would be some kind of "create empty clone".

More concretely, addBuildableCondition will make `libVisibility = False` libraries when `buildable: false`. This may cause problems.

Defined in Distribution.Types.Library

Methods

mempty :: Library

mappend :: Library -> Library -> Library

mconcat :: [Library] -> Library

Monoid LibraryVisibility

Defined in Distribution.Types.LibraryVisibility

Methods

mempty :: LibraryVisibility

mappend :: LibraryVisibility -> LibraryVisibility -> LibraryVisibility

mconcat :: [LibraryVisibility] -> LibraryVisibility

Monoid SetupBuildInfo

Defined in Distribution.Types.SetupBuildInfo

Methods

mempty :: SetupBuildInfo

mappend :: SetupBuildInfo -> SetupBuildInfo -> SetupBuildInfo

mconcat :: [SetupBuildInfo] -> SetupBuildInfo

Monoid TestSuite

Defined in Distribution.Types.TestSuite

Methods

mempty :: TestSuite

mappend :: TestSuite -> TestSuite -> TestSuite

mconcat :: [TestSuite] -> TestSuite

Monoid TestSuiteInterface

Defined in Distribution.Types.TestSuiteInterface

Methods

mempty :: TestSuiteInterface

mappend :: TestSuiteInterface -> TestSuiteInterface -> TestSuiteInterface

mconcat :: [TestSuiteInterface] -> TestSuiteInterface

Monoid UnqualComponentName

Defined in Distribution.Types.UnqualComponentName

Methods

mempty :: UnqualComponentName

mappend :: UnqualComponentName -> UnqualComponentName -> UnqualComponentName

mconcat :: [UnqualComponentName] -> UnqualComponentName

Monoid ShortText

Defined in Distribution.Utils.ShortText

Methods

mempty :: ShortText

mappend :: ShortText -> ShortText -> ShortText

mconcat :: [ShortText] -> ShortText

Monoid All

Since: base-2.1

Defined in Data.Semigroup.Internal

Methods

mempty :: All

mappend :: All -> All -> All

mconcat :: [All] -> All

Monoid Any

Since: base-2.1

Defined in Data.Semigroup.Internal

Methods

mempty :: Any

mappend :: Any -> Any -> Any

mconcat :: [Any] -> Any

Monoid Builder

Defined in Data.ByteString.Builder.Internal

Methods

mempty :: Builder

mappend :: Builder -> Builder -> Builder

mconcat :: [Builder] -> Builder

Monoid ByteString

Defined in Data.ByteString.Internal

Methods

mempty :: ByteString

mappend :: ByteString -> ByteString -> ByteString

mconcat :: [ByteString] -> ByteString

Monoid ByteString

Defined in Data.ByteString.Lazy.Internal

Methods

mempty :: ByteString

mappend :: ByteString -> ByteString -> ByteString

mconcat :: [ByteString] -> ByteString

Monoid ShortByteString

Defined in Data.ByteString.Short.Internal

Methods

mempty :: ShortByteString

mappend :: ShortByteString -> ShortByteString -> ShortByteString

mconcat :: [ShortByteString] -> ShortByteString

Monoid IntSet

Defined in Data.IntSet.Internal

Methods

mempty :: IntSet

mappend :: IntSet -> IntSet -> IntSet

mconcat :: [IntSet] -> IntSet

Monoid Ordering

Since: base-2.1

Defined in GHC.Base

Methods

mempty :: Ordering

mappend :: Ordering -> Ordering -> Ordering

mconcat :: [Ordering] -> Ordering

Monoid Doc

Defined in Text.PrettyPrint.HughesPJ

Methods

mempty :: Doc

mappend :: Doc -> Doc -> Doc

mconcat :: [Doc] -> Doc

Monoid ()

Since: base-2.1

Defined in GHC.Base

Methods

mempty :: ()

mappend :: () -> () -> ()

mconcat :: [()] -> ()

Monoid (DList a)

Defined in Distribution.Compat.DList

Methods

mempty :: DList a

mappend :: DList a -> DList a -> DList a

mconcat :: [DList a] -> DList a

Semigroup a => Monoid (Option' a)

Defined in Distribution.Compat.Semigroup

Methods

mempty :: Option' a

mappend :: Option' a -> Option' a -> Option' a

mconcat :: [Option' a] -> Option' a

(Semigroup a, Monoid a) => Monoid (PerCompilerFlavor a)

Defined in Distribution.Compiler

Methods

mempty :: PerCompilerFlavor a

mappend :: PerCompilerFlavor a -> PerCompilerFlavor a -> PerCompilerFlavor a

mconcat :: [PerCompilerFlavor a] -> PerCompilerFlavor a

Monoid (Condition a)

Defined in Distribution.Types.Condition

Methods

mempty :: Condition a

mappend :: Condition a -> Condition a -> Condition a

mconcat :: [Condition a] -> Condition a

FiniteBits a => Monoid (And a)

This constraint is arguably too strong. However, as some types (such as Natural) have undefined complement, this is the only safe choice.

Since: base-4.16

Defined in Data.Bits

Methods

mempty :: And a

mappend :: And a -> And a -> And a

mconcat :: [And a] -> And a

FiniteBits a => Monoid (Iff a)

This constraint is arguably too strong. However, as some types (such as Natural) have undefined complement, this is the only safe choice.

Since: base-4.16

Defined in Data.Bits

Methods

mempty :: Iff a

mappend :: Iff a -> Iff a -> Iff a

mconcat :: [Iff a] -> Iff a

Bits a => Monoid (Ior a)

Since: base-4.16

Defined in Data.Bits

Methods

mempty :: Ior a

mappend :: Ior a -> Ior a -> Ior a

mconcat :: [Ior a] -> Ior a

Bits a => Monoid (Xor a)

Since: base-4.16

Defined in Data.Bits

Methods

mempty :: Xor a

mappend :: Xor a -> Xor a -> Xor a

mconcat :: [Xor a] -> Xor a

Monoid a => Monoid (Identity a)

Since: base-4.9.0.0

Defined in Data.Functor.Identity

Methods

mempty :: Identity a

mappend :: Identity a -> Identity a -> Identity a

mconcat :: [Identity a] -> Identity a

Ord a => Monoid (Max a)

Since: base-4.8.0.0

Defined in Data.Functor.Utils

Methods

mempty :: Max a

mappend :: Max a -> Max a -> Max a

mconcat :: [Max a] -> Max a

Ord a => Monoid (Min a)

Since: base-4.8.0.0

Defined in Data.Functor.Utils

Methods

mempty :: Min a

mappend :: Min a -> Min a -> Min a

mconcat :: [Min a] -> Min a

Monoid (First a)

Since: base-2.1

Defined in Data.Monoid

Methods

mempty :: First a

mappend :: First a -> First a -> First a

mconcat :: [First a] -> First a

Monoid (Last a)

Since: base-2.1

Defined in Data.Monoid

Methods

mempty :: Last a

mappend :: Last a -> Last a -> Last a

mconcat :: [Last a] -> Last a

Monoid a => Monoid (Down a)

Since: base-4.11.0.0

Defined in Data.Ord

Methods

mempty :: Down a

mappend :: Down a -> Down a -> Down a

mconcat :: [Down a] -> Down a

(Ord a, Bounded a) => Monoid (Max a)

Since: base-4.9.0.0

Defined in Data.Semigroup

Methods

mempty :: Max a

mappend :: Max a -> Max a -> Max a

mconcat :: [Max a] -> Max a

(Ord a, Bounded a) => Monoid (Min a)

Since: base-4.9.0.0

Defined in Data.Semigroup

Methods

mempty :: Min a

mappend :: Min a -> Min a -> Min a

mconcat :: [Min a] -> Min a

Monoid m => Monoid (WrappedMonoid m)

Since: base-4.9.0.0

Defined in Data.Semigroup

Methods

mempty :: WrappedMonoid m

mappend :: WrappedMonoid m -> WrappedMonoid m -> WrappedMonoid m

mconcat :: [WrappedMonoid m] -> WrappedMonoid m

Monoid a => Monoid (Dual a)

Since: base-2.1

Defined in Data.Semigroup.Internal

Methods

mempty :: Dual a

mappend :: Dual a -> Dual a -> Dual a

mconcat :: [Dual a] -> Dual a

Monoid (Endo a)

Since: base-2.1

Defined in Data.Semigroup.Internal

Methods

mempty :: Endo a

mappend :: Endo a -> Endo a -> Endo a

mconcat :: [Endo a] -> Endo a

Num a => Monoid (Product a)

Since: base-2.1

Defined in Data.Semigroup.Internal

Methods

mempty :: Product a

mappend :: Product a -> Product a -> Product a

mconcat :: [Product a] -> Product a

Num a => Monoid (Sum a)

Since: base-2.1

Defined in Data.Semigroup.Internal

Methods

mempty :: Sum a

mappend :: Sum a -> Sum a -> Sum a

mconcat :: [Sum a] -> Sum a

Monoid p => Monoid (Par1 p)

Since: base-4.12.0.0

Defined in GHC.Generics

Methods

mempty :: Par1 p

mappend :: Par1 p -> Par1 p -> Par1 p

mconcat :: [Par1 p] -> Par1 p

Monoid (PutM ())

Defined in Data.Binary.Put

Methods

mempty :: PutM ()

mappend :: PutM () -> PutM () -> PutM ()

mconcat :: [PutM ()] -> PutM ()

Monoid (IntMap a)

Defined in Data.IntMap.Internal

Methods

mempty :: IntMap a

mappend :: IntMap a -> IntMap a -> IntMap a

mconcat :: [IntMap a] -> IntMap a

Monoid (Seq a)

Defined in Data.Sequence.Internal

Methods

mempty :: Seq a

mappend :: Seq a -> Seq a -> Seq a

mconcat :: [Seq a] -> Seq a

Monoid (MergeSet a)

Defined in Data.Set.Internal

Methods

mempty :: MergeSet a

mappend :: MergeSet a -> MergeSet a -> MergeSet a

mconcat :: [MergeSet a] -> MergeSet a

Ord a => Monoid (Set a)

Defined in Data.Set.Internal

Methods

mempty :: Set a

mappend :: Set a -> Set a -> Set a

mconcat :: [Set a] -> Set a

Monoid a => Monoid (IO a)

Since: base-4.9.0.0

Defined in GHC.Base

Methods

mempty :: IO a

mappend :: IO a -> IO a -> IO a

mconcat :: [IO a] -> IO a

Monoid (Doc a)

Defined in Text.PrettyPrint.Annotated.HughesPJ

Methods

mempty :: Doc a

mappend :: Doc a -> Doc a -> Doc a

mconcat :: [Doc a] -> Doc a

Monoid a => Monoid (Q a)

Since: template-haskell-2.17.0.0

Defined in Language.Haskell.TH.Syntax

Methods

mempty :: Q a

mappend :: Q a -> Q a -> Q a

mconcat :: [Q a] -> Q a

Semigroup a => Monoid (Maybe a)

Lift a semigroup into Maybe forming a Monoid according to http://en.wikipedia.org/wiki/Monoid: "Any semigroup S may be turned into a monoid simply by adjoining an element e not in S and defining e*e = e and e*s = s = s*e for all s ∈ S."

Since 4.11.0: constraint on inner a value generalised from Monoid to Semigroup.

Since: base-2.1

Defined in GHC.Base

Methods

mempty :: Maybe a

mappend :: Maybe a -> Maybe a -> Maybe a

mconcat :: [Maybe a] -> Maybe a

Monoid a => Monoid (a)

Since: base-4.15

Defined in GHC.Base

Methods

mempty :: (a)

mappend :: (a) -> (a) -> (a)

mconcat :: [(a)] -> (a)

Monoid [a]

Since: base-2.1

Defined in GHC.Base

Methods

mempty :: [a]

mappend :: [a] -> [a] -> [a]

mconcat :: [[a]] -> [a]

Monoid (Proxy s)

Since: base-4.7.0.0

Defined in Data.Proxy

Methods

mempty :: Proxy s

mappend :: Proxy s -> Proxy s -> Proxy s

mconcat :: [Proxy s] -> Proxy s

Monoid (U1 p)

Since: base-4.12.0.0

Defined in GHC.Generics

Methods

mempty :: U1 p

mappend :: U1 p -> U1 p -> U1 p

mconcat :: [U1 p] -> U1 p

Ord k => Monoid (Map k v)

Defined in Data.Map.Internal

Methods

mempty :: Map k v

mappend :: Map k v -> Map k v -> Map k v

mconcat :: [Map k v] -> Map k v

Monoid b => Monoid (a -> b)

Since: base-2.1

Defined in GHC.Base

Methods

mempty :: a -> b

mappend :: (a -> b) -> (a -> b) -> a -> b

mconcat :: [a -> b] -> a -> b

(Monoid a, Monoid b) => Monoid (a, b)

Since: base-2.1

Defined in GHC.Base

Methods

mempty :: (a, b)

mappend :: (a, b) -> (a, b) -> (a, b)

mconcat :: [(a, b)] -> (a, b)

(Semigroup a, Semigroup c, Monoid a, Monoid c) => Monoid (CondTree v c a)

Defined in Distribution.Types.CondTree

Methods

mempty :: CondTree v c a

mappend :: CondTree v c a -> CondTree v c a -> CondTree v c a

mconcat :: [CondTree v c a] -> CondTree v c a

Monoid a => Monoid (Const a b)

Since: base-4.9.0.0

Defined in Data.Functor.Const

Methods

mempty :: Const a b

mappend :: Const a b -> Const a b -> Const a b

mconcat :: [Const a b] -> Const a b

(Applicative f, Monoid a) => Monoid (Ap f a)

Since: base-4.12.0.0

Defined in Data.Monoid

Methods

mempty :: Ap f a

mappend :: Ap f a -> Ap f a -> Ap f a

mconcat :: [Ap f a] -> Ap f a

Alternative f => Monoid (Alt f a)

Since: base-4.8.0.0

Defined in Data.Semigroup.Internal

Methods

mempty :: Alt f a

mappend :: Alt f a -> Alt f a -> Alt f a

mconcat :: [Alt f a] -> Alt f a

Monoid (f p) => Monoid (Rec1 f p)

Since: base-4.12.0.0

Defined in GHC.Generics

Methods

mempty :: Rec1 f p

mappend :: Rec1 f p -> Rec1 f p -> Rec1 f p

mconcat :: [Rec1 f p] -> Rec1 f p

(Monoid a, Monoid b, Monoid c) => Monoid (a, b, c)

Since: base-2.1

Defined in GHC.Base

Methods

mempty :: (a, b, c)

mappend :: (a, b, c) -> (a, b, c) -> (a, b, c)

mconcat :: [(a, b, c)] -> (a, b, c)

(Monoid (f a), Monoid (g a)) => Monoid (Product f g a)

Since: base-4.16.0.0

Defined in Data.Functor.Product

Methods

mempty :: Product f g a

mappend :: Product f g a -> Product f g a -> Product f g a

mconcat :: [Product f g a] -> Product f g a

(Monoid (f p), Monoid (g p)) => Monoid ((f :*: g) p)

Since: base-4.12.0.0

Defined in GHC.Generics

Methods

mempty :: (f :*: g) p

mappend :: (f :*: g) p -> (f :*: g) p -> (f :*: g) p

mconcat :: [(f :*: g) p] -> (f :*: g) p

Monoid c => Monoid (K1 i c p)

Since: base-4.12.0.0

Defined in GHC.Generics

Methods

mempty :: K1 i c p

mappend :: K1 i c p -> K1 i c p -> K1 i c p

mconcat :: [K1 i c p] -> K1 i c p

(Monoid a, Semigroup (ParsecT s u m a)) => Monoid (ParsecT s u m a)

The Monoid instance for ParsecT is used for the same purposes as the Semigroup instance.

Since: parsec-3.1.12

Defined in Text.Parsec.Prim

Methods

mempty :: ParsecT s u m a

mappend :: ParsecT s u m a -> ParsecT s u m a -> ParsecT s u m a

mconcat :: [ParsecT s u m a] -> ParsecT s u m a

(Monoid a, Monoid b, Monoid c, Monoid d) => Monoid (a, b, c, d)

Since: base-2.1

Defined in GHC.Base

Methods

mempty :: (a, b, c, d)

mappend :: (a, b, c, d) -> (a, b, c, d) -> (a, b, c, d)

mconcat :: [(a, b, c, d)] -> (a, b, c, d)

Monoid (f (g a)) => Monoid (Compose f g a)

Since: base-4.16.0.0

Defined in Data.Functor.Compose

Methods

mempty :: Compose f g a

mappend :: Compose f g a -> Compose f g a -> Compose f g a

mconcat :: [Compose f g a] -> Compose f g a

Monoid (f (g p)) => Monoid ((f :.: g) p)

Since: base-4.12.0.0

Defined in GHC.Generics

Methods

mempty :: (f :.: g) p

mappend :: (f :.: g) p -> (f :.: g) p -> (f :.: g) p

mconcat :: [(f :.: g) p] -> (f :.: g) p

Monoid (f p) => Monoid (M1 i c f p)

Since: base-4.12.0.0

Defined in GHC.Generics

Methods

mempty :: M1 i c f p

mappend :: M1 i c f p -> M1 i c f p -> M1 i c f p

mconcat :: [M1 i c f p] -> M1 i c f p

(Monoid a, Monoid b, Monoid c, Monoid d, Monoid e) => Monoid (a, b, c, d, e)

Since: base-2.1

Defined in GHC.Base

Methods

mempty :: (a, b, c, d, e)

mappend :: (a, b, c, d, e) -> (a, b, c, d, e) -> (a, b, c, d, e)

mconcat :: [(a, b, c, d, e)] -> (a, b, c, d, e)

newtype All

Boolean monoid under conjunction (&&).

>>> getAll (All True <> mempty <> All False)
False

>>> getAll (mconcat (map (\x -> All (even x)) [2,4,6,7,8]))
False

Constructors

All

Fields

• getAll :: Bool

Instances

Data All

Since: base-4.8.0.0

Defined in Data.Data

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> All -> c All

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c All

toConstr :: All -> Constr

dataTypeOf :: All -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c All)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c All)

gmapT :: (forall b. Data b => b -> b) -> All -> All

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> All -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> All -> r

gmapQ :: (forall d. Data d => d -> u) -> All -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> All -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> All -> m All

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> All -> m All

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> All -> m All

Monoid All

Since: base-2.1

Defined in Data.Semigroup.Internal

Methods

mempty :: All

mappend :: All -> All -> All

mconcat :: [All] -> All

Semigroup All

Since: base-4.9.0.0

Defined in Data.Semigroup.Internal

Methods

(<>) :: All -> All -> All

sconcat :: NonEmpty All -> All

stimes :: Integral b => b -> All -> All

Bounded All

Since: base-2.1

Defined in Data.Semigroup.Internal

Methods

minBound :: All

maxBound :: All

Generic All

Defined in Data.Semigroup.Internal

Associated Types

type Rep All :: Type -> Type

Methods

from :: All -> Rep All x

to :: Rep All x -> All

Read All

Since: base-2.1

Defined in Data.Semigroup.Internal

Methods

readsPrec :: Int -> ReadS All

readList :: ReadS [All]

readPrec :: ReadPrec All

readListPrec :: ReadPrec [All]

Show All

Since: base-2.1

Defined in Data.Semigroup.Internal

Methods

showsPrec :: Int -> All -> ShowS

show :: All -> String

showList :: [All] -> ShowS

Binary All

Since: binary-0.8.4.0

Defined in Data.Binary.Class

Methods

put :: All -> Put

get :: Get All

putList :: [All] -> Put

NFData All

Since: deepseq-1.4.0.0

Defined in Control.DeepSeq

Methods

rnf :: All -> ()

Eq All

Since: base-2.1

Defined in Data.Semigroup.Internal

Methods

(==) :: All -> All -> Bool

(/=) :: All -> All -> Bool

Ord All

Since: base-2.1

Defined in Data.Semigroup.Internal

Methods

compare :: All -> All -> Ordering

(<) :: All -> All -> Bool

(<=) :: All -> All -> Bool

(>) :: All -> All -> Bool

(>=) :: All -> All -> Bool

max :: All -> All -> All

min :: All -> All -> All

type Rep All

Since: base-4.7.0.0

Defined in Data.Semigroup.Internal

type Rep All = D1 ('MetaData "All" "Data.Semigroup.Internal" "base" 'True) (C1 ('MetaCons "All" 'PrefixI 'True) (S1 ('MetaSel ('Just "getAll") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Bool)))

newtype Any

Boolean monoid under disjunction (||).

>>> getAny (Any True <> mempty <> Any False)
True

>>> getAny (mconcat (map (\x -> Any (even x)) [2,4,6,7,8]))
True

Constructors

Any

Fields

• getAny :: Bool

Instances

Data Any

Since: base-4.8.0.0

Defined in Data.Data

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Any -> c Any

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Any

toConstr :: Any -> Constr

dataTypeOf :: Any -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c Any)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Any)

gmapT :: (forall b. Data b => b -> b) -> Any -> Any

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Any -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Any -> r

gmapQ :: (forall d. Data d => d -> u) -> Any -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> Any -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> Any -> m Any

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Any -> m Any

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Any -> m Any

Monoid Any

Since: base-2.1

Defined in Data.Semigroup.Internal

Methods

mempty :: Any

mappend :: Any -> Any -> Any

mconcat :: [Any] -> Any

Semigroup Any

Since: base-4.9.0.0

Defined in Data.Semigroup.Internal

Methods

(<>) :: Any -> Any -> Any

sconcat :: NonEmpty Any -> Any

stimes :: Integral b => b -> Any -> Any

Bounded Any

Since: base-2.1

Defined in Data.Semigroup.Internal

Methods

minBound :: Any

maxBound :: Any

Generic Any

Defined in Data.Semigroup.Internal

Associated Types

type Rep Any :: Type -> Type

Methods

from :: Any -> Rep Any x

to :: Rep Any x -> Any

Read Any

Since: base-2.1

Defined in Data.Semigroup.Internal

Methods

readsPrec :: Int -> ReadS Any

readList :: ReadS [Any]

readPrec :: ReadPrec Any

readListPrec :: ReadPrec [Any]

Show Any

Since: base-2.1

Defined in Data.Semigroup.Internal

Methods

showsPrec :: Int -> Any -> ShowS

show :: Any -> String

showList :: [Any] -> ShowS

Binary Any

Since: binary-0.8.4.0

Defined in Data.Binary.Class

Methods

put :: Any -> Put

get :: Get Any

putList :: [Any] -> Put

NFData Any

Since: deepseq-1.4.0.0

Defined in Control.DeepSeq

Methods

rnf :: Any -> ()

Eq Any

Since: base-2.1

Defined in Data.Semigroup.Internal

Methods

(==) :: Any -> Any -> Bool

(/=) :: Any -> Any -> Bool

Ord Any

Since: base-2.1

Defined in Data.Semigroup.Internal

Methods

compare :: Any -> Any -> Ordering

(<) :: Any -> Any -> Bool

(<=) :: Any -> Any -> Bool

(>) :: Any -> Any -> Bool

(>=) :: Any -> Any -> Bool

max :: Any -> Any -> Any

min :: Any -> Any -> Any

type Rep Any

Since: base-4.7.0.0

Defined in Data.Semigroup.Internal

type Rep Any = D1 ('MetaData "Any" "Data.Semigroup.Internal" "base" 'True) (C1 ('MetaCons "Any" 'PrefixI 'True) (S1 ('MetaSel ('Just "getAny") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Bool)))

newtype First' a

A copy of First.

Constructors

First'

Fields

• getFirst' :: a

Instances

Semigroup (First' a)

Defined in Distribution.Compat.Semigroup

Methods

(<>) :: First' a -> First' a -> First' a

sconcat :: NonEmpty (First' a) -> First' a

stimes :: Integral b => b -> First' a -> First' a

Show a => Show (First' a)

Defined in Distribution.Compat.Semigroup

Methods

showsPrec :: Int -> First' a -> ShowS

show :: First' a -> String

showList :: [First' a] -> ShowS

Eq a => Eq (First' a)

Defined in Distribution.Compat.Semigroup

Methods

(==) :: First' a -> First' a -> Bool

(/=) :: First' a -> First' a -> Bool

Ord a => Ord (First' a)

Defined in Distribution.Compat.Semigroup

Methods

compare :: First' a -> First' a -> Ordering

(<) :: First' a -> First' a -> Bool

(<=) :: First' a -> First' a -> Bool

(>) :: First' a -> First' a -> Bool

(>=) :: First' a -> First' a -> Bool

max :: First' a -> First' a -> First' a

min :: First' a -> First' a -> First' a

newtype Last' a

A copy of Last.

Constructors

Last'

Fields

• getLast' :: a

Instances

Functor Last'

Defined in Distribution.Compat.Semigroup

Methods

fmap :: (a -> b) -> Last' a -> Last' b

(<$) :: a -> Last' b -> Last' a

Structured a => Structured (Last' a)

Defined in Distribution.Compat.Semigroup

Methods

structure :: Proxy (Last' a) -> Structure

structureHash' :: Tagged (Last' a) MD5

Semigroup (Last' a)

Defined in Distribution.Compat.Semigroup

Methods

(<>) :: Last' a -> Last' a -> Last' a

sconcat :: NonEmpty (Last' a) -> Last' a

stimes :: Integral b => b -> Last' a -> Last' a

Generic (Last' a)

Defined in Distribution.Compat.Semigroup

Associated Types

type Rep (Last' a) :: Type -> Type

Methods

from :: Last' a -> Rep (Last' a) x

to :: Rep (Last' a) x -> Last' a

Read a => Read (Last' a)

Defined in Distribution.Compat.Semigroup

Methods

readsPrec :: Int -> ReadS (Last' a)

readList :: ReadS [Last' a]

readPrec :: ReadPrec (Last' a)

readListPrec :: ReadPrec [Last' a]

Show a => Show (Last' a)

Defined in Distribution.Compat.Semigroup

Methods

showsPrec :: Int -> Last' a -> ShowS

show :: Last' a -> String

showList :: [Last' a] -> ShowS

Binary a => Binary (Last' a)

Defined in Distribution.Compat.Semigroup

Methods

put :: Last' a -> Put

get :: Get (Last' a)

putList :: [Last' a] -> Put

Eq a => Eq (Last' a)

Defined in Distribution.Compat.Semigroup

Methods

(==) :: Last' a -> Last' a -> Bool

(/=) :: Last' a -> Last' a -> Bool

Ord a => Ord (Last' a)

Defined in Distribution.Compat.Semigroup

Methods

compare :: Last' a -> Last' a -> Ordering

(<) :: Last' a -> Last' a -> Bool

(<=) :: Last' a -> Last' a -> Bool

(>) :: Last' a -> Last' a -> Bool

(>=) :: Last' a -> Last' a -> Bool

max :: Last' a -> Last' a -> Last' a

min :: Last' a -> Last' a -> Last' a

type Rep (Last' a)

Defined in Distribution.Compat.Semigroup

type Rep (Last' a) = D1 ('MetaData "Last'" "Distribution.Compat.Semigroup" "Cabal-syntax-3.10.2.0-4s9v55YS0UyD8dLofJ8HlN" 'True) (C1 ('MetaCons "Last'" 'PrefixI 'True) (S1 ('MetaSel ('Just "getLast'") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a)))

newtype Option' a

A wrapper around Maybe, providing the Semigroup and Monoid instances implemented for Maybe since base-4.11.

Constructors

Option'

Fields

• getOption' :: Maybe a

Instances

Functor Option'

Defined in Distribution.Compat.Semigroup

Methods

fmap :: (a -> b) -> Option' a -> Option' b

(<$) :: a -> Option' b -> Option' a

Structured a => Structured (Option' a)

Defined in Distribution.Compat.Semigroup

Methods

structure :: Proxy (Option' a) -> Structure

structureHash' :: Tagged (Option' a) MD5

Semigroup a => Monoid (Option' a)

Defined in Distribution.Compat.Semigroup

Methods

mempty :: Option' a

mappend :: Option' a -> Option' a -> Option' a

mconcat :: [Option' a] -> Option' a

Semigroup a => Semigroup (Option' a)

Defined in Distribution.Compat.Semigroup

Methods

(<>) :: Option' a -> Option' a -> Option' a

sconcat :: NonEmpty (Option' a) -> Option' a

stimes :: Integral b => b -> Option' a -> Option' a

Generic (Option' a)

Defined in Distribution.Compat.Semigroup

Associated Types

type Rep (Option' a) :: Type -> Type

Methods

from :: Option' a -> Rep (Option' a) x

to :: Rep (Option' a) x -> Option' a

Read a => Read (Option' a)

Defined in Distribution.Compat.Semigroup

Methods

readsPrec :: Int -> ReadS (Option' a)

readList :: ReadS [Option' a]

readPrec :: ReadPrec (Option' a)

readListPrec :: ReadPrec [Option' a]

Show a => Show (Option' a)

Defined in Distribution.Compat.Semigroup

Methods

showsPrec :: Int -> Option' a -> ShowS

show :: Option' a -> String

showList :: [Option' a] -> ShowS

Binary a => Binary (Option' a)

Defined in Distribution.Compat.Semigroup

Methods

put :: Option' a -> Put

get :: Get (Option' a)

putList :: [Option' a] -> Put

Eq a => Eq (Option' a)

Defined in Distribution.Compat.Semigroup

Methods

(==) :: Option' a -> Option' a -> Bool

(/=) :: Option' a -> Option' a -> Bool

Ord a => Ord (Option' a)

Defined in Distribution.Compat.Semigroup

Methods

compare :: Option' a -> Option' a -> Ordering

(<) :: Option' a -> Option' a -> Bool

(<=) :: Option' a -> Option' a -> Bool

(>) :: Option' a -> Option' a -> Bool

(>=) :: Option' a -> Option' a -> Bool

max :: Option' a -> Option' a -> Option' a

min :: Option' a -> Option' a -> Option' a

type Rep (Option' a)

Defined in Distribution.Compat.Semigroup

type Rep (Option' a) = D1 ('MetaData "Option'" "Distribution.Compat.Semigroup" "Cabal-syntax-3.10.2.0-4s9v55YS0UyD8dLofJ8HlN" 'True) (C1 ('MetaCons "Option'" 'PrefixI 'True) (S1 ('MetaSel ('Just "getOption'") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Maybe a))))

gmappend :: (Generic a, GSemigroup (Rep a)) => a -> a -> a

Generically generate a Semigroup (<>) operation for any type implementing Generic. This operation will append two values by point-wise appending their component fields. It is only defined for product types.

gmappend a (gmappend b c) = gmappend (gmappend a b) c

gmempty :: (Generic a, GMonoid (Rep a)) => a

Generically generate a Monoid mempty for any product-like type implementing Generic.

It is only defined for product types.

gmappend gmempty a = a = gmappend a gmempty