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. foldlM :: (Foldable t, Monad m) => (b -> a -> m b) -> b -> t a -> m b

   ghc	GHC.HsToCore.Monad

   No documentation available.

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

   ghc	GHC.Prelude.Basic

   No documentation available.

3. foldl1 :: Foldable t => (a -> a -> a) -> t a -> a

   ghc	GHC.Prelude.Basic

   No documentation available.

4. foldl1' :: HasCallStack => (a -> a -> a) -> [a] -> a

   ghc	GHC.Utils.Misc

   No documentation available.

5. foldl2 :: (acc -> a -> b -> acc) -> acc -> [a] -> [b] -> acc

   ghc	GHC.Utils.Misc

   No documentation available.

6. foldlM :: (Foldable t, Monad m) => (b -> a -> m b) -> b -> t a -> m b

   ghc	GHC.Utils.Monad

   No documentation available.

7. foldlM_ :: (Monad m, Foldable t) => (a -> b -> m a) -> a -> t b -> m ()

   ghc	GHC.Utils.Monad

   Monadic version of foldl that discards its result

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

   text-short	Data.Text.Short

   Strict version of foldl.

9. foldl1 :: (Char -> Char -> Char) -> ShortText -> Char

   text-short	Data.Text.Short.Partial

   Reduces the characters of the ShortText with the binary operator.

   >>> foldl1 max "abcdcba"
   'd'
   

   >>> foldl1 const "abcd"
   'a'
   

   >>> foldl1 (flip const) "abcd"
   'd'
   

   Note: Will throw an error exception if index is out of bounds.

10. foldl1' :: (Char -> Char -> Char) -> ShortText -> Char

    text-short	Data.Text.Short.Partial

    Strict version of foldl1.

Page 38 of many | Previous | Next