Safe Haskell | Safe-Inferred |
---|---|
Language | Haskell2010 |
Data.Monoid.Compat
Documentation
Constructors
Product | |
Fields
|
Instances
Instances
MonadZip Sum | |||||
Foldable1 Sum | |||||
Defined in Data.Foldable1 Methods fold1 :: Semigroup m => Sum m -> m # foldMap1 :: Semigroup m => (a -> m) -> Sum a -> m # foldMap1' :: Semigroup m => (a -> m) -> Sum a -> m # toNonEmpty :: Sum a -> NonEmpty a # maximum :: Ord a => Sum a -> a # minimum :: Ord a => Sum a -> a # foldrMap1 :: (a -> b) -> (a -> b -> b) -> Sum a -> b # foldlMap1' :: (a -> b) -> (b -> a -> b) -> Sum a -> b # foldlMap1 :: (a -> b) -> (b -> a -> b) -> Sum a -> b # foldrMap1' :: (a -> b) -> (a -> b -> b) -> Sum a -> b # | |||||
Applicative Sum | |||||
Functor Sum | |||||
Monad Sum | |||||
Foldable Sum | |||||
Defined in GHC.Internal.Data.Foldable Methods fold :: Monoid m => Sum m -> m # foldMap :: Monoid m => (a -> m) -> Sum a -> m # foldMap' :: Monoid m => (a -> m) -> Sum a -> m # foldr :: (a -> b -> b) -> b -> Sum a -> b # foldr' :: (a -> b -> b) -> b -> Sum a -> b # foldl :: (b -> a -> b) -> b -> Sum a -> b # foldl' :: (b -> a -> b) -> b -> Sum a -> b # foldr1 :: (a -> a -> a) -> Sum a -> a # foldl1 :: (a -> a -> a) -> Sum a -> a # elem :: Eq a => a -> Sum a -> Bool # maximum :: Ord a => Sum a -> a # | |||||
Traversable Sum | |||||
Generic1 Sum | |||||
Defined in GHC.Internal.Data.Semigroup.Internal Associated Types
| |||||
Num a => Monoid (Sum a) | |||||
Num a => Semigroup (Sum a) | |||||
Bounded a => Bounded (Sum a) | |||||
Generic (Sum a) | |||||
Defined in GHC.Internal.Data.Semigroup.Internal Associated Types
| |||||
Num a => Num (Sum a) | |||||
Read a => Read (Sum a) | |||||
Show a => Show (Sum a) | |||||
Eq a => Eq (Sum a) | |||||
Ord a => Ord (Sum a) | |||||
type Rep1 Sum | |||||
Defined in GHC.Internal.Data.Semigroup.Internal | |||||
type Rep (Sum a) | |||||
Defined in GHC.Internal.Data.Semigroup.Internal |
class Semigroup a => Monoid a where #
Instances
Monoid ByteArray | |
Monoid All | |
Monoid Any | |
Monoid ExceptionContext | |
Monoid Ordering | |
Monoid () | |
Monoid (Comparison a) | |
Defined in Data.Functor.Contravariant Methods mempty :: Comparison a # mappend :: Comparison a -> Comparison a -> Comparison a # mconcat :: [Comparison a] -> Comparison a # | |
Monoid (Equivalence a) | |
Defined in Data.Functor.Contravariant Methods mempty :: Equivalence a # mappend :: Equivalence a -> Equivalence a -> Equivalence a # mconcat :: [Equivalence a] -> Equivalence a # | |
Monoid (Predicate a) | |
(Ord a, Bounded a) => Monoid (Max a) | |
(Ord a, Bounded a) => Monoid (Min a) | |
Monoid m => Monoid (WrappedMonoid m) | |
Defined in Data.Semigroup Methods mempty :: WrappedMonoid m # mappend :: WrappedMonoid m -> WrappedMonoid m -> WrappedMonoid m # mconcat :: [WrappedMonoid m] -> WrappedMonoid m # | |
Monoid a => Monoid (STM a) | |
FiniteBits a => Monoid (And a) | |
FiniteBits a => Monoid (Iff a) | |
Bits a => Monoid (Ior a) | |
Bits a => Monoid (Xor a) | |
Monoid a => Monoid (Identity a) | |
Monoid (First a) | |
Monoid (Last a) | |
Monoid a => Monoid (Dual a) | |
Monoid (Endo a) | |
Num a => Monoid (Product a) | |
Num a => Monoid (Sum a) | |
(Generic a, Monoid (Rep a ())) => Monoid (Generically a) | |
Monoid p => Monoid (Par1 p) | |
Monoid a => Monoid (IO a) | |
Semigroup a => Monoid (Maybe a) | |
Monoid a => Monoid (Solo a) | |
Monoid [a] | |
Monoid a => Monoid (Op a b) | |
Monoid (Proxy s) | |
Monoid (U1 p) | |
Monoid a => Monoid (ST s a) | |
(Monoid a, Monoid b) => Monoid (a, b) | |
Monoid b => Monoid (a -> b) | |
Monoid a => Monoid (Const a b) | |
(Applicative f, Monoid a) => Monoid (Ap f a) | |
Alternative f => Monoid (Alt f a) | |
Monoid (f p) => Monoid (Rec1 f p) | |
(Monoid a, Monoid b, Monoid c) => Monoid (a, b, c) | |
(Monoid (f a), Monoid (g a)) => Monoid (Product f g a) | |
(Monoid (f p), Monoid (g p)) => Monoid ((f :*: g) p) | |
Monoid c => Monoid (K1 i c p) | |
(Monoid a, Monoid b, Monoid c, Monoid d) => Monoid (a, b, c, d) | |
Monoid (f (g a)) => Monoid (Compose f g a) | |
Monoid (f (g p)) => Monoid ((f :.: g) p) | |
Monoid (f p) => Monoid (M1 i c f p) | |
(Monoid a, Monoid b, Monoid c, Monoid d, Monoid e) => Monoid (a, b, c, d, e) | |
Instances
MonadZip First | |||||
Applicative First | |||||
Functor First | |||||
Monad First | |||||
Foldable First | |||||
Defined in GHC.Internal.Data.Foldable Methods fold :: Monoid m => First m -> m # foldMap :: Monoid m => (a -> m) -> First a -> m # foldMap' :: Monoid m => (a -> m) -> First a -> m # foldr :: (a -> b -> b) -> b -> First a -> b # foldr' :: (a -> b -> b) -> b -> First a -> b # foldl :: (b -> a -> b) -> b -> First a -> b # foldl' :: (b -> a -> b) -> b -> First a -> b # foldr1 :: (a -> a -> a) -> First a -> a # foldl1 :: (a -> a -> a) -> First a -> a # elem :: Eq a => a -> First a -> Bool # maximum :: Ord a => First a -> a # minimum :: Ord a => First a -> a # | |||||
Traversable First | |||||
Generic1 First | |||||
Defined in GHC.Internal.Data.Monoid Associated Types
| |||||
Monoid (First a) | |||||
Semigroup (First a) | |||||
Generic (First a) | |||||
Defined in GHC.Internal.Data.Monoid Associated Types
| |||||
Read a => Read (First a) | |||||
Show a => Show (First a) | |||||
Eq a => Eq (First a) | |||||
Ord a => Ord (First a) | |||||
Defined in GHC.Internal.Data.Monoid | |||||
type Rep1 First | |||||
type Rep (First a) | |||||
Instances
MonadZip Last | |||||
Applicative Last | |||||
Functor Last | |||||
Monad Last | |||||
Foldable Last | |||||
Defined in GHC.Internal.Data.Foldable Methods fold :: Monoid m => Last m -> m # foldMap :: Monoid m => (a -> m) -> Last a -> m # foldMap' :: Monoid m => (a -> m) -> Last a -> m # foldr :: (a -> b -> b) -> b -> Last a -> b # foldr' :: (a -> b -> b) -> b -> Last a -> b # foldl :: (b -> a -> b) -> b -> Last a -> b # foldl' :: (b -> a -> b) -> b -> Last a -> b # foldr1 :: (a -> a -> a) -> Last a -> a # foldl1 :: (a -> a -> a) -> Last a -> a # elem :: Eq a => a -> Last a -> Bool # maximum :: Ord a => Last a -> a # | |||||
Traversable Last | |||||
Generic1 Last | |||||
Defined in GHC.Internal.Data.Monoid Associated Types
| |||||
Monoid (Last a) | |||||
Semigroup (Last a) | |||||
Generic (Last a) | |||||
Defined in GHC.Internal.Data.Monoid Associated Types
| |||||
Read a => Read (Last a) | |||||
Show a => Show (Last a) | |||||
Eq a => Eq (Last a) | |||||
Ord a => Ord (Last a) | |||||
type Rep1 Last | |||||
type Rep (Last a) | |||||
Instances
MonadZip Dual | |||||
Foldable1 Dual | |||||
Defined in Data.Foldable1 Methods fold1 :: Semigroup m => Dual m -> m # foldMap1 :: Semigroup m => (a -> m) -> Dual a -> m # foldMap1' :: Semigroup m => (a -> m) -> Dual a -> m # toNonEmpty :: Dual a -> NonEmpty a # maximum :: Ord a => Dual a -> a # minimum :: Ord a => Dual a -> a # foldrMap1 :: (a -> b) -> (a -> b -> b) -> Dual a -> b # foldlMap1' :: (a -> b) -> (b -> a -> b) -> Dual a -> b # foldlMap1 :: (a -> b) -> (b -> a -> b) -> Dual a -> b # foldrMap1' :: (a -> b) -> (a -> b -> b) -> Dual a -> b # | |||||
Applicative Dual | |||||
Functor Dual | |||||
Monad Dual | |||||
Foldable Dual | |||||
Defined in GHC.Internal.Data.Foldable Methods fold :: Monoid m => Dual m -> m # foldMap :: Monoid m => (a -> m) -> Dual a -> m # foldMap' :: Monoid m => (a -> m) -> Dual a -> m # foldr :: (a -> b -> b) -> b -> Dual a -> b # foldr' :: (a -> b -> b) -> b -> Dual a -> b # foldl :: (b -> a -> b) -> b -> Dual a -> b # foldl' :: (b -> a -> b) -> b -> Dual a -> b # foldr1 :: (a -> a -> a) -> Dual a -> a # foldl1 :: (a -> a -> a) -> Dual a -> a # elem :: Eq a => a -> Dual a -> Bool # maximum :: Ord a => Dual a -> a # | |||||
Traversable Dual | |||||
Generic1 Dual | |||||
Defined in GHC.Internal.Data.Semigroup.Internal Associated Types
| |||||
Monoid a => Monoid (Dual a) | |||||
Semigroup a => Semigroup (Dual a) | |||||
Bounded a => Bounded (Dual a) | |||||
Generic (Dual a) | |||||
Defined in GHC.Internal.Data.Semigroup.Internal Associated Types
| |||||
Read a => Read (Dual a) | |||||
Show a => Show (Dual a) | |||||
Eq a => Eq (Dual a) | |||||
Ord a => Ord (Dual a) | |||||
Defined in GHC.Internal.Data.Semigroup.Internal | |||||
type Rep1 Dual | |||||
Defined in GHC.Internal.Data.Semigroup.Internal | |||||
type Rep (Dual a) | |||||
Defined in GHC.Internal.Data.Semigroup.Internal |
Instances
Monoid (Endo a) | |||||
Semigroup (Endo a) | |||||
Generic (Endo a) | |||||
Defined in GHC.Internal.Data.Semigroup.Internal Associated Types
| |||||
type Rep (Endo a) | |||||
Defined in GHC.Internal.Data.Semigroup.Internal |
newtype Ap (f :: k -> Type) (a :: k) #
Instances
Generic1 (Ap f :: k -> Type) | |||||
Defined in GHC.Internal.Data.Monoid Associated Types
| |||||
Foldable1 f => Foldable1 (Ap f) | |||||
Defined in Data.Foldable1 Methods fold1 :: Semigroup m => Ap f m -> m # foldMap1 :: Semigroup m => (a -> m) -> Ap f a -> m # foldMap1' :: Semigroup m => (a -> m) -> Ap f a -> m # toNonEmpty :: Ap f a -> NonEmpty a # maximum :: Ord a => Ap f a -> a # minimum :: Ord a => Ap f a -> a # foldrMap1 :: (a -> b) -> (a -> b -> b) -> Ap f a -> b # foldlMap1' :: (a -> b) -> (b -> a -> b) -> Ap f a -> b # foldlMap1 :: (a -> b) -> (b -> a -> b) -> Ap f a -> b # foldrMap1' :: (a -> b) -> (a -> b -> b) -> Ap f a -> b # | |||||
Alternative f => Alternative (Ap f) | |||||
Applicative f => Applicative (Ap f) | |||||
Functor f => Functor (Ap f) | |||||
Monad f => Monad (Ap f) | |||||
MonadPlus f => MonadPlus (Ap f) | |||||
MonadFail f => MonadFail (Ap f) | |||||
Defined in GHC.Internal.Data.Monoid | |||||
Foldable f => Foldable (Ap f) | |||||
Defined in GHC.Internal.Data.Foldable Methods fold :: Monoid m => Ap f m -> m # foldMap :: Monoid m => (a -> m) -> Ap f a -> m # foldMap' :: Monoid m => (a -> m) -> Ap f a -> m # foldr :: (a -> b -> b) -> b -> Ap f a -> b # foldr' :: (a -> b -> b) -> b -> Ap f a -> b # foldl :: (b -> a -> b) -> b -> Ap f a -> b # foldl' :: (b -> a -> b) -> b -> Ap f a -> b # foldr1 :: (a -> a -> a) -> Ap f a -> a # foldl1 :: (a -> a -> a) -> Ap f a -> a # elem :: Eq a => a -> Ap f a -> Bool # maximum :: Ord a => Ap f a -> a # | |||||
Traversable f => Traversable (Ap f) | |||||
(Applicative f, Monoid a) => Monoid (Ap f a) | |||||
(Applicative f, Semigroup a) => Semigroup (Ap f a) | |||||
(Applicative f, Bounded a) => Bounded (Ap f a) | |||||
Enum (f a) => Enum (Ap f a) | |||||
Defined in GHC.Internal.Data.Monoid | |||||
Generic (Ap f a) | |||||
Defined in GHC.Internal.Data.Monoid Associated Types
| |||||
(Applicative f, Num a) => Num (Ap f a) | |||||
Read (f a) => Read (Ap f a) | |||||
Show (f a) => Show (Ap f a) | |||||
Eq (f a) => Eq (Ap f a) | |||||
Ord (f a) => Ord (Ap f a) | |||||
type Rep1 (Ap f :: k -> Type) | |||||
Defined in GHC.Internal.Data.Monoid | |||||
type Rep (Ap f a) | |||||
Defined in GHC.Internal.Data.Monoid |
newtype Alt (f :: k -> Type) (a :: k) #
Instances
Generic1 (Alt f :: k -> Type) | |||||
Defined in GHC.Internal.Data.Semigroup.Internal Associated Types
| |||||
MonadZip f => MonadZip (Alt f) | |||||
Foldable1 f => Foldable1 (Alt f) | |||||
Defined in Data.Foldable1 Methods fold1 :: Semigroup m => Alt f m -> m # foldMap1 :: Semigroup m => (a -> m) -> Alt f a -> m # foldMap1' :: Semigroup m => (a -> m) -> Alt f a -> m # toNonEmpty :: Alt f a -> NonEmpty a # maximum :: Ord a => Alt f a -> a # minimum :: Ord a => Alt f a -> a # foldrMap1 :: (a -> b) -> (a -> b -> b) -> Alt f a -> b # foldlMap1' :: (a -> b) -> (b -> a -> b) -> Alt f a -> b # foldlMap1 :: (a -> b) -> (b -> a -> b) -> Alt f a -> b # foldrMap1' :: (a -> b) -> (a -> b -> b) -> Alt f a -> b # | |||||
Contravariant f => Contravariant (Alt f) | |||||
Alternative f => Alternative (Alt f) | |||||
Applicative f => Applicative (Alt f) | |||||
Functor f => Functor (Alt f) | |||||
Monad f => Monad (Alt f) | |||||
MonadPlus f => MonadPlus (Alt f) | |||||
Foldable f => Foldable (Alt f) | |||||
Defined in GHC.Internal.Data.Foldable Methods fold :: Monoid m => Alt f m -> m # foldMap :: Monoid m => (a -> m) -> Alt f a -> m # foldMap' :: Monoid m => (a -> m) -> Alt f a -> m # foldr :: (a -> b -> b) -> b -> Alt f a -> b # foldr' :: (a -> b -> b) -> b -> Alt f a -> b # foldl :: (b -> a -> b) -> b -> Alt f a -> b # foldl' :: (b -> a -> b) -> b -> Alt f a -> b # foldr1 :: (a -> a -> a) -> Alt f a -> a # foldl1 :: (a -> a -> a) -> Alt f a -> a # elem :: Eq a => a -> Alt f a -> Bool # maximum :: Ord a => Alt f a -> a # minimum :: Ord a => Alt f a -> a # | |||||
Traversable f => Traversable (Alt f) | |||||
Alternative f => Monoid (Alt f a) | |||||
Alternative f => Semigroup (Alt f a) | |||||
Enum (f a) => Enum (Alt f a) | |||||
Generic (Alt f a) | |||||
Defined in GHC.Internal.Data.Semigroup.Internal Associated Types
| |||||
Num (f a) => Num (Alt f a) | |||||
Read (f a) => Read (Alt f a) | |||||
Show (f a) => Show (Alt f a) | |||||
Eq (f a) => Eq (Alt f a) | |||||
Ord (f a) => Ord (Alt f a) | |||||
Defined in GHC.Internal.Data.Semigroup.Internal | |||||
type Rep1 (Alt f :: k -> Type) | |||||
Defined in GHC.Internal.Data.Semigroup.Internal | |||||
type Rep (Alt f a) | |||||
Defined in GHC.Internal.Data.Semigroup.Internal |