Hoogle Search

Within LTS Haskell 24.41 (ghc-9.10.3)

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

  1. mapM_ :: forall t k o f a b u . (Foldable t k k, WellPointed k, Monoidal f k k, u ~ UnitObject k, ObjectPair k (f u) (t a), ObjectPair k (f u) a, ObjectPair k u (t a), ObjectPair k (t a) u, ObjectPair k (f u) (f u), ObjectPair k u u, ObjectPair k b u, Object k (f b)) => k a (f b) -> k (t a) (f u)

    constrained-categories Data.Foldable.Constrained

    The distinction between mapM_ and traverse_ doesn't really make sense on grounds of Monoidal / Applicative vs Monad, but it has in fact some benefits to restrict this to endofunctors, to make the constraint list at least somewhat shorter.

  2. mapM_ :: (Foldable t, Monad m) => (a -> m b) -> t a -> m ()

    copilot-language Copilot.Language.Prelude

    Map each element of a structure to a monadic action, evaluate these actions from left to right, and ignore the results. For a version that doesn't ignore the results see mapM. mapM_ is just like traverse_, but specialised to monadic actions.

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

    ghc-lib GHC

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

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

    ghc-lib GHC.Plugins

    mapMaybe for b OccEnv.

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

    ghc-lib GHC.Plugins

    mapMaybe for b OccEnv.

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

    ghc-lib GHC.Rename.Utils

    No documentation available.

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

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

    language-c Language.C.Analysis.TravMonad

    No documentation available.

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

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

    monadlist Control.Monad.ListM

    No documentation available.

Page 61 of many | Previous | Next