Modulereducers-3.12.5Haskell2010

Data.Generator.Combinators

Utilities for working with Monoids that conflict with names from the Prelude, Data.Foldable, Control.Monad or elsewhere. Intended to be imported qualified.

import Data.Generator.Combinators as Generator

Contents

Monadic Reduction
Applicative Reduction
Logical Reduction
Monoidal Reduction
List-Like Reduction

Synopsis

value mapM_
value forM_
value msum
value traverse_
value for_
value asum
value and
value or
value any
value all
value foldMap
value fold
value toList
value concatMap
value elem
value filter
value filterWith
value sum
value product
value notElem

Packagereducers-3.12.5
Exports20
LanguageHaskell2010
LicenceBSD-3-Clause
SourceCombinators.hs

Monadic Reduction

valuemapM_ :: (Generator c, Monad m) => (Elem c -> m b) -> c -> m ()

Source#

Efficiently mapReduce a Generator using the Action monoid. A specialized version of its namesake from Data.Foldable and Control.Monad

   mapReduceWith getAction

valueforM_ :: (Generator c, Monad m) => c -> (Elem c -> m b) -> m ()

Source#

Convenience function as found in Data.Foldable and Control.Monad

    flip mapM_

valuemsum :: (Generator c, MonadPlus m, m a ~ Elem c) => c -> m a

Source#

The sum of a collection of actions, generalizing concat

    reduceWith getMonadSum

Applicative Reduction

valuetraverse_ :: (Generator c, Applicative f) => (Elem c -> f b) -> c -> f ()

Source#

Efficiently mapReduce a Generator using the Traversal monoid. A specialized version of its namesake from Data.Foldable

    mapReduce getTraversal

valuefor_ :: (Generator c, Applicative f) => c -> (Elem c -> f b) -> f ()

Source#

Convenience function as found in Data.Foldable

    flip traverse_

valueasum :: (Generator c, Alternative f, f a ~ Elem c) => c -> f a

Source#

The sum of a collection of actions, generalizing concat

   reduceWith getAlt

Logical Reduction

valueand :: (Generator c, Elem c ~ Bool) => c -> Bool

Source#

Efficiently reduce a Generator that contains values of type Bool

    reduceWith getAll

valueor :: (Generator c, Elem c ~ Bool) => c -> Bool

Source#

Efficiently reduce a Generator that contains values of type Bool

    reduceWith getAny

valueany :: Generator c => (Elem c -> Bool) -> c -> Bool

Source#

Efficiently mapReduce any Generator checking to see if any of its values match the supplied predicate

    mapReduceWith getAny

valueall :: Generator c => (Elem c -> Bool) -> c -> Bool

Source#

Efficiently mapReduce any Generator checking to see if all of its values match the supplied predicate

    mapReduceWith getAll

Monoidal Reduction

valuefoldMap :: (Monoid m, Generator c) => (Elem c -> m) -> c -> m

Source#

Efficiently mapReduce a Generator using the WrappedMonoid monoid. A specialized version of its namesake from Data.Foldable

    mapReduceWith unwrapMonoid

valuefold :: (Monoid m, Generator c, Elem c ~ m) => c -> m

Source#

Efficiently reduce a Generator using the WrappedMonoid monoid. A specialized version of its namesake from Data.Foldable

    reduceWith unwrapMonoid

valuetoList :: Generator c => c -> [Elem c]

Source#

Convert any Generator to a list of its contents. Specialization of reduce

List-Like Reduction

valueconcatMap :: Generator c => (Elem c -> [b]) -> c -> [b]

Source#

Type specialization of "foldMap" above

valueelem :: (Generator c, Eq (Elem c)) => Elem c -> c -> Bool

Source#

Check to see if any member of the Generator matches the supplied value

valuefilter

:: (Generator c, Reducer (Elem c) m, Monoid m)
=> Elem c -> Bool
-> c
-> m

Source#

Efficiently mapReduce a subset of the elements in a Generator

valuefilterWith

:: (Generator c, Reducer (Elem c) m, Monoid m)
=> m -> n
-> Elem c -> Bool
-> c
-> n

Source#

Allows idiomatic specialization of filter by proving a function that will be used to transform the output

valuesum :: (Generator c, Num (Elem c)) => c -> Elem c

Source#

Efficiently sum over the members of any Generator

    reduceWith getSum

valueproduct :: (Generator c, Num (Elem c)) => c -> Elem c

Source#

Efficiently take the product of every member of a Generator

    reduceWith getProduct

valuenotElem :: (Generator c, Eq (Elem c)) => Elem c -> c -> Bool

Source#

Check to make sure that the supplied value is not a member of the Generator