foldl' -package:base package:vector

foldl' :: (a -> b -> a) -> a -> Vector b -> a
vector Data.Vector
O(n) Left fold with strict accumulator.
foldl' :: (a -> b -> a) -> a -> Bundle v b -> a
vector Data.Vector.Fusion.Bundle
Left fold with strict accumulator
foldl' :: Monad m => (a -> b -> a) -> a -> Bundle m v b -> m a
vector Data.Vector.Fusion.Bundle.Monadic
Left fold with a strict accumulator
foldl' :: Vector v b => (a -> b -> a) -> a -> v b -> a
vector Data.Vector.Generic
O(n) Left fold with strict accumulator.
foldl' :: (PrimMonad m, MVector v a) => (b -> a -> b) -> b -> v (PrimState m) a -> m b
vector Data.Vector.Generic.Mutable
O(n) Pure left fold with strict accumulator.
foldl' :: PrimMonad m => (b -> a -> b) -> b -> MVector (PrimState m) a -> m b
vector Data.Vector.Mutable
O(n) Pure left fold with strict accumulator.
foldl' :: Prim b => (a -> b -> a) -> a -> Vector b -> a
vector Data.Vector.Primitive
O(n) Left fold with strict accumulator.
foldl' :: (PrimMonad m, Prim a) => (b -> a -> b) -> b -> MVector (PrimState m) a -> m b
vector Data.Vector.Primitive.Mutable
O(n) Pure left fold with strict accumulator.
foldl' :: Storable b => (a -> b -> a) -> a -> Vector b -> a
vector Data.Vector.Storable
O(n) Left fold with strict accumulator.
foldl' :: (PrimMonad m, Storable a) => (b -> a -> b) -> b -> MVector (PrimState m) a -> m b
vector Data.Vector.Storable.Mutable
O(n) Pure left fold with strict accumulator.
foldl' :: Unbox b => (a -> b -> a) -> a -> Vector b -> a
vector Data.Vector.Unboxed
O(n) Left fold with strict accumulator.
foldl' :: (PrimMonad m, Unbox a) => (b -> a -> b) -> b -> MVector (PrimState m) a -> m b
vector Data.Vector.Unboxed.Mutable
O(n) Pure left fold with strict accumulator.
ifoldl' :: (a -> Int -> b -> a) -> a -> Vector b -> a
vector Data.Vector
O(n) Left fold with strict accumulator using a function applied to each element and its index.
ifoldl' :: Vector v b => (a -> Int -> b -> a) -> a -> v b -> a
vector Data.Vector.Generic
O(n) Left fold with strict accumulator using a function applied to each element and its index.
ifoldl' :: (PrimMonad m, MVector v a) => (b -> Int -> a -> b) -> b -> v (PrimState m) a -> m b
vector Data.Vector.Generic.Mutable
O(n) Pure left fold with strict accumulator using a function applied to each element and its index.
ifoldl' :: PrimMonad m => (b -> Int -> a -> b) -> b -> MVector (PrimState m) a -> m b
vector Data.Vector.Mutable
O(n) Pure left fold with strict accumulator using a function applied to each element and its index.
ifoldl' :: Prim b => (a -> Int -> b -> a) -> a -> Vector b -> a
vector Data.Vector.Primitive
O(n) Left fold with strict accumulator using a function applied to each element and its index.
ifoldl' :: (PrimMonad m, Prim a) => (b -> Int -> a -> b) -> b -> MVector (PrimState m) a -> m b
vector Data.Vector.Primitive.Mutable
O(n) Pure left fold with strict accumulator using a function applied to each element and its index.
ifoldl' :: Storable b => (a -> Int -> b -> a) -> a -> Vector b -> a
vector Data.Vector.Storable
O(n) Left fold with strict accumulator using a function applied to each element and its index.
ifoldl' :: (PrimMonad m, Storable a) => (b -> Int -> a -> b) -> b -> MVector (PrimState m) a -> m b
vector Data.Vector.Storable.Mutable
O(n) Pure left fold with strict accumulator using a function applied to each element and its index.
ifoldl' :: Unbox b => (a -> Int -> b -> a) -> a -> Vector b -> a
vector Data.Vector.Unboxed
O(n) Left fold with strict accumulator using a function applied to each element and its index.
ifoldl' :: (PrimMonad m, Unbox a) => (b -> Int -> a -> b) -> b -> MVector (PrimState m) a -> m b
vector Data.Vector.Unboxed.Mutable
O(n) Pure left fold with strict accumulator using a function applied to each element and its index.