# Hoogle Search

Within LTS Haskell 12.18 (ghc-8.4.4)

foldl' :: Foldable t => (b -> a -> b) -> b -> t a -> b

base Data.List Left-associative fold of a structure but with strict application of the operator. This ensures that each step of the fold is forced to weak head normal form before being applied, avoiding the collection of thunks that would otherwise occur. This is often what you want to strictly reduce a finite list to a single, monolithic result (e.g. length). For a general Foldable structure this should be semantically identical to,

foldl f z = foldl' f z . toList

foldl' :: FoldableLL full item => (a -> item -> a) -> a -> full -> a

ListLike Data.ListLike Strict version of foldl.

foldl' :: FoldableLL full item => (a -> item -> a) -> a -> full -> a

ListLike Data.ListLike.FoldableLL Strict version of foldl.

foldl' :: Foldable t => b -> a -> b -> b -> t a -> b

listsafe Data.List.Safe Left-associative fold of a structure but with strict application of the operator. This ensures that each step of the fold is forced to weak head normal form before being applied, avoiding the collection of thunks that would otherwise occur. This is often what you want to strictly reduce a finite list to a single, monolithic result (e.g. length). For a general Foldable structure this should be semantically identical to,

foldl f z = foldl' f z . toList

foldl' :: (a -> b -> a) -> a -> [b] -> a

prelude-compat Data.List2010 No documentation available.

ifoldl' :: forall a b . (b -> Int -> a -> b) -> b -> [a] -> b

ilist Data.List.Index *Subject to fusion.*

Page 1 of 1