Hoogle Search

Within LTS Haskell 24.3 (ghc-9.10.2)

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

Exact lookup

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

   ghc-lib-parser	GHC.Prelude.Basic

   A variant of foldl that has no base case, and thus may only be applied to non-empty structures. This function is non-total and will raise a runtime exception if the structure happens to be empty.

   foldl1 f = foldl1 f . toList
   

   Examples

   Basic usage:

   >>> foldl1 (+) [1..4]
   10
   

   >>> foldl1 (+) []
   *** Exception: Prelude.foldl1: empty list
   

   >>> foldl1 (+) Nothing
   *** Exception: foldl1: empty structure
   

   >>> foldl1 (-) [1..4]
   -8
   

   >>> foldl1 (&&) [True, False, True, True]
   False
   

   >>> foldl1 (||) [False, False, True, True]
   True
   

   >>> foldl1 (+) [1..]
   * Hangs forever *
   

2. foldl1 :: (a -> a -> a) -> [a] -> a

   prelude-compat	Prelude2010

   No documentation available.

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

   rebase	Rebase.Prelude

   Left-to-right monadic fold over the elements of a structure. Given a structure t with elements (a, b, ..., w, x, y), the result of a fold with an operator function f is equivalent to:

   foldlM f z t = do
   aa <- f z a
   bb <- f aa b
   ...
   xx <- f ww x
   yy <- f xx y
   return yy -- Just @return z@ when the structure is empty
   

   For a Monad m, given two functions f1 :: a -> m b and f2 :: b -> m c, their Kleisli composition (f1 >=> f2) :: a -> m c is defined by:

   (f1 >=> f2) a = f1 a >>= f2
   

   Another way of thinking about foldlM is that it amounts to an application to z of a Kleisli composition:

   foldlM f z t =
   flip f a >=> flip f b >=> ... >=> flip f x >=> flip f y $ z
   

   The monadic effects of foldlM are sequenced from left to right. If at some step the bind operator (>>=) short-circuits (as with, e.g., mzero in a MonadPlus), the evaluated effects will be from an initial segment of the element sequence. If you want to evaluate the monadic effects in right-to-left order, or perhaps be able to short-circuit after processing a tail of the sequence of elements, you'll need to use foldrM instead. If the monadic effects don't short-circuit, the outermost application of f is to the rightmost element y, so that, ignoring effects, the result looks like a left fold:

   ((((z `f` a) `f` b) ... `f` w) `f` x) `f` y
   

   Examples

   Basic usage:

   >>> let f a e = do { print e ; return $ e : a }
   
   >>> foldlM f [] [0..3]
   0
   1
   2
   3
   [3,2,1,0]
   

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

   mixed-types-num	Numeric.MixedTypes.PreludeHiding

   Left-associative fold of a structure but with strict application of the operator. This ensures that each step of the fold is forced to Weak Head Normal Form before being applied, avoiding the collection of thunks that would otherwise occur. This is often what you want to strictly reduce a finite structure to a single strict result (e.g. sum). For a general Foldable structure this should be semantically identical to,

   foldl' f z = foldl' f z . toList
   

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

   mixed-types-num	Numeric.MixedTypes.PreludeHiding

   A variant of foldl that has no base case, and thus may only be applied to non-empty structures. This function is non-total and will raise a runtime exception if the structure happens to be empty.

   foldl1 f = foldl1 f . toList
   

   Examples

   Basic usage:

   >>> foldl1 (+) [1..4]
   10
   

   >>> foldl1 (+) []
   *** Exception: Prelude.foldl1: empty list
   

   >>> foldl1 (+) Nothing
   *** Exception: foldl1: empty structure
   

   >>> foldl1 (-) [1..4]
   -8
   

   >>> foldl1 (&&) [True, False, True, True]
   False
   

   >>> foldl1 (||) [False, False, True, True]
   True
   

   >>> foldl1 (+) [1..]
   * Hangs forever *
   

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

   LambdaHack	Game.LambdaHack.Core.Prelude

   Left-associative fold of a structure but with strict application of the operator. This ensures that each step of the fold is forced to Weak Head Normal Form before being applied, avoiding the collection of thunks that would otherwise occur. This is often what you want to strictly reduce a finite structure to a single strict result (e.g. sum). For a general Foldable structure this should be semantically identical to,

   foldl' f z = foldl' f z . toList
   

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

   LambdaHack	Game.LambdaHack.Core.Prelude

   Left-associative fold of a structure but with strict application of the operator. This ensures that each step of the fold is forced to Weak Head Normal Form before being applied, avoiding the collection of thunks that would otherwise occur. This is often what you want to strictly reduce a finite structure to a single strict result (e.g. sum). For a general Foldable structure this should be semantically identical to,

   foldl' f z = foldl' f z . toList
   

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

   LambdaHack	Game.LambdaHack.Core.Prelude

   A strict version of foldl1.

9. foldl' :: (Traversable t, Backprop a, Reifies s W) => (BVar s b -> BVar s a -> BVar s b) -> BVar s b -> BVar s (t a) -> BVar s b

   backprop	Prelude.Backprop

   Lifed foldl'. Essentially just toList composed with a normal list foldl', and is only here for convenience.

10. foldl' :: (Traversable t, Reifies s W) => AddFunc a -> ZeroFunc a -> (BVar s b -> BVar s a -> BVar s b) -> BVar s b -> BVar s (t a) -> BVar s b

    backprop	Prelude.Backprop.Explicit

    foldl', but taking explicit add and zero.

Page 5 of many | Previous | Next