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.

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

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

    leveldb-haskell Data.Stream.Monadic

    No documentation available.

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

    miso Miso.String

    O(n) A strict version of foldl.

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

    pinch Pinch.Internal.FoldList

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

    radix-tree Data.Patricia.Word.Lazy

    Fold the tree left-to-right with a strict accumulator.

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

    radix-tree Data.Patricia.Word.Strict

    Fold the tree left-to-right with a strict accumulator.

  7. foldl' :: (b -> a -> b) -> b -> Radix1Tree a -> b

    radix-tree Data.Radix1Tree.Word8.Lazy

    Fold the tree left-to-right with a strict accumulator.

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

    radix-tree Data.Radix1Tree.Word8.Strict

    Fold the tree left-to-right with a strict accumulator.

  9. foldl' :: (b -> a -> b) -> b -> RadixTree a -> b

    radix-tree Data.RadixTree.Word8.Lazy

    Fold the tree left-to-right with a strict accumulator.

  10. foldl' :: (b -> a -> b) -> b -> RadixTree a -> b

    radix-tree Data.RadixTree.Word8.Strict

    Fold the tree left-to-right with a strict accumulator.

Page 18 of many | Previous | Next