Hoogle Search
Within LTS Haskell 24.2 (ghc-9.10.2)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
foldl :: (a -> b -> a) -> a -> Map k b -> ario RIO.Map Fold the values in the map using the given left-associative binary operator, such that foldl f z == foldl f z . elems. For example,
elems = reverse . foldl (flip (:)) []
let f len a = len + (length a) foldl f 0 (fromList [(5,"a"), (3,"bbb")]) == 4
foldl :: (a -> b -> a) -> a -> Set b -> ario RIO.Set Fold the elements in the set using the given left-associative binary operator, such that foldl f z == foldl f z . toAscList. For example,
toDescList set = foldl (flip (:)) [] set
foldl :: (a -> Char -> a) -> a -> Text -> ario RIO.Text O(n) foldl, applied to a binary operator, a starting value (typically the left-identity of the operator), and a Text, reduces the Text using the binary operator, from left to right.
foldl :: (a -> Char -> a) -> a -> Text -> ario RIO.Text.Lazy O(n) foldl, applied to a binary operator, a starting value (typically the left-identity of the operator), and a Text, reduces the Text using the binary operator, from left to right.
foldl :: Vector v b => (a -> b -> a) -> a -> v b -> ario RIO.Vector No documentation available.
foldl :: (a -> b -> a) -> a -> Vector b -> ario RIO.Vector.Boxed No documentation available.
foldl :: Storable b => (a -> b -> a) -> a -> Vector b -> ario RIO.Vector.Storable No documentation available.
foldl :: Unbox b => (a -> b -> a) -> a -> Vector b -> ario RIO.Vector.Unboxed No documentation available.
foldl :: Storable a => (b -> a -> b) -> b -> Vector a -> bstorablevector Data.StorableVector foldl, applied to a binary operator, a starting value (typically the left-identity of the operator), and a Vector, reduces the Vector using the binary operator, from left to right.
foldl :: Storable b => (a -> b -> a) -> a -> Vector b -> astorablevector Data.StorableVector.Lazy No documentation available.