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' :: Monad m => (b -> a -> b) -> b -> Stream m a -> m b

   streamly-core	Streamly.Internal.Data.Stream

   No documentation available.

2. foldl' :: Monad m => (b -> a -> b) -> b -> Stream m a -> m b

   streamly-core	Streamly.Internal.Data.Stream

   No documentation available.

3. foldl' :: Monad m => (b -> a -> b) -> b -> StreamK m a -> m b

   streamly-core	Streamly.Internal.Data.StreamK

   Strict left associative fold.

4. foldl' :: Monad m => (a -> b -> a) -> a -> Stream m b -> m a

   vector-stream	Data.Stream.Monadic

   Left fold with a strict accumulator

5. foldl' :: (a -> Word16 -> a) -> a -> Word16String -> a

   what4	What4.Utils.Word16String

   No documentation available.

6. foldl' :: AsEnumSet a => (b -> a -> b) -> b -> EnumSet a -> b

   bitwise-enum	Data.Enum.Set

   O(n). Left fold with strict accumulator.

7. foldl' :: (FiniteBits w, Num w, Enum a) => (b -> a -> b) -> b -> EnumSet w a -> b

   bitwise-enum	Data.Enum.Set.Base

   O(n). Left fold with strict accumulator.

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

   calligraphy	Calligraphy.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
   

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

   clash-prelude	Clash.HaskellPrelude

   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' :: Foldable t => (b -> a -> b) -> b -> t a -> b

    dimensional	Numeric.Units.Dimensional.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
    

Page 17 of many | Previous | Next