Hoogle Search
Within LTS Haskell 24.34 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
foldl' :: (a -> WindowsChar -> a) -> a -> WindowsString -> aos-string System.OsString.Windows foldl' :: Foldable t => (b -> a -> b) -> b -> t a -> brelude Relude.Foldable.Reexport 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 -> v -> a) -> a -> InsOrdHashMap k v -> ainsert-ordered-containers Data.HashMap.Strict.InsOrd No documentation available.
foldl' :: (a -> Char -> a) -> a -> YiString -> ayi-rope Yi.Rope Left fold. Benchmarks show that folding is actually Pretty Damn Slow™: consider whether folding is really the best thing to use in your scenario.
foldl' :: PrimType ty => (a -> ty -> a) -> a -> Block ty -> abasement Basement.Block No documentation available.
foldl' :: (a -> ty -> a) -> a -> Array ty -> abasement Basement.BoxedArray No documentation available.
foldl' :: forall ty a (n :: Nat) . PrimType ty => (a -> ty -> a) -> a -> BlockN n ty -> abasement Basement.Sized.Block No documentation available.
foldl' :: forall b a (n :: Nat) . (b -> a -> b) -> b -> ListN n a -> bbasement Basement.Sized.List Fold all elements from left strictly
foldl' :: forall ty a (n :: Nat) . PrimType ty => (a -> ty -> a) -> a -> UVect n ty -> abasement Basement.Sized.UVect No documentation available.
foldl' :: forall a ty (n :: Nat) . (a -> ty -> a) -> a -> Vect n ty -> abasement Basement.Sized.Vect No documentation available.