folds-0.3: Beautiful Folding

Safe HaskellSafe-Inferred

Data.Fold.Internal

Synopsis

Documentation

data SnocList a Source

Reversed '[]'

Constructors

Snoc (SnocList a) a 
Nil 

data Maybe' a Source

Strict Maybe

Constructors

Nothing' 
Just' !a 

Instances

Typeable1 Maybe' 
Foldable Maybe' 
Eq a => Eq (Maybe' a) 
Data a => Data (Maybe' a) 
Ord a => Ord (Maybe' a) 
Read a => Read (Maybe' a) 
Show a => Show (Maybe' a) 

maybe' :: b -> (a -> b) -> Maybe' a -> bSource

data Pair' a b Source

Strict Pair

Constructors

Pair' !a !b 

Instances

Typeable2 Pair' 
(Eq a, Eq b) => Eq (Pair' a b) 
(Data a, Data b) => Data (Pair' a b) 
(Ord a, Ord b) => Ord (Pair' a b) 
(Read a, Read b) => Read (Pair' a b) 
(Show a, Show b) => Show (Pair' a b) 
(Monoid a, Monoid b) => Monoid (Pair' a b) 

newtype N a s Source

A reified Monoid.

Constructors

N 

Fields

runN :: a
 

Instances

Typeable2 N 
Eq a => Eq (N a s) 
(Data a, Data s) => Data (N a s) 
Ord a => Ord (N a s) 
Read a => Read (N a s) 
Show a => Show (N a s) 
Reifies * s (a -> a -> a, a) => Monoid (N a s) 

data Tree a Source

The shape of a foldMap

Constructors

Zero 
One a 
Two (Tree a) (Tree a) 

Instances

Functor Tree 
Typeable1 Tree 
Foldable Tree 
Traversable Tree 
Eq a => Eq (Tree a) 
Data a => Data (Tree a) 
Ord a => Ord (Tree a) 
Read a => Read (Tree a) 
Show a => Show (Tree a)