Clean-0.6: A light, clean and powerful utility library

Safe HaskellNone

Clean.Foldable

Documentation

foldMap :: (Monoid m, Foldable t) => (a -> m) -> t a -> mSource

concat :: (Monoid m, Foldable t) => t m -> mSource

sum :: (Monoid m, Foldable t) => t m -> mSource

split :: (Monoid t1, Monoid t2, Foldable t) => (a -> Either t1 t2) -> t a -> (t1, t2)Source

partition :: (Unit f, Monoid (f a), Foldable t) => (a -> Bool) -> t a -> (f a, f a)Source

filter :: (Unit f, Monoid (f a), Foldable t) => (a -> Bool) -> t a -> f aSource

count :: (Num a1, Monoid a1, Foldable t) => t a -> a1Source

length :: (Num n, Monoid n) => [a] -> nSource

foldl :: Foldable t => (a -> a1 -> a) -> a -> t a1 -> aSource

foldr :: Foldable t => (a1 -> a -> a) -> a -> t a1 -> aSource