Hoogle Search
Within LTS Haskell 24.21 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
foldl' :: Foldable t => (b -> a -> b) -> b -> t a -> bnumhask NumHask.Prelude 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 -> bnumhask NumHask.Prelude 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' :: 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' :: Foldable t => (b -> a -> b) -> b -> t a -> bbasic-prelude BasicPrelude 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 -> Word64Map b -> aghc-lib-parser GHC.Data.Word64Map.Internal A strict version of foldl. 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 -> Word64Map b -> aghc-lib-parser GHC.Data.Word64Map.Lazy A strict version of foldl. 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 -> Word64Map b -> aghc-lib-parser GHC.Data.Word64Map.Strict A strict version of foldl. 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 -> Word64Map b -> aghc-lib-parser GHC.Data.Word64Map.Strict.Internal A strict version of foldl. 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 -> Key -> a) -> a -> Word64Set -> aghc-lib-parser GHC.Data.Word64Set A strict version of foldl. Each application of the operator is evaluated before using the result in the next application. This function is strict in the starting value.