Hoogle Search
Within LTS Haskell 24.6 (ghc-9.10.2)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
foldlWithKey :: (a -> k -> 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).
foldlWithKey' :: (a -> k -> 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). Each application of the operator is evaluated before using the result in the next application. This function is strict in the starting value.
foldl' :: (a -> v -> a) -> a -> HashMap k v -> aunordered-containers Data.HashMap.Strict Reduce this map by applying a binary operator to all elements, using the given starting value (typically the left-identity of the operator). Each application of the operator is evaluated before using the result in the next application. This function is strict in the starting value.
foldlWithKey :: (a -> k -> v -> a) -> a -> HashMap k v -> aunordered-containers Data.HashMap.Strict Reduce this map by applying a binary operator to all elements, using the given starting value (typically the left-identity of the operator).
foldlWithKey' :: (a -> k -> v -> a) -> a -> HashMap k v -> aunordered-containers Data.HashMap.Strict Reduce this map by applying a binary operator to all elements, using the given starting value (typically the left-identity of the operator). Each application of the operator is evaluated before using the result in the next application. This function is strict in the starting value.
foldl' :: (a -> b -> a) -> a -> HashSet b -> aunordered-containers Data.HashSet Reduce this set by applying a binary operator to all elements, using the given starting value (typically the left-identity of the operator). Each application of the operator is evaluated before before using the result in the next application. This function is strict in the starting value.
foldl' :: (a -> b -> a) -> a -> HashSet b -> aunordered-containers Data.HashSet.Internal Reduce this set by applying a binary operator to all elements, using the given starting value (typically the left-identity of the operator). Each application of the operator is evaluated before before using the result in the next application. This function is strict in the starting value.
foldlArray :: (IArray a e, Ix i) => (b -> e -> b) -> b -> a i e -> barray Data.Array.Base Lazy left-associative fold.
foldlArray' :: (IArray a e, Ix i) => (b -> e -> b) -> b -> a i e -> barray Data.Array.Base Strict accumulating left-associative fold.
foldlArrayM' :: (IArray a e, Ix i, Monad m) => (b -> e -> m b) -> b -> a i e -> m barray Data.Array.Base Strict accumulating left-associative monadic fold.