foldM package:vector

O(n) Map each element of the structure to a monoid and combine the results. It uses the same implementation as the corresponding method of the Foldable type class. Note that it's implemented in terms of foldr and won't fuse with functions that traverse the vector from left to right (map, generate, etc.).

foldMap' :: Monoid m => (a -> m) -> Vector a -> m

vector Data.Vector

O(n) Like foldMap, but strict in the accumulator. It uses the same implementation as the corresponding method of the Foldable type class. Note that it's implemented in terms of foldl', so it fuses in most contexts.

foldM' :: forall m a b (v :: Type -> Type) . Monad m => (a -> b -> m a) -> a -> Bundle v b -> m a

vector Data.Vector.Fusion.Bundle

Monadic fold with strict accumulator

foldM' :: forall m a b (v :: Type -> Type) . Monad m => (a -> b -> m a) -> a -> Bundle m v b -> m a

vector Data.Vector.Fusion.Bundle.Monadic

Same as foldlM'

foldM' :: Monad m => (a -> b -> m a) -> a -> Stream m b -> m a

vector Data.Vector.Fusion.Stream.Monadic

foldM' :: (Monad m, Vector v b) => (a -> b -> m a) -> a -> v b -> m a

vector Data.Vector.Generic

O(n) Monadic fold with strict accumulator.

foldM'_ :: (Monad m, Vector v b) => (a -> b -> m a) -> a -> v b -> m ()

vector Data.Vector.Generic

O(n) Monadic fold with strict accumulator that discards the result.

foldM_ :: (Monad m, Vector v b) => (a -> b -> m a) -> a -> v b -> m ()

vector Data.Vector.Generic

O(n) Monadic fold that discards the result.

foldMap :: (Monoid m, Vector v a) => (a -> m) -> v a -> m

vector Data.Vector.Generic

O(n) Map each element of the structure to a monoid and combine the results. It uses the same implementation as the corresponding method of the Foldable type cless. Note that it's implemented in terms of foldr and won't fuse with functions that traverse the vector from left to right (map, generate, etc.).