Hoogle Search

Within LTS Haskell 24.65 (ghc-9.10.3)

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

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

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

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

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

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

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

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

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

  10. mapMOf :: LensLike (WrappedMonad m) s t a b -> (a -> m b) -> s -> m t

    lens Control.Lens.Combinators

    Map each element of a structure targeted by a Lens to a monadic action, evaluate these actions from left to right, and collect the results. 

    >>> mapMOf both (\x -> [x, x + 1]) (1,3)
[(1,3),(1,4),(2,3),(2,4)]

    mapM ≡ mapMOf traverse
imapMOf l ≡ forM l . Indexed

    mapMOf :: Monad m => Iso s t a b       -> (a -> m b) -> s -> m t
mapMOf :: Monad m => Lens s t a b      -> (a -> m b) -> s -> m t
mapMOf :: Monad m => Traversal s t a b -> (a -> m b) -> s -> m t

Page 16 of many | Previous | Next