Hoogle Search

Within LTS Haskell 24.33 (ghc-9.10.3)

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

Exact lookup

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

   array	Data.Array.MArray

   Constructs a new array derived from the original array by applying a function to each of the elements.

2. mapIndices :: (MArray a e m, Ix i, Ix j) => (i, i) -> (i -> j) -> a j e -> m (a i e)

   array	Data.Array.MArray

   Constructs a new array derived from the original array by applying a function to each of the indices.

3. mapMArrayM_ :: (MArray a e m, Ix i) => (e -> m b) -> a i e -> m ()

   array	Data.Array.MArray

   Map elements to monadic actions, sequence them left-to-right, and discard the results.

4. mapArray :: (MArray a e' m, MArray a e m, Ix i) => (e' -> e) -> a i e' -> m (a i e)

   array	Data.Array.MArray.Safe

   Constructs a new array derived from the original array by applying a function to each of the elements.

5. mapIndices :: (MArray a e m, Ix i, Ix j) => (i, i) -> (i -> j) -> a j e -> m (a i e)

   array	Data.Array.MArray.Safe

   Constructs a new array derived from the original array by applying a function to each of the indices.

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

   array	Data.Array.MArray.Safe

   Map elements to monadic actions, sequence them left-to-right, and discard the results.

7. mapArray' :: (a -> b) -> Array a -> Array b

   primitive	Data.Primitive.Array

   Strict map over the elements of the array.

8. mapMaybePrimArray :: (Prim a, Prim b) => (a -> Maybe b) -> PrimArray a -> PrimArray b

   primitive	Data.Primitive.PrimArray

   Map over a primitive array, optionally discarding some elements. This has the same behavior as Data.Maybe.mapMaybe.

9. mapMaybePrimArrayA :: (Applicative f, Prim a, Prim b) => (a -> f (Maybe b)) -> PrimArray a -> f (PrimArray b)

   primitive	Data.Primitive.PrimArray

   Map over the primitive array, keeping the elements for which the applicative predicate provides a Just.

10. mapMaybePrimArrayP :: (PrimMonad m, Prim a, Prim b) => (a -> m (Maybe b)) -> PrimArray a -> m (PrimArray b)

    primitive	Data.Primitive.PrimArray

    Map over the primitive array, keeping the elements for which the monadic predicate provides a Just.

Page 72 of many | Previous | Next