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. data Foldl'Sym0 (a1 :: TyFun b ~> a ~> b b ~> t a ~> b)

   singletons-base	Data.List.Singletons

   No documentation available.

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

   singletons-base	Data.List.Singletons

   No documentation available.

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

   singletons-base	Data.List.Singletons

   No documentation available.

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

   singletons-base	Data.List.Singletons

   No documentation available.

5. bifoldl' :: Bifoldable t => (a -> b -> a) -> (a -> c -> a) -> a -> t b c -> a

   base	Data.Bifoldable

   As bifoldl, but strict in the result of the reduction functions at each step. This ensures that each step of the bifold 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, monolithic result (e.g., bilength).

6. ifoldl' :: FoldableWithIndex i f => (i -> b -> a -> b) -> b -> f a -> b

   lens	Control.Lens.Combinators

   Fold over the elements of a structure with an index, associating to the left, but strictly. When you don't need access to the index then foldlOf' is more flexible in what it accepts.

   foldl' l ≡ ifoldl' l . const
   

7. ifoldl' :: FoldableWithIndex i f => (i -> b -> a -> b) -> b -> f a -> b

   lens	Control.Lens.Indexed

   Fold over the elements of a structure with an index, associating to the left, but strictly. When you don't need access to the index then foldlOf' is more flexible in what it accepts.

   foldl' l ≡ ifoldl' l . const
   

8. ifoldl' :: FoldableWithIndex i f => (i -> b -> a -> b) -> b -> f a -> b

   indexed-traversable	Data.Foldable.WithIndex

   Fold over the elements of a structure with an index, associating to the left, but strictly. When you don't need access to the index then foldlOf' is more flexible in what it accepts.

   foldl' l ≡ ifoldl' l . const
   

9. ifoldl' :: FoldableWithIndex i f => (i -> b -> a -> b) -> b -> f a -> b

   optics-core	Optics.Indexed.Core

   Fold over the elements of a structure with an index, associating to the left, but strictly. When you don't need access to the index then foldlOf' is more flexible in what it accepts.

   foldl' l ≡ ifoldl' l . const
   

10. ifoldl' :: FoldableWithIndex i f => (i -> b -> a -> b) -> b -> f a -> b

    optics-core	Optics.IxFold

    Fold over the elements of a structure with an index, associating to the left, but strictly. When you don't need access to the index then foldlOf' is more flexible in what it accepts.

    foldl' l ≡ ifoldl' l . const
    

Page 22 of many | Previous | Next