Hoogle Search

Within LTS Haskell 22.22 (ghc-9.6.5)

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

    base 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

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

    base 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

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

    base GHC.List

    A strict version of foldl.

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

    base GHC.OldList

    A strict version of foldl.

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

    bytestring Data.ByteString

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

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

    bytestring Data.ByteString.Char8

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

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

    bytestring Data.ByteString.Lazy

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

  8. foldl' :: (a -> Char -> a) -> a -> ByteString -> a

    bytestring Data.ByteString.Lazy.Char8

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

  9. foldl' :: (a -> Word8 -> a) -> a -> ShortByteString -> a

    bytestring Data.ByteString.Short

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

  10. foldl' :: (a -> Word8 -> a) -> a -> ShortByteString -> a

    bytestring Data.ByteString.Short.Internal

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

Page 1 of many | Next