Fold.Pure

Type

data Fold a b

Processes inputs of type a and results in a value of type b

Constructors

forall x. Fold

Fields

• initial :: x
• step :: x -> a -> x
• extract :: x -> b

Instances

Applicative (Fold a)

Defined in Fold.Pure.Type

Methods

pure :: a0 -> Fold a a0

(<*>) :: Fold a (a0 -> b) -> Fold a a0 -> Fold a b

liftA2 :: (a0 -> b -> c) -> Fold a a0 -> Fold a b -> Fold a c

(*>) :: Fold a a0 -> Fold a b -> Fold a b

(<*) :: Fold a a0 -> Fold a b -> Fold a a0

Functor (Fold a)

Defined in Fold.Pure.Type

Methods

fmap :: (a0 -> b) -> Fold a a0 -> Fold a b

(<$) :: a0 -> Fold a b -> Fold a a0

Monoid b => Monoid (Fold a b)

Defined in Fold.Pure.Type

Methods

mempty :: Fold a b

mappend :: Fold a b -> Fold a b -> Fold a b

mconcat :: [Fold a b] -> Fold a b

Semigroup b => Semigroup (Fold a b)

Defined in Fold.Pure.Type

Methods

(<>) :: Fold a b -> Fold a b -> Fold a b

sconcat :: NonEmpty (Fold a b) -> Fold a b

stimes :: Integral b0 => b0 -> Fold a b -> Fold a b

Run

run :: Foldable f => Fold a b -> f a -> b

Fold a listlike container to a single summary result

run monoid ["a", "b", "c"] = "abc"

scan :: Foldable f => Fold a b -> f a -> [b]

Rather than only obtain a single final result, scanning gives a running total that shows the intermediate result at each step along the way

scan monoid ["a", "b", "c"] = ["","a","ab","abc"]

prescan :: Traversable t => Fold a b -> t a -> t b

Scan where the last input is excluded

prescan monoid ["a", "b", "c"] = ["","a","ab"]

postscan :: Traversable t => Fold a b -> t a -> t b

Scan where the first input is excluded

postscan monoid ["a", "b", "c"] = ["a","ab","abc"]

Examples

General

magma :: (a -> a -> a) -> Fold a (Maybe a)

Start with the first input, append each new input on the right with the given function

semigroup :: Semigroup a => Fold a (Maybe a)

Append each new input on the right with (<>)

monoid :: Monoid a => Fold a a

Start with mempty, append each input on the right with (<>)

Endpoints

first :: Fold a (Maybe a)

The first input

last :: Fold a (Maybe a)

The last input

Extrema

maximum :: Ord a => Fold a (Maybe a)

The greatest input

minimum :: Ord a => Fold a (Maybe a)

The least input

maximumBy :: (a -> a -> Ordering) -> Fold a (Maybe a)

The greatest input with respect to the given comparison function

minimumBy :: (a -> a -> Ordering) -> Fold a (Maybe a)

The least input with respect to the given comparison function

Length

null :: Fold a Bool

True if the input contains no inputs

length :: Fold a Natural

The number of inputs

Boolean

and :: Fold Bool Bool

True if all inputs are True

or :: Fold Bool Bool

True if any input is True

all :: (a -> Bool) -> Fold a Bool

True if all inputs satisfy the predicate

any :: (a -> Bool) -> Fold a Bool

True if any input satisfies the predicate

Numeric

sum :: Num a => Fold a a

Adds the inputs

product :: Num a => Fold a a

Multiplies the inputs

mean :: Fractional a => Fold a a

Numerically stable arithmetic mean of the inputs

variance :: Fractional a => Fold a a

Numerically stable (population) variance over the inputs

standardDeviation :: Floating a => Fold a a

Numerically stable (population) standard deviation over the inputs

Search

element :: Eq a => a -> Fold a Bool

True if any input is equal to the given value

notElement :: Eq a => a -> Fold a Bool

False if any input is equal to the given value

find :: (a -> Bool) -> Fold a (Maybe a)

The first input that satisfies the predicate, if any

lookup :: Eq a => a -> Fold (a, b) (Maybe b)

The b from the first tuple where a equals the given value, if any

Index

index :: Natural -> Fold a (Maybe a)

The nth input, where n=0 is the first input, if the index is in bounds

findIndex :: (a -> Bool) -> Fold a (Maybe Natural)

The index of the first input that satisfies the predicate, if any

elementIndex :: Eq a => a -> Fold a (Maybe Natural)

The index of the first input that matches the given value, if any

List

list :: Fold a [a]

All the inputs

reverseList :: Fold a [a]

All the inputs in reverse order

Conversion

effectfulFold :: EffectfulFold Identity a b -> Fold a b

Turn an effectful fold into a pure fold

nonemptyFold :: NonemptyFold a b -> Fold a (Maybe b)

Turn a fold that requires at least one input into a fold that returns Nothing when there are no inputs

shortcutFold :: ShortcutFold a b -> Fold a b

shortcutNonemptyFold :: ShortcutNonemptyFold a b -> Fold a (Maybe b)

Utilities

duplicate :: Fold a b -> Fold a (Fold a b)

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

Applies a function to each input before processing

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

Consider only inputs that match a predicate

predropWhile :: (a -> Bool) -> Fold a r -> Fold a r

Ignores inputs until they stop satisfying a predicate

drop :: Natural -> Fold a b -> Fold a b

Ignores the first n inputs

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

Nest a fold in an applicative