# Hoogle Search

Within LTS Haskell 22.17 (ghc-9.6.4)

*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' :: Foldable t => (b -> a -> b) -> b -> t a -> bbase Data.Foldable 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' :: forall a b . (b -> a -> b) -> b -> [a] -> bbase GHC.List A strict version of foldl.

foldl' :: forall a b . (b -> a -> b) -> b -> [a] -> bbase GHC.OldList A strict version of foldl.

foldl' :: (a -> Word8 -> a) -> a -> ByteString -> abytestring Data.ByteString foldl' :: (a -> Char -> a) -> a -> ByteString -> abytestring Data.ByteString.Char8 foldl' is like foldl, but strict in the accumulator.

foldl' :: (a -> Word8 -> a) -> a -> ByteString -> abytestring Data.ByteString.Lazy foldl' :: (a -> Char -> a) -> a -> ByteString -> abytestring Data.ByteString.Lazy.Char8 foldl' is like foldl, but strict in the accumulator.

foldl' :: (a -> Word8 -> a) -> a -> ShortByteString -> abytestring Data.ByteString.Short foldl' :: (a -> Word8 -> a) -> a -> ShortByteString -> abytestring Data.ByteString.Short.Internal

Page 1 of many | Next