Fold.ShortcutNonempty.Examples.Boring

Folds of other types trivially lifted into ShortcutNonempty

Search

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

True if any input is equal to the given value (tenacious)

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

False if any input is equal to the given value (tenacious)

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

The first input that satisfies the predicate, if any (tenacious)

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

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

Arithmetic folds

sum :: Num a => ShortcutNonemptyFold a a

Adds the inputs (ambivalent)

product :: Num a => ShortcutNonemptyFold a a

Multiplies the inputs (ambivalent)

mean :: Fractional a => ShortcutNonemptyFold a a

Numerically stable arithmetic mean of the inputs (ambivalent)

variance :: Fractional a => ShortcutNonemptyFold a a

Numerically stable (population) variance over the inputs (ambivalent)

standardDeviation :: Floating a => ShortcutNonemptyFold a a

Numerically stable (population) standard deviation over the inputs (ambivalent)

Working with indices

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

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

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

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

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

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

Counting inputs

length :: ShortcutNonemptyFold a Natural

The number of inputs (ambivalent)

Boolean folds

and :: ShortcutNonemptyFold Bool Bool

True if all inputs are True (tenacious)

or :: ShortcutNonemptyFold Bool Bool

True if any input is True (tenacious)

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

True if all inputs satisfy the predicate (tenacious)

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

True if any input satisfies the predicate (tenacious)

Min/max

maximum :: Ord a => ShortcutNonemptyFold a a

The greatest input (ambivalent)

minimum :: Ord a => ShortcutNonemptyFold a a

The least input (ambivalent)

maximumBy :: (a -> a -> Ordering) -> ShortcutNonemptyFold a a

The greatest input with respect to the given comparison function (ambivalent)

minimumBy :: (a -> a -> Ordering) -> ShortcutNonemptyFold a a

The least input with respect to the given comparison function (ambivalent)

First/last

last :: ShortcutNonemptyFold a a

The last input (ambivalent)

General folds

magma :: (a -> a -> a) -> ShortcutNonemptyFold a a

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

semigroup :: Semigroup a => ShortcutNonemptyFold a a

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

monoid :: Monoid a => ShortcutNonemptyFold a a

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

List folds

list :: ShortcutNonemptyFold a [a]

All the inputs (ambivalent)

reverseList :: ShortcutNonemptyFold a [a]

All the inputs in reverse order (ambivalent)