monoids-0.1.25: Monoids, specialized containers and a general map/reduce frameworkSource codeContentsIndex
Data.Monoid.Union
Contents
Unions of Containers
Unions of Containers of Monoids
Synopsis
module Data.Monoid.Reducer
class HasUnion f where
empty :: f
union :: f -> f -> f
newtype Union f = Union {
getUnion :: f
}
class HasUnionWith f where
unionWith :: (a -> a -> a) -> f a -> f a -> f a
emptyWith :: f a
newtype UnionWith f m = UnionWith {
getUnionWith :: f m
}
Documentation
module Data.Monoid.Reducer
Unions of Containers
class HasUnion f whereSource
A Container suitable for the Union Monoid
Methods
empty :: fSource
union :: f -> f -> fSource
show/hide Instances
newtype Union f Source
The Monoid (union,empty)
Constructors
Union
getUnion :: f
show/hide Instances
Unions of Containers of Monoids
class HasUnionWith f whereSource
Polymorphic containers that we can supply an operation to handle unions with
Methods
unionWith :: (a -> a -> a) -> f a -> f a -> f aSource
emptyWith :: f aSource
show/hide Instances
newtype UnionWith f m Source
The Monoid ('unionWith mappend',empty) for containers full of monoids.
Constructors
UnionWith
getUnionWith :: f m
show/hide Instances
Monad f => Monad (UnionWith f)
Functor f => Functor (UnionWith f)
Pointed f => Pointed (UnionWith f)
(HasUnionWith f, Monoid m) => Reducer (f m) (UnionWith f m)
Eq (f m) => Eq (UnionWith f m)
Ord (f m) => Ord (UnionWith f m)
Read (f m) => Read (UnionWith f m)
Show (f m) => Show (UnionWith f m)
(HasUnionWith f, Monoid m) => Monoid (UnionWith f m)
Produced by Haddock version 2.4.2