Hoogle Search

Within LTS Haskell 24.5 (ghc-9.10.2)

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

Exact lookup

1. mapMaybe :: (v1 -> Maybe v2) -> HashMap k v1 -> HashMap k v2

   unordered-containers	Data.HashMap.Lazy

   Transform this map by applying a function to every value and retaining only some of them.

2. mapMaybeWithKey :: (k -> v1 -> Maybe v2) -> HashMap k v1 -> HashMap k v2

   unordered-containers	Data.HashMap.Lazy

   Transform this map by applying a function to every value and retaining only some of them.

3. mapMaybe :: (v1 -> Maybe v2) -> HashMap k v1 -> HashMap k v2

   unordered-containers	Data.HashMap.Strict

   Transform this map by applying a function to every value and retaining only some of them.

4. mapMaybeWithKey :: (k -> v1 -> Maybe v2) -> HashMap k v1 -> HashMap k v2

   unordered-containers	Data.HashMap.Strict

   Transform this map by applying a function to every value and retaining only some of them.

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

   array	Data.Array.Base

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

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

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

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 16 of many | Previous | Next