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. gfoldl' :: GFoldable t => (a -> b -> a) -> a -> t b -> a

   generic-deriving	Generics.Deriving.Foldable

   No documentation available.

2. ofoldl' :: MonoFoldable mono => (a -> Element mono -> a) -> a -> mono -> a

   mono-traversable	Data.MonoTraversable

   Strict left-associative fold of a monomorphic container.

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

   rio	RIO.Prelude

   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).

4. ifoldl' :: Vector v b => (a -> Int -> b -> a) -> a -> v b -> a

   rio	RIO.Vector

   No documentation available.

5. ifoldl' :: (a -> Int -> b -> a) -> a -> Vector b -> a

   rio	RIO.Vector.Boxed

   No documentation available.

6. ifoldl' :: Storable b => (a -> Int -> b -> a) -> a -> Vector b -> a

   rio	RIO.Vector.Storable

   No documentation available.

7. ifoldl' :: Unbox b => (a -> Int -> b -> a) -> a -> Vector b -> a

   rio	RIO.Vector.Unboxed

   No documentation available.

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

   diagrams-lib	Diagrams.Prelude

   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. flipfoldl' :: Foldable f => (a -> b -> b) -> b -> f a -> b

   relude	Relude.Foldable.Fold

   Similar to foldl' but takes a function with its arguments flipped.

   >>> flipfoldl' (/) 5 [2,3] :: Rational
   15 % 2
   

   This function can be useful for constructing containers from lists.

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

    relude	Relude.Foldable.Reexport

    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).

Page 23 of many | Previous | Next