Safe Haskell | Safe-Inferred |
---|---|
Language | GHC2021 |
Folds of other types trivially lifted into EffectfulFold
Synopsis
- monoid :: Monoid a => Monad m => EffectfulFold m a a
- null :: Monad m => EffectfulFold m a Bool
- length :: Monad m => EffectfulFold m a Natural
- and :: Monad m => EffectfulFold m Bool Bool
- or :: Monad m => EffectfulFold m Bool Bool
- all :: Monad m => (a -> Bool) -> EffectfulFold m a Bool
- any :: Monad m => (a -> Bool) -> EffectfulFold m a Bool
- sum :: Num a => Monad m => EffectfulFold m a a
- product :: Num a => Monad m => EffectfulFold m a a
- mean :: Fractional a => Monad m => EffectfulFold m a a
- variance :: Fractional a => Monad m => EffectfulFold m a a
- standardDeviation :: Floating a => Monad m => EffectfulFold m a a
- element :: Eq a => Monad m => a -> EffectfulFold m a Bool
- notElement :: Eq a => Monad m => a -> EffectfulFold m a Bool
- find :: Monad m => (a -> Bool) -> EffectfulFold m a (Maybe a)
- lookup :: Eq a => Monad m => a -> EffectfulFold m (a, b) (Maybe b)
- index :: Monad m => Natural -> EffectfulFold m a (Maybe a)
- findIndex :: Monad m => (a -> Bool) -> EffectfulFold m a (Maybe Natural)
- elementIndex :: Eq a => Monad m => a -> EffectfulFold m a (Maybe Natural)
- list :: Monad m => EffectfulFold m a [a]
- reverseList :: Monad m => EffectfulFold m a [a]
- magma :: (a -> a -> a) -> Monad m => EffectfulFold m a (Maybe a)
- semigroup :: Semigroup a => Monad m => EffectfulFold m a (Maybe a)
- first :: Monad m => EffectfulFold m a (Maybe a)
- last :: Monad m => EffectfulFold m a (Maybe a)
- maximum :: Ord a => Monad m => EffectfulFold m a (Maybe a)
- minimum :: Ord a => Monad m => EffectfulFold m a (Maybe a)
- maximumBy :: (a -> a -> Ordering) -> Monad m => EffectfulFold m a (Maybe a)
- minimumBy :: (a -> a -> Ordering) -> Monad m => EffectfulFold m a (Maybe a)
Monoid
monoid :: Monoid a => Monad m => EffectfulFold m a a Source #
Start with mempty
, append each input on the right with (<>
)
Length
Boolean
all :: Monad m => (a -> Bool) -> EffectfulFold m a Bool Source #
True
if all inputs satisfy the predicate
any :: Monad m => (a -> Bool) -> EffectfulFold m a Bool Source #
True
if any input satisfies the predicate
Numeric
mean :: Fractional a => Monad m => EffectfulFold m a a Source #
Numerically stable arithmetic mean of the inputs
variance :: Fractional a => Monad m => EffectfulFold m a a Source #
Numerically stable (population) variance over the inputs
standardDeviation :: Floating a => Monad m => EffectfulFold m a a Source #
Numerically stable (population) standard deviation over the inputs
Search
element :: Eq a => Monad m => a -> EffectfulFold m a Bool Source #
True
if any input is equal to the given value
notElement :: Eq a => Monad m => a -> EffectfulFold m a Bool Source #
False
if any input is equal to the given value
find :: Monad m => (a -> Bool) -> EffectfulFold m a (Maybe a) Source #
The first input that satisfies the predicate, if any
lookup :: Eq a => Monad m => a -> EffectfulFold m (a, b) (Maybe b) Source #
The b
from the first tuple where a
equals the given value, if any
Index
index :: Monad m => Natural -> EffectfulFold m a (Maybe a) Source #
The nth input, where n=0 is the first input, if the index is in bounds
findIndex :: Monad m => (a -> Bool) -> EffectfulFold m a (Maybe Natural) Source #
The index of the first input that satisfies the predicate, if any
elementIndex :: Eq a => Monad m => a -> EffectfulFold m a (Maybe Natural) Source #
The index of the first input that matches the given value, if any
List
list :: Monad m => EffectfulFold m a [a] Source #
All the inputs
reverseList :: Monad m => EffectfulFold m a [a] Source #
All the inputs in reverse order
General
magma :: (a -> a -> a) -> Monad m => EffectfulFold m a (Maybe a) Source #
Start with the first input, append each new input on the right with the given function
semigroup :: Semigroup a => Monad m => EffectfulFold m a (Maybe a) Source #
Append each new input on the right with (<>
)