Hoogle Search

Within LTS Haskell 24.6 (ghc-9.10.2)

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

Exact lookup

1. foldlMArray' :: (MArray a e m, Ix i) => (b -> e -> b) -> b -> a i e -> m b

   array	Data.Array.Base

   Strict accumulating left-associative fold.

2. foldlMArrayM' :: (MArray a e m, Ix i) => (b -> e -> m b) -> b -> a i e -> m b

   array	Data.Array.Base

   Strict accumulating left-associative monadic fold.

3. foldlArray :: (IArray a e, Ix i) => (b -> e -> b) -> b -> a i e -> b

   array	Data.Array.IArray

   Lazy left-associative fold.

4. foldlArray' :: (IArray a e, Ix i) => (b -> e -> b) -> b -> a i e -> b

   array	Data.Array.IArray

   Strict accumulating left-associative fold.

5. foldlArrayM' :: (IArray a e, Ix i, Monad m) => (b -> e -> m b) -> b -> a i e -> m b

   array	Data.Array.IArray

   Strict accumulating left-associative monadic fold.

6. foldlMArray' :: (MArray a e m, Ix i) => (b -> e -> b) -> b -> a i e -> m b

   array	Data.Array.MArray

   Strict accumulating left-associative fold.

7. foldlMArrayM' :: (MArray a e m, Ix i) => (b -> e -> m b) -> b -> a i e -> m b

   array	Data.Array.MArray

   Strict accumulating left-associative monadic fold.

8. foldlMArray' :: (MArray a e m, Ix i) => (b -> e -> b) -> b -> a i e -> m b

   array	Data.Array.MArray.Safe

   Strict accumulating left-associative fold.

9. foldlMArrayM' :: (MArray a e m, Ix i) => (b -> e -> m b) -> b -> a i e -> m b

   array	Data.Array.MArray.Safe

   Strict accumulating left-associative monadic fold.

10. foldlPrimArray :: Prim a => (b -> a -> b) -> b -> PrimArray a -> b

    primitive	Data.Primitive.PrimArray

    Lazy left-associated fold over the elements of a PrimArray.

Page 32 of many | Previous | Next