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' :: (a -> Range -> Color -> a) -> a -> Zebra -> a

    radix-tree Data.Zebra.Word

    Fold left-to-right over the ranges with a strict accumulator.

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

    rawfilepath Data.ByteString.RawFilePath

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

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

    rope-utf16-splay Data.Rope.UTF16

    A strict version of foldl

  4. foldl' :: (a -> Char -> a) -> a -> Rope -> a

    rope-utf16-splay Data.Rope.UTF16.Internal

    A strict version of foldl

  5. foldl' :: Monad m => (b -> a -> b) -> b -> SerialT m a -> m b

    streamly Streamly.Internal.Data.Stream.IsStream

    Left associative/strict push fold. foldl' reduce initial stream invokes reduce with the accumulator and the next input in the input stream, using initial as the initial value of the current value of the accumulator. When the input is exhausted the current value of the accumulator is returned. Make sure to use a strict data structure for accumulator to not build unnecessary lazy expressions unless that's what you want. See the previous section for more details.

  6. foldl' :: Monad m => (b -> a -> b) -> b -> SerialT m a -> m b

    streamly Streamly.Prelude

    Left associative/strict push fold. foldl' reduce initial stream invokes reduce with the accumulator and the next input in the input stream, using initial as the initial value of the current value of the accumulator. When the input is exhausted the current value of the accumulator is returned. Make sure to use a strict data structure for accumulator to not build unnecessary lazy expressions unless that's what you want. See the previous section for more details.

  7. foldl' :: (r -> [c] -> r) -> r -> TSet c -> r

    trie-simple Data.Trie.Set

    No documentation available.

  8. foldl' :: Unboxable b => (a -> b -> a) -> a -> Vector b -> a

    unboxing-vector Data.Vector.Unboxing

    No documentation available.

  9. foldl' :: forall a b (n :: Nat) . (b -> a -> b) -> b -> Vec n a -> b

    vec Data.Vec.Lazy

    Strict left fold.

  10. foldl' :: forall (n :: Nat) b a . SNatI n => (b -> a -> b) -> b -> Vec n a -> b

    vec Data.Vec.Pull

    Strict left fold.

Page 19 of many | Previous | Next