Hoogle Search

Within LTS Haskell 24.4 (ghc-9.10.2)

Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.

Exact lookup

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

   text	Data.Text.Internal.Fusion.Common

   A strict version of foldl. Properties

   foldl' f z0 . stream = foldl' f z0
   

2. foldl1 :: HasCallStack => (Char -> Char -> Char) -> Stream Char -> Char

   text	Data.Text.Internal.Fusion.Common

   foldl1 is a variant of foldl that has no starting value argument, and thus must be applied to non-empty Streams. Properties

   foldl1 f . stream = foldl1 f
   

3. foldl1' :: HasCallStack => (Char -> Char -> Char) -> Stream Char -> Char

   text	Data.Text.Internal.Fusion.Common

   A strict version of foldl1. Properties

   foldl1' f . stream = foldl1' f
   

4. foldlM' :: Monad m => (b -> Char -> m b) -> b -> Stream Char -> m b

   text	Data.Text.Internal.Fusion.Common

   A monadic version of foldl. Properties

   foldlM' f z0 . stream = foldlM' f z0
   

5. foldlChunks :: (a -> Text -> a) -> a -> Text -> a

   text	Data.Text.Internal.Lazy

   Consume the chunks of a lazy Text with a strict, tail-recursive, accumulating left fold.

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

   text	Data.Text.Lazy

   O(n) A strict version of foldl.

7. foldl1 :: HasCallStack => (Char -> Char -> Char) -> Text -> Char

   text	Data.Text.Lazy

   O(n) A variant of foldl that has no starting value argument, and thus must be applied to a non-empty Text.

8. foldl1' :: HasCallStack => (Char -> Char -> Char) -> Text -> Char

   text	Data.Text.Lazy

   O(n) A strict version of foldl1.

9. foldlChunks :: (a -> Text -> a) -> a -> Text -> a

   text	Data.Text.Lazy

   Consume the chunks of a lazy Text with a strict, tail-recursive, accumulating left fold.

10. foldlM' :: Monad m => (a -> Char -> m a) -> a -> Text -> m a

    text	Data.Text.Lazy

    O(n) A monadic version of foldl'.

Page 26 of many | Previous | Next