Data.Fold.Internal

Documentation

data SnocList a

Reversed '[]'

Constructors

Snoc (SnocList a) a

Nil

Instances

Functor SnocList

Foldable SnocList

Traversable SnocList

Eq a => Eq (SnocList a)

Data a => Data (SnocList a)

Ord a => Ord (SnocList a)

Read a => Read (SnocList a)

Show a => Show (SnocList a)

data SnocList1 a

Constructors

Snoc1 (SnocList1 a) a

First a

Instances

Functor SnocList1

Foldable SnocList1

Traversable SnocList1

Eq a => Eq (SnocList1 a)

Data a => Data (SnocList1 a)

Ord a => Ord (SnocList1 a)

Read a => Read (SnocList1 a)

Show a => Show (SnocList1 a)

data List1 a

Constructors

Cons1 a (List1 a)

Last a

Instances

Functor List1

Foldable List1

Traversable List1

data Maybe' a

Strict Maybe

Constructors

Nothing'

Just' !a

Instances

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 -> b

data Pair' a b

Strict Pair

Constructors

Pair' !a !b

Instances

(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

A reified Monoid.

Constructors

N

Fields

runN :: a

Instances

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)

newtype S a s

A reified Semigroup.

Constructors

S

Fields

runS :: a

Instances

Eq a => Eq (S a s)

(Data a, Data s) => Data (S a s)

Ord a => Ord (S a s)

Read a => Read (S a s)

Show a => Show (S a s)

Reifies * s (a -> a -> a) => Semigroup (S a s)

data Tree a

The shape of a foldMap

Constructors

Zero

One a

Two (Tree a) (Tree a)

Instances

Functor 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)

MuRef (Tree a)

type DeRef (Tree a)

data Tree1 a

Constructors

Bin1 (Tree1 a) (Tree1 a)

Tip1 a

Instances

Functor Tree1

Foldable Tree1

Traversable Tree1

MuRef (Tree1 a)

type DeRef (Tree1 a)

newtype An a

Constructors

An a

Instances

Functor An

Foldable An

Traversable An

Eq a => Eq (An a)

Data a => Data (An a)

Ord a => Ord (An a)

Read a => Read (An a)

Show a => Show (An a)

data Box a

Constructors

Box a

Instances

Functor Box

Foldable Box

Traversable Box

Eq a => Eq (Box a)

Data a => Data (Box a)

Ord a => Ord (Box a)

Read a => Read (Box a)

Show a => Show (Box a)

newtype FreeMonoid a

Constructors

FreeMonoid

Fields

runFreeMonoid :: forall m. Monoid m => (a -> m) -> m

Instances

Functor FreeMonoid

Foldable FreeMonoid

Cosieve M FreeMonoid

MonadReader (FreeMonoid a) (M a)

foldDeRef :: forall f a. (MuRef1 f, Bifoldable (DeRef1 f)) => f a -> FreeMonoid a

newtype FreeSemigroup a

Constructors

FreeSemigroup

Fields

runFreeSemigroup :: forall m. Semigroup m => (a -> m) -> m

Instances

Functor FreeSemigroup

Foldable FreeSemigroup

Foldable1 FreeSemigroup

Cosieve M1 FreeSemigroup

MonadReader (FreeSemigroup a) (M1 a)

foldDeRef1 :: forall f a. (MuRef1 f, Bifoldable1 (DeRef1 f)) => f a -> FreeSemigroup a