Hoogle Search

Within LTS Haskell 24.40 (ghc-9.10.3)

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

Exact lookup

1. mapM :: (Traversable t, Monad m) => (a -> m b) -> t a -> m (t b)

   ghc-lib	GHC.HsToCore.Monad

   Map each element of a structure to a monadic action, evaluate these actions from left to right, and collect the results. For a version that ignores the results see mapM_.

   Examples

   mapM is literally a traverse with a type signature restricted to Monad. Its implementation may be more efficient due to additional power of Monad.

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

   ghc-lib	GHC.Plugins

   mapMaybe for b OccEnv.

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

   ghc-lib	GHC.Plugins

   mapMaybe for b OccEnv.

4. mapOccEnv :: (a -> b) -> OccEnv a -> OccEnv b

   ghc-lib	GHC.Plugins

   Map over an OccEnv (Functor instance).

5. mapOccEnv :: (a -> b) -> OccEnv a -> OccEnv b

   ghc-lib	GHC.Plugins

   Map over an OccEnv (Functor instance).

6. mapTyCo :: Monad m => TyCoMapper () m -> (Type -> m Type, [Type] -> m [Type], Coercion -> m Coercion, [Coercion] -> m [Coercion])

   ghc-lib	GHC.Plugins

   No documentation available.

7. mapTyCoX :: Monad m => TyCoMapper env m -> (env -> Type -> m Type, env -> [Type] -> m [Type], env -> Coercion -> m Coercion, env -> [Coercion] -> m [Coercion])

   ghc-lib	GHC.Plugins

   No documentation available.

8. mapFvRn :: Traversable f => (a -> RnM (b, FreeVars)) -> f a -> RnM (f b, FreeVars)

   ghc-lib	GHC.Rename.Utils

   No documentation available.

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

   ghc-lib	GHC.Rename.Utils

   No documentation available.

10. mapTermType :: (RttiType -> Type) -> Term -> Term

    ghc-lib	GHC.Runtime.Heap.Inspect

    No documentation available.

Page 382 of many | Previous | Next