Safe Haskell | None |
---|---|
Language | Haskell2010 |
- foldMap :: (Monoid m, Foldable t) => (a -> m) -> t a -> m
- convert :: (Unit f, Monoid (f a), Foldable t) => t a -> f a
- concat :: (Monoid m, Foldable t) => t m -> m
- sum :: (Monoid m, Foldable t) => t m -> m
- product :: (Ring m, Foldable t) => t m -> m
- nzsum :: Semigroup m => [m] -> m
- size :: (Foldable f, Ring n) => f a -> n
- length :: [a] -> Int
- maximum :: (Bounded a, Ord a, Foldable t) => t a -> a
- maximumBy :: (Ord a, Foldable t) => (b -> a) -> b -> t b -> b
- minimum :: (Bounded a, Ord a, Foldable t) => t a -> a
- minimumBy :: (Ord a, Foldable t) => (b -> a) -> b -> t b -> b
- sequence_ :: (Applicative f, Foldable t) => t (f a) -> f ()
- traverse_ :: (Applicative f, Foldable t) => (a -> f b) -> t a -> f ()
- for_ :: (Applicative f, Foldable t) => t a -> (a -> f b) -> f ()
- split :: (Foldable t, Monoid b, Monoid c) => t (b :+: c) -> (b, c)
- partitionEithers :: (Foldable t, Unit t, Monoid (t a), Monoid (t b)) => t (a :+: b) -> (t a, t b)
- partition :: (Unit f, Monoid (f a), Foldable t) => (a -> Bool) -> t a -> (f a, f a)
- select :: (Unit f, Monoid (f a), Foldable t) => (a -> Bool) -> t a -> f a
- refuse :: (Unit f, Monoid (f a), Foldable t) => (a -> Bool) -> t a -> f a
- compose :: (Category k, Foldable t) => t (k a a) -> k a a
- composing :: (Category k, Foldable t) => (a -> k b b) -> t a -> k b b
- iter :: (Contravariant (k a), Category k, Foldable t) => k a (t (k a a) -> a)
- foldr :: Foldable t => (b -> a -> a) -> a -> t b -> a
- foldr1 :: (a -> a -> a) -> [a] -> a
- foldl' :: Foldable t => (a -> b -> a) -> a -> t b -> a
- foldl1' :: (a -> a -> a) -> [a] -> a
- toList :: Foldable t => t a -> [a]
- find :: Foldable t => (a -> Bool) -> t a -> Maybe a
- or :: Foldable t => t Bool -> Bool
- and :: Foldable t => t Bool -> Bool
- all :: Foldable t => (a -> Bool) -> t a -> Bool
- any :: Foldable t => (a -> Bool) -> t a -> Bool
- elem :: (Eq a, Foldable t) => a -> t a -> Bool
- empty :: Foldable f => f a -> Bool
- nonempty :: Foldable f => f a -> Bool
- sizeTo :: Foldable f => Int -> f a -> Int
Documentation
sequence_ :: (Applicative f, Foldable t) => t (f a) -> f () Source
traverse_ :: (Applicative f, Foldable t) => (a -> f b) -> t a -> f () Source
for_ :: (Applicative f, Foldable t) => t a -> (a -> f b) -> f () Source
partitionEithers :: (Foldable t, Unit t, Monoid (t a), Monoid (t b)) => t (a :+: b) -> (t a, t b) Source
iter :: (Contravariant (k a), Category k, Foldable t) => k a (t (k a a) -> a) Source