Hoogle Search

Within LTS Haskell 24.18 (ghc-9.10.3)

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

Exact lookup

1. mapMaybeM :: Monad m => (a -> m (Maybe b)) -> [a] -> m [b]

   distribution-opensuse	OpenSuse.Prelude

   A version of mapMaybe that works with a monadic predicate.

2. mapMSF :: forall (m :: Type -> Type) a b . Monad m => MSF m a b -> MSF m [a] [b]

   dunai	Control.Monad.Trans.MSF.List

   Apply an MSF to every input.

3. mapMaybeT :: (m (Maybe a) -> n (Maybe b)) -> MaybeT m a -> MaybeT n b

   dunai	Control.Monad.Trans.MSF.Maybe

   Transform the computation inside a MaybeT.

   • runMaybeT (mapMaybeT f m) = f (runMaybeT
     m)

4. mapMaybeS :: forall (m :: Type -> Type) a b . Monad m => MSF m a b -> MSF m (Maybe a) (Maybe b)

   dunai	Data.MonadicStreamFunction.Util

   Apply an MSF to every input. Freezes temporarily if the input is Nothing, and continues as soon as a Just is received.

5. mapM_ :: (HVector v, ArityC c (Elems v), Applicative f) => Proxy c -> (forall a . c a => a -> f ()) -> v -> f ()

   fixed-vector-hetero	Data.Vector.HFixed

   Apply monadic action to every element in the vector

6. mapMetadata :: AsMetadata a => (SExpr -> a) -> Identifier -> Identifier

   grisette	Grisette.Core

   Modify the metadata of an identifier.

7. mapMetadata :: AsMetadata a => (SExpr -> a) -> Identifier -> Identifier

   grisette	Grisette.Internal.Core.Data.Symbol

   Modify the metadata of an identifier.

8. mapMaybe :: Ord k => (a -> Maybe b) -> Map k a -> Map k b

   hashmap	Data.HashMap

   Map values and collect the Just results.

9. mapMaybeWithKey :: Ord k => (k -> a -> Maybe b) -> Map k a -> Map k b

   hashmap	Data.HashMap

   Map keys/values and collect the Just results.

10. mapMG :: (ModSummary -> ModSummary) -> ModuleGraph -> ModuleGraph

    hie-bios	HIE.Bios.Ghc.Gap

    Map a function f over all the ModSummaries. To preserve invariants f can't change the isBoot status.

Page 55 of many | Previous | Next