Safe Haskell	Safe-Inferred
Language	GHC2021

Fold.Pure.Utilities

Synopsis

duplicate :: Fold a b -> Fold a (Fold a b)
premap :: (a -> b) -> Fold b r -> Fold a r
prefilter :: (a -> Bool) -> Fold a r -> Fold a r
predropWhile :: (a -> Bool) -> Fold a r -> Fold a r
drop :: Natural -> Fold a b -> Fold a b
nest :: Applicative f => Fold a b -> Fold (f a) (f b)
repeatedly :: forall x xs result. (forall b. Fold x b -> xs -> b) -> Fold x result -> Fold xs result

Documentation

Allows to continue feeding a fold even after passing it to a function that closes it

premap :: (a -> b) -> Fold b r -> Fold a r Source #

Applies a function to each input before processing

prefilter :: (a -> Bool) -> Fold a r -> Fold a r Source #

Consider only inputs that match a predicate

Ignores inputs until they stop satisfying a predicate

Ignores the first n inputs

nest :: Applicative f => Fold a b -> Fold (f a) (f b) Source #

Nest a fold in an applicative

Arguments

:: forall x xs result. (forall b. Fold x b -> xs -> b)	A witness to the fact that `xs` is a list of `x`
-> Fold x result
-> Fold xs result

Convert a fold for a single item (x) into a fold for lists of items (xs)