monoids-0.1.2: Lots of Monoids Source code Contents Index

Data.Monoid.Applicative

Documentation

module Control.Applicative

module Data.Monoid.Reducer

newtype Traversal f Source

Constructors Traversal getTraversal :: f () Instances Applicative f => Monoid (Traversal f) Applicative f => Reducer (f a) (Traversal f)

newtype Alternate f a Source

Constructors Alternate getAlternate :: f a Instances Functor f => Functor (Alternate f) Applicative f => Applicative (Alternate f) Alternative f => Alternative (Alternate f) Pointed f => Pointed (Alternate f) Alternative f => Reducer (f a) (Alternate f a) Eq (f a) => Eq (Alternate f a) Ord (f a) => Ord (Alternate f a) Read (f a) => Read (Alternate f a) Show (f a) => Show (Alternate f a) Alternative f => Monoid (Alternate f a)

newtype TraversalWith f n Source

Constructors TraversalWith getTraversalWith :: f n Instances Functor f => Functor (TraversalWith f) Pointed f => Pointed (TraversalWith f) (Applicative f, Monoid n) => Reducer (f n) (TraversalWith f n) (Applicative f, Monoid n) => Monoid (TraversalWith f n)

Produced by Haddock version 2.4.2