Hoogle Search
Within LTS Haskell 24.3 (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 -> acontainers Data.Map.Lazy 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 -> Map k b -> acontainers Data.Map.Strict 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 -> Map k b -> acontainers Data.Map.Strict.Internal 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 -> acontainers Data.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 -> b -> a) -> a -> Set b -> acontainers Data.Set.Internal 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 :: (b -> a -> b) -> b -> KeyMap a -> baeson Data.Aeson.KeyMap No documentation available.
foldl :: (a -> v -> a) -> a -> HashMap k v -> aunordered-containers Data.HashMap.Internal Reduce this map by applying a binary operator to all elements, using the given starting value (typically the left-identity of the operator).
foldl :: (b -> a -> b) -> b -> Array a -> bunordered-containers Data.HashMap.Internal.Array No documentation available.
foldl :: (a -> v -> a) -> a -> HashMap k v -> aunordered-containers Data.HashMap.Internal.Strict Reduce this map by applying a binary operator to all elements, using the given starting value (typically the left-identity of the operator).
foldl :: (a -> v -> a) -> a -> HashMap k v -> aunordered-containers Data.HashMap.Lazy Reduce this map by applying a binary operator to all elements, using the given starting value (typically the left-identity of the operator).