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.

Exact lookup

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

   rio	RIO.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
   

2. foldl' :: (a -> b -> a) -> a -> Set b -> a

   rio	RIO.Set

   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.

3. foldl' :: (a -> Char -> a) -> a -> Text -> a

   rio	RIO.Text

   O(n) A strict version of foldl.

4. foldl' :: (a -> Char -> a) -> a -> Text -> a

   rio	RIO.Text.Lazy

   O(n) A strict version of foldl.

5. foldl' :: Vector v b => (a -> b -> a) -> a -> v b -> a

   rio	RIO.Vector

   No documentation available.

6. foldl' :: (a -> b -> a) -> a -> Vector b -> a

   rio	RIO.Vector.Boxed

   No documentation available.

7. foldl' :: Storable b => (a -> b -> a) -> a -> Vector b -> a

   rio	RIO.Vector.Storable

   No documentation available.

8. foldl' :: Unbox b => (a -> b -> a) -> a -> Vector b -> a

   rio	RIO.Vector.Unboxed

   No documentation available.

9. foldl' :: Storable a => (b -> a -> b) -> b -> Vector a -> b

   storablevector	Data.StorableVector

   'foldl'' is like foldl, but strict in the accumulator.

10. foldl' :: Storable b => (a -> b -> a) -> a -> Vector b -> a

    storablevector	Data.StorableVector.Lazy

    No documentation available.

Page 6 of many | Previous | Next