rope-0.3: Tools for manipulating fingertrees of bytestrings with optional annotationsSource codeContentsIndex
Data.Rope.Util.Reducer
Contents
Folding with Reducers
Applicative reduction
Synopsis
class Monoid m => Reducer c m where
unit :: c -> m
snoc :: m -> c -> m
cons :: c -> m -> m
foldMapReduce :: (Foldable f, Reducer e m) => (a -> e) -> f a -> m
foldReduce :: (Foldable f, Reducer e m) => f e -> m
pureUnit :: (Applicative f, Reducer c n) => c -> f n
returnUnit :: (Monad m, Reducer c n) => c -> m n
Documentation
class Monoid m => Reducer c m whereSource

This type may be best read infix. A c Reducer m is a Monoid m that maps values of type c through unit to values of type m. A c-Reducer may also supply operations which tack-on another c to an existing Monoid m on the left or right. These specialized reductions may be more efficient in some scenarios and are used when appropriate by a Generator. The names cons and snoc work by analogy to the synonymous operations in the list monoid.

This class deliberately avoids functional-dependencies, so that () can be a c-Reducer for all c, and so many common reducers can work over multiple types, for instance, First and Last may reduce both a and Maybe a. Since a Generator has a fixed element type, the input to the reducer is generally known and extracting from the monoid usually is sufficient to fix the result type. Combinators are available for most scenarios where this is not the case, and the few remaining cases can be handled by using an explicit type annotation.

Minimal definition: unit or snoc

Methods
unit :: c -> mSource
Convert a value into a Monoid
snoc :: m -> c -> mSource
Append a value to a Monoid for use in left-to-right reduction
cons :: c -> m -> mSource
Prepend a value onto a Monoid for use during right-to-left reduction
show/hide Instances
Reducer Bool All
Reducer Bool All
Reducer Bool Any
Reducer Bool Any
Reducer Char Rope
Reducer Char Rope
Reducer Word8 Rope
Reducer Word8 Rope
Reducer String Rope
Reducer String Rope
Reducer c ()
Reducer ByteString ByteString
Reducer ByteString ByteString
Reducer ByteString ByteString
Reducer ByteString Body
Reducer ByteString Body
Reducer ByteString Rope
Reducer ByteString Rope
Reducer ByteString Rope
Reducer ByteString Rope
Reducer Chunk Rope
Reducer Chunk Rope
Reducer Rope Rope
Reducer a (Last a)
Reducer a (First a)
Num a => Reducer a (Product a)
Num a => Reducer a (Sum a)
Monoid a => Reducer a (Dual a)
Reducer c ([] c)
Measured v a => Reducer a (FingerTree v a)
(Reducer c m, Reducer c n) => Reducer c ((,) m n)
(Reducer c m, Reducer c n, Reducer c o) => Reducer c ((,,) m n o)
(Reducer c m, Reducer c n, Reducer c o, Reducer c p) => Reducer c ((,,,) m n o p)
Reducer ([] Word8) Rope
Reducer ([] Word8) Rope
Reducer (Maybe a) (Last a)
Reducer (Maybe a) (Last a)
Reducer (Maybe a) (First a)
Reducer (Maybe a) (First a)
Reducer (a -> a) (Endo a)
Reducer (a -> a) (Endo a)
Folding with Reducers
foldMapReduce :: (Foldable f, Reducer e m) => (a -> e) -> f a -> mSource
Apply a Reducer to a Foldable container, after mapping the contents into a suitable form for reduction.
foldReduce :: (Foldable f, Reducer e m) => f e -> mSource
Apply a Reducer to a Foldable mapping each element through unit
Applicative reduction
pureUnit :: (Applicative f, Reducer c n) => c -> f nSource
returnUnit :: (Monad m, Reducer c n) => c -> m nSource
Produced by Haddock version 2.4.2