Data.Monoid (original) (raw)

Monoid All Source #

Since: base-2.1

Instance details

Defined in Data.Semigroup.Internal

Monoid Any Source #

Since: base-2.1

Instance details

Defined in Data.Semigroup.Internal

Monoid Event Source #

Since: base-4.4.0.0

Instance details

Defined in GHC.Event.Internal.Types

Monoid Lifetime Source #

mappend takes the longer of two lifetimes.

Since: base-4.8.0.0

Instance details

Defined in GHC.Event.Internal.Types

Monoid Ordering Source #

Since: base-2.1

Instance details

Defined in GHC.Base

Monoid () Source #

Since: base-2.1

Instance details

Defined in GHC.Base

FiniteBits a => Monoid (And a) Source #

This constraint is arguably too strong. However, as some types (such as Natural) have undefined [complement](GHC-Bits.html#v:complement "GHC.Bits"), this is the only safe choice.

Since: base-4.16

Instance details

Defined in Data.Bits

FiniteBits a => Monoid (Iff a) Source #

This constraint is arguably too strong. However, as some types (such as Natural) have undefined[complement](GHC-Bits.html#v:complement "GHC.Bits"), this is the only safe choice.

Since: base-4.16

Instance details

Defined in Data.Bits

Bits a => Monoid (Ior a) Source #

Since: base-4.16

Instance details

Defined in Data.Bits

Bits a => Monoid (Xor a) Source #

Since: base-4.16

Instance details

Defined in Data.Bits

Monoid (Comparison a) Source #

`[mempty](Data-Monoid.html#v:mempty "Data.Monoid")` on comparisons always returns EQ. Without newtypes this equals `[pure](Control-Applicative.html#v:pure "Control.Applicative")` (`[pure](Control-Applicative.html#v:pure "Control.Applicative")` EQ).

mempty :: Comparison a mempty = Comparison _ _ -> EQ

Instance details

Defined in Data.Functor.Contravariant

Monoid (Equivalence a) Source #

`[mempty](Data-Monoid.html#v:mempty "Data.Monoid")` on equivalences always returns True. Without newtypes this equals `[pure](Control-Applicative.html#v:pure "Control.Applicative")` (`[pure](Control-Applicative.html#v:pure "Control.Applicative")` True).

mempty :: Equivalence a mempty = Equivalence _ _ -> True

Instance details

Defined in Data.Functor.Contravariant

Monoid (Predicate a) Source #

`[mempty](Data-Monoid.html#v:mempty "Data.Monoid")` on predicates always returns True. Without newtypes this equals `[pure](Control-Applicative.html#v:pure "Control.Applicative")` True.

mempty :: Predicate a mempty = _ -> True

Instance details

Defined in Data.Functor.Contravariant

Monoid a => Monoid (Identity a) Source #

Since: base-4.9.0.0

Instance details

Defined in Data.Functor.Identity

Monoid (First a) Source #

Since: base-2.1

Instance details

Defined in Data.Monoid

Monoid (Last a) Source #

Since: base-2.1

Instance details

Defined in Data.Monoid

Monoid a => Monoid (Down a) Source #

Since: base-4.11.0.0

Instance details

Defined in Data.Ord

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

Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup

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

Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup

Monoid m => Monoid (WrappedMonoid m) Source #

Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup

Monoid a => Monoid (Dual a) Source #

Since: base-2.1

Instance details

Defined in Data.Semigroup.Internal

Monoid (Endo a) Source #

Since: base-2.1

Instance details

Defined in Data.Semigroup.Internal

Num a => Monoid (Product a) Source #

Since: base-2.1

Instance details

Defined in Data.Semigroup.Internal

Num a => Monoid (Sum a) Source #

Since: base-2.1

Instance details

Defined in Data.Semigroup.Internal

Monoid p => Monoid (Par1 p) Source #

Since: base-4.12.0.0

Instance details

Defined in GHC.Generics

Monoid a => Monoid (IO a) Source #

Since: base-4.9.0.0

Instance details

Defined in GHC.Base

Semigroup a => Monoid (Maybe a) Source #

Lift a semigroup into [Maybe](Data-Maybe.html#t:Maybe "Data.Maybe") forming a [Monoid](Data-Monoid.html#t:Monoid "Data.Monoid") according tohttp://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](Data-Monoid.html#t:Monoid "Data.Monoid") to [Semigroup](Prelude.html#t:Semigroup "Prelude").

Since: base-2.1

Instance details

Defined in GHC.Base

Monoid a => Monoid (a) Source #

Since: base-4.15

Instance details

Defined in GHC.Base

Monoid [a] Source #

Since: base-2.1

Instance details

Defined in GHC.Base

Monoid a => Monoid (Op a b) Source #

`[mempty](Data-Monoid.html#v:mempty "Data.Monoid")` @(Op a b) without newtypes is mempty @(b->a) = _ -> mempty.

mempty :: Op a b mempty = Op _ -> mempty

Instance details

Defined in Data.Functor.Contravariant

Monoid (Proxy s) Source #

Since: base-4.7.0.0

Instance details

Defined in Data.Proxy

Monoid (U1 p) Source #

Since: base-4.12.0.0

Instance details

Defined in GHC.Generics

Monoid a => Monoid (ST s a) Source #

Since: base-4.11.0.0

Instance details

Defined in GHC.ST

Monoid b => Monoid (a -> b) Source #

Since: base-2.1

Instance details

Defined in GHC.Base

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

Since: base-2.1

Instance details

Defined in GHC.Base

Monoid a => Monoid (Const a b) Source #

Since: base-4.9.0.0

Instance details

Defined in Data.Functor.Const

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

Since: base-4.12.0.0

Instance details

Defined in Data.Monoid

Alternative f => Monoid (Alt f a) Source #

Since: base-4.8.0.0

Instance details

Defined in Data.Semigroup.Internal

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

Since: base-4.12.0.0

Instance details

Defined in GHC.Generics

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

Since: base-2.1

Instance details

Defined in GHC.Base

Methods

mempty :: (a, b, c) Source #

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

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

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

Since: base-4.16.0.0

Instance details

Defined in Data.Functor.Product

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

Since: base-4.12.0.0

Instance details

Defined in GHC.Generics

Monoid c => Monoid (K1 i c p) Source #

Since: base-4.12.0.0

Instance details

Defined in GHC.Generics

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

Since: base-2.1

Instance details

Defined in GHC.Base

Methods

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

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

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

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

Since: base-4.16.0.0

Instance details

Defined in Data.Functor.Compose

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

Since: base-4.12.0.0

Instance details

Defined in GHC.Generics

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

Since: base-4.12.0.0

Instance details

Defined in GHC.Generics

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

Since: base-2.1

Instance details

Defined in GHC.Base

Methods

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

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

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