Data.Monoid.Union

Documentation

module Data.Monoid.Reducer

Unions of Containers

class HasUnion f where

A Container suitable for the Union Monoid

Methods

empty :: f

union :: f -> f -> f

Instances

HasUnion IntSet

Eq a => HasUnion [a]

HasUnion (IntMap a)

Ord a => HasUnion (Set a)

Ord k => HasUnion (Map k a)

newtype Union f

The Monoid (union,empty)

Constructors

Union

Fields

getUnion :: f

Instances

Functor Union

HasUnion f => Reducer f (Union f)

Eq f => Eq (Union f)

Ord f => Ord (Union f)

Read f => Read (Union f)

Show f => Show (Union f)

HasUnion f => Monoid (Union f)

Unions of Containers of Monoids

class Functor f => HasUnionWith f where

Polymorphic containers that we can supply an operation to handle unions with

Methods

unionWith :: (a -> a -> a) -> f a -> f a -> f a

emptyWith :: f a

Instances

HasUnionWith IntMap

Ord k => HasUnionWith (Map k)

newtype UnionWith f m

The Monoid ('unionWith mappend',empty) for containers full of monoids.

Constructors

UnionWith

Fields

getUnionWith :: f m

Instances

Monad f => Monad (UnionWith f)

Functor f => Functor (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)