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. foldl1' :: HasCallStack => (a -> a -> a) -> [a] -> a

   ghc-internal	GHC.Internal.Data.List

   A strict version of foldl1.

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

   ghc-internal	GHC.Internal.Data.OldList

   A strict version of foldl.

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

   ghc-internal	GHC.Internal.Data.OldList

   foldl1 is a variant of foldl that has no starting value argument, and thus must be applied to non-empty lists. Note that unlike foldl, the accumulated value must be of the same type as the list elements.

   >>> foldl1 (+) [1..4]
   10
   
   >>> foldl1 (+) []
   *** Exception: Prelude.foldl1: empty list
   
   >>> foldl1 (-) [1..4]
   -8
   
   >>> foldl1 (&&) [True, False, True, True]
   False
   
   >>> foldl1 (||) [False, False, True, True]
   True
   
   >>> foldl1 (+) [1..]
   * Hangs forever *
   

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

   ghc-internal	GHC.Internal.Data.OldList

   A strict version of foldl1.

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

   ghc-internal	GHC.Internal.List

   A strict version of foldl.

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

   ghc-internal	GHC.Internal.List

   foldl1 is a variant of foldl that has no starting value argument, and thus must be applied to non-empty lists. Note that unlike foldl, the accumulated value must be of the same type as the list elements.

   >>> foldl1 (+) [1..4]
   10
   
   >>> foldl1 (+) []
   *** Exception: Prelude.foldl1: empty list
   
   >>> foldl1 (-) [1..4]
   -8
   
   >>> foldl1 (&&) [True, False, True, True]
   False
   
   >>> foldl1 (||) [False, False, True, True]
   True
   
   >>> foldl1 (+) [1..]
   * Hangs forever *
   

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

   ghc-internal	GHC.Internal.List

   A strict version of foldl1.

8. foldlInner :: (Index (Lower ix), Index ix, Source r e) => (a -> e -> a) -> a -> Array r ix e -> Array D (Lower ix) a

   massiv	Data.Massiv.Array

   Left fold over the inner most dimension.

9. foldlM :: (Index ix, Source r e, Monad m) => (a -> e -> m a) -> a -> Array r ix e -> m a

   massiv	Data.Massiv.Array

   O(n) - Monadic left fold.

10. foldlM_ :: (Index ix, Source r e, Monad m) => (a -> e -> m a) -> a -> Array r ix e -> m ()

    massiv	Data.Massiv.Array

    O(n) - Monadic left fold, that discards the result.

Page 54 of many | Previous | Next