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. mapMaybeOccEnv :: (a -> Maybe b) -> OccEnv a -> OccEnv b

   ghc-lib	GHC.Plugins

   mapMaybe for b OccEnv.

2. mapMaybeOccEnv :: (a -> Maybe b) -> OccEnv a -> OccEnv b

   ghc-lib	GHC.Plugins

   mapMaybe for b OccEnv.

3. mapMaybeFvRn :: (a -> RnM (b, FreeVars)) -> Maybe a -> RnM (Maybe b, FreeVars)

   ghc-lib	GHC.Rename.Utils

   No documentation available.

4. mapM_ :: forall m (u :: Type -> Type) a (v :: Type -> Type) b c d . (Monad m, Vector u a, Vector v b, Vector u c, Vector v d) => ((a, b) -> m (c, d)) -> Vector u v (a, b) -> m ()

   hybrid-vectors	Data.Vector.Hybrid

   O(n) Apply the monadic action to all elements of a vector and ignore the results

5. mapMaybeM :: Monad m => Maybe a -> (a -> m b) -> m (Maybe b)

   language-c	Language.C.Analysis.TravMonad

   No documentation available.

6. mapMaybeM :: (Monad m, Functor m) => (a -> m (Maybe b)) -> [a] -> m [b]

   monad-extras	Control.Monad.Extra

   A monadic version of mapMaybe :: (a -> Maybe b) -> [a] -> [b].

7. mapMP :: (Monad m, MonadPlus p) => (a -> m b) -> [a] -> m (p b)

   monadlist	Control.Monad.ListM

   No documentation available.

8. mapMonoidMap :: DecidablyEmpty b => (a -> b) -> MonoidMap k a -> MonoidMap k b

   monoid-map	Data.MonoidMap

   No documentation available.

9. mapMState :: (MonadIO m, MonadIO n) => (m (a, t) -> n (b, t)) -> MState t m a -> MState t n b

   mstate	Control.Concurrent.MState

   Map a stateful computation from one (return value, state) pair to another. See Control.Monad.State.Lazy for more information. Be aware that both MStates still share the same state.

10. mapMState_ :: MonadIO n => (m a -> n b) -> MState t m a -> MState t n b

    mstate	Control.Concurrent.MState

    No documentation available.

Page 61 of many | Previous | Next