Data.Zip.FoldL

Zipping of non-strict left folds.

See http://conal.net/blog/tag/zip. Inspired by Beautiful FoldLs by Max Rabkin http://squing.blogspot.com/2008/11/beautiful-folding.html

Documentation

data FoldL b a

Data representation of a left fold

Constructors

F (a -> b -> a) a

Instances

Zip (FoldL b)

Zip' (FoldL b)

cfoldl :: FoldL b a -> [b] -> a

Interpretation of a FoldL as non-strict

cfoldl' :: FoldL b a -> [b] -> a

Interpretation of a FoldL as non-strict

unitL :: FoldL b ()

data WithCont z c

Add a continuation.

Instances

Functor (WithCont z)

Zip z => Applicative (WithCont z)

Zip z => Zip (WithCont z)

Zip z => Monoidal (WithCont z)

type FoldLC b = WithCont (FoldL b)

Non-strict left fold with continuation.

cfoldlc :: FoldLC b a -> [b] -> a

Interpretation of a FoldLC

data WithCont' z c

Like WithCont but with pair-strict '(*)'

Instances

Functor (WithCont' z)

Zip' z => Applicative (WithCont' z)

type FoldLC' b = WithCont' (FoldL b)

Strict left fold with continuation.

cfoldlc' :: FoldLC' b a -> [b] -> a

Interpretation of a FoldLC

class Zip' f where

Strict generalized zip

Methods

zip' :: f a -> f b -> f (P a b)

Instances

Zip' []

Zip' IO

Zip' ((->) u)

Monoid u => Zip' ((,) u)

Zip' (FoldL b)

data P c c'

Strict pairs

Constructors

P !c !c'