Hoogle Search

Within LTS Haskell 24.21 (ghc-9.10.3)

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

Exact lookup

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

   verset	Verset

   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
   

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

   xmonad-contrib	XMonad.Config.Prime

   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
   

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

   xmonad-contrib	XMonad.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
   

4. type family Foldl' (arg :: b ~> a ~> b) (arg1 :: b) (arg2 :: t a) :: b

   singletons-base	Data.List.Singletons

   No documentation available.

5. data Foldl' (c :: b -> a -> Exp b) (d :: b) (e :: t a) (f :: b)

   harpie	Harpie.Shape

   Left fold.

   >>> :k! Eval (Foldl' (Fcf.+) 0 [1,2,3])
   ...
   = 6
   

6. foldl'Stack :: (b -> k -> a -> Map k a -> b) -> b -> Stack k a -> b

   containers	Data.Map.Internal

   No documentation available.

7. data Foldl'Sym0 (a1 :: TyFun b ~> a ~> b b ~> t a ~> b)

   singletons-base	Data.Foldable.Singletons

   No documentation available.

8. data Foldl'Sym1 (a6989586621680407266 :: b ~> a ~> b) (b1 :: TyFun b t a ~> b)

   singletons-base	Data.Foldable.Singletons

   No documentation available.

9. data Foldl'Sym2 (a6989586621680407266 :: b ~> a ~> b) (a6989586621680407267 :: b) (c :: TyFun t a b)

   singletons-base	Data.Foldable.Singletons

   No documentation available.

10. type family Foldl'Sym3 (a6989586621680407266 :: b ~> a ~> b) (a6989586621680407267 :: b) (a6989586621680407268 :: t a) :: b

    singletons-base	Data.Foldable.Singletons

    No documentation available.

Page 21 of many | Previous | Next