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

   ghc	GHC.Prelude.Basic

   No documentation available.

2. foldl' :: (a -> Char -> a) -> a -> ShortText -> a

   text-short	Data.Text.Short

   Strict version of foldl.

3. foldl' :: (acc -> Elem Keys -> acc) -> acc -> Metadatas -> acc

   JuicyPixels	Codec.Picture.Metadata

   Strict left fold of the metadatas

4. foldl' :: MonoFoldable mono => (a -> Element mono -> a) -> a -> mono -> a

   mono-traversable	Data.MonoTraversable.Unprefixed

   Synonym for ofoldl'

5. foldl' :: (a -> Word8 -> a) -> a -> ByteString -> a

   rio	RIO.ByteString

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

6. foldl' :: (a -> Word8 -> a) -> a -> ByteString -> a

   rio	RIO.ByteString.Lazy

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

7. foldl' :: (a -> v -> a) -> a -> HashMap k v -> a

   rio	RIO.HashMap

   Reduce this map by applying a binary operator to all elements, using the given starting value (typically the left-identity of the operator). Each application of the operator is evaluated before using the result in the next application. This function is strict in the starting value.

8. foldl' :: (a -> b -> a) -> a -> HashSet b -> a

   rio	RIO.HashSet

   Reduce this set by applying a binary operator to all elements, using the given starting value (typically the left-identity of the operator). Each application of the operator is evaluated before before using the result in the next application. This function is strict in the starting value.

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

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

10. foldl' :: (a -> b -> a) -> a -> Map k b -> a

    rio	RIO.Map

    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.

Page 5 of many | Previous | Next