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

   rebase	Rebase.Data.Vector.Generic.Mutable

   No documentation available.

2. foldl' :: PrimMonad m => (b -> a -> b) -> b -> MVector (PrimState m) a -> m b

   rebase	Rebase.Data.Vector.Mutable

   No documentation available.

3. foldl' :: Prim b => (a -> b -> a) -> a -> Vector b -> a

   rebase	Rebase.Data.Vector.Primitive

   No documentation available.

4. foldl' :: (PrimMonad m, Prim a) => (b -> a -> b) -> b -> MVector (PrimState m) a -> m b

   rebase	Rebase.Data.Vector.Primitive.Mutable

   No documentation available.

5. foldl' :: Storable b => (a -> b -> a) -> a -> Vector b -> a

   rebase	Rebase.Data.Vector.Storable

   No documentation available.

6. foldl' :: (PrimMonad m, Storable a) => (b -> a -> b) -> b -> MVector (PrimState m) a -> m b

   rebase	Rebase.Data.Vector.Storable.Mutable

   No documentation available.

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

   rebase	Rebase.Data.Vector.Unboxed

   No documentation available.

8. foldl' :: (PrimMonad m, Unbox a) => (b -> a -> b) -> b -> MVector (PrimState m) a -> m b

   rebase	Rebase.Data.Vector.Unboxed.Mutable

   No documentation available.

9. foldL' :: (x -> acc -> acc) -> acc -> T x -> acc

   synthesizer-core	Synthesizer.State.Signal

   No documentation available.

10. foldl' :: (a -> Prime Int -> a) -> a -> PrimeIntSet -> a

    arithmoi	Math.NumberTheory.Primes.IntSet

    A strict version of foldl.

Page 14 of many | Previous | Next