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.
mapMaybeNameEnv :: (a -> Maybe b) -> NameEnv a -> NameEnv bghc GHC.Types.Name.Env No documentation available.
mapMaybeOccEnv :: (a -> Maybe b) -> OccEnv a -> OccEnv bghc GHC.Types.Name.Occurrence mapMaybe for b OccEnv.
mapMaybeModuleEnv :: (Module -> a -> Maybe b) -> ModuleEnv a -> ModuleEnv bghc GHC.Unit.Module.Env No documentation available.
mapModuleEnv :: (a -> b) -> ModuleEnv a -> ModuleEnv bghc GHC.Unit.Module.Env No documentation available.
mapMG :: (ModSummary -> ModSummary) -> ModuleGraph -> ModuleGraphghc GHC.Unit.Module.Graph Map a function f over all the ModSummaries. To preserve invariants f can't change the isBoot status.
mapMaybe' :: Foldable f => (a -> Maybe b) -> f a -> [b]ghc GHC.Utils.Misc No documentation available.
mapMaybeM :: Applicative m => (a -> m (Maybe b)) -> [a] -> m [b]ghc GHC.Utils.Monad Applicative version of mapMaybe
mapM_ :: Monad m => (a -> m ()) -> Consumer' a m rpipes Pipes.Prelude Consume all values using a monadic function
mapMaybe :: forall (m :: Type -> Type) a b r . Functor m => (a -> Maybe b) -> Pipe a b m rpipes Pipes.Prelude (mapMaybe f) yields Just results of f. Basic laws:
mapMaybe (f >=> g) = mapMaybe f >-> mapMaybe g mapMaybe (pure @Maybe . f) = mapMaybe (Just . f) = map f mapMaybe (const Nothing) = drain
As a result of the second law,mapMaybe return = mapMaybe Just = cat
mapM_ :: (Foldable t, Monad m) => (a -> m b) -> t a -> m ()haskell-gi-base Data.GI.Base.ShortPrelude 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.