Hoogle Search

Within LTS Haskell 24.6 (ghc-9.10.2)

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

Exact lookup

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

   rio	RIO.Text

   O(n) A strict version of foldl.

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

   rio	RIO.Text.Lazy

   O(n) A strict version of foldl.

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

   rio	RIO.Text.Lazy

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

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

   rio	RIO.Text.Lazy.Partial

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

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

   rio	RIO.Text.Lazy.Partial

   O(n) A strict version of foldl1.

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

   rio	RIO.Text.Partial

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

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

   rio	RIO.Text.Partial

   O(n) A strict version of foldl1.

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

   rio	RIO.Vector

   No documentation available.

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

   rio	RIO.Vector.Boxed

   No documentation available.

10. foldl1 :: (a -> a -> a) -> Vector a -> a

    rio	RIO.Vector.Boxed.Partial

    No documentation available.

Page 42 of many | Previous | Next