Data.Fold.Common.L'

Documentation

sum :: Num a => L' a a

Sum of the inputs

product :: Num a => L' a a

Product of the input

count :: Enum e => L' a e

Count the number of elements fed to a fold

msum :: Monoid m => L' m m

mappend all the elements of a sequence together.

minimum :: Ord a => L' a (Maybe a)

Minimum of all inputs. If no inputs are supplied this returns Nothing.

maximum :: Ord a => L' a (Maybe a)

Maximum of all inputs. If no inputs are supplied this returns Nothing.

nub :: Ord a => L' a [a]

De-duplicate all the inputs while preserving order. O(n log(n))

slowNub :: Eq a => L' a [a]

De-duplicate all the inputs while preserving order. O(n^2)

intoSet :: Ord a => L' a (Set a)

Collect all members into a Set.

last :: L' a (Maybe a)

Grab the last element inputted

nth :: (Eq b, Num b) => b -> L' a (Maybe a)

Grab the nth element inputted