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' :: (a -> b -> a) -> a -> EnumMap k b -> a

   enummapset	Data.EnumMap.Strict

   No documentation available.

2. foldl' :: Enum k => (a -> k -> a) -> a -> EnumSet k -> a

   enummapset	Data.EnumSet

   No documentation available.

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

   ghc-internal	GHC.Internal.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
   

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

   ghc-internal	GHC.Internal.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
   

5. foldl' :: forall a b . (b -> a -> b) -> b -> [a] -> b

   ghc-internal	GHC.Internal.Data.OldList

   A strict version of foldl.

6. foldl' :: forall a b . (b -> a -> b) -> b -> [a] -> b

   ghc-internal	GHC.Internal.List

   A strict version of foldl.

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

   protolude	Protolude

   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
   

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

   protolude	Protolude.Partial

   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
   

9. foldl' :: (a -> Char -> a) -> a -> JSString -> a

   jsaddle	Data.JSString

   O(n) A strict version of foldl. Subject to fusion.

10. foldl' :: (b -> Char -> b) -> b -> Stream Char -> b

    jsaddle	Data.JSString.Internal.Fusion.Common

    A strict version of foldl. Properties

    foldl' f z0 . stream = foldl' f z0
    

Page 10 of many | Previous | Next