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. ifoldl' :: (PrimMonad m, Unbox a) => (b -> Int -> a -> b) -> b -> MVector (PrimState m) a -> m b

   rebase	Rebase.Data.Vector.Unboxed.Mutable

   No documentation available.

2. ifoldl' :: forall (n :: PeanoNum) b a . ArityPeano n => (b -> Int -> a -> b) -> b -> ContVec n a -> b

   fixed-vector	Data.Vector.Fixed.Cont

   Strict left fold over continuation vector.

3. ifoldl' :: (a -> Int -> b -> a) -> a -> NonEmptyVector b -> a

   nonempty-vector	Data.Vector.NonEmpty

   O(n) Strict left monoidal fold with function applied to each element and its index

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

   optics-extra	Optics.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
   

5. afoldl' :: AFoldable t a => (b -> a -> b) -> b -> t a -> b

   data-diverse	Data.Diverse.AFoldable

   No documentation available.

6. sumFuseFoldl' :: Int -> Int

   perf	Perf.Algos

   foldl' fusion

7. cfoldl' :: (CFoldable f, Dom f a) => (b -> a -> b) -> b -> f a -> b

   subcategories	Control.Subcategory.Foldable

   No documentation available.

8. gfoldl' :: GTraversable c a => (forall d . c d => r -> d -> r) -> r -> a -> r

   traverse-with-class	Data.Generics.Traversable

   Generic strict left fold over the immediate subterms

9. ifoldl' :: Unboxable b => (a -> Int -> b -> a) -> a -> Vector b -> a

   unboxing-vector	Data.Vector.Unboxing

   No documentation available.

10. dfoldl' :: forall (n :: Nat) a f . (forall (m :: Nat) . () => f m -> a -> f ('S m)) -> f 'Z -> Vec n a -> f n

    vec	Data.Vec.Lazy

    Dependent strict left fold.

Page 26 of many | Previous | Next