Hoogle Search
Within LTS Haskell 22.24 (ghc-9.6.5)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
foldl' :: Foldable t => (b -> a -> b) -> b -> t a -> bbase 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 structure to a single strict result (e.g. sum). For a general Foldable structure this should be semantically identical to,
foldl' f z = foldl' f z . toList
foldl' :: (a -> b -> a) -> a -> [b] -> aprelude-compat Data.List2010 No documentation available.
foldl' :: FoldableLL full item => (a -> item -> a) -> a -> full -> aListLike Data.ListLike Strict version of foldl.
foldl' :: FoldableLL full item => (a -> item -> a) -> a -> full -> aListLike Data.ListLike.FoldableLL Strict version of foldl.
foldl' :: (b % 1 -> a % 1 -> b) -> b % 1 -> [a] % 1 -> blinear-base Data.List.Linear No documentation available.
foldl' :: Foldable t => (b -> a -> b) -> b -> t a -> blistsafe 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 structure to a single strict result (e.g. sum). For a general Foldable structure this should be semantically identical to,
foldl' f z = foldl' f z . toList
-
singletons-base Data.List.Singletons No documentation available.
-
singletons-base Data.List.Singletons No documentation available.
data
Foldl'Sym1 (a6989586621680416602 :: (~>) b_a5TPd ((~>) a_a5TPe b_a5TPd))singletons-base Data.List.Singletons No documentation available.
-
singletons-base Data.List.Singletons No documentation available.
Page 1 of 2 | Next