:: (a -> m (Maybe b)) -> [a] -> m [b] -package:relude

mapMaybeM :: Applicative m => (a -> m (Maybe b)) -> [a] -> m [b]
ghc GHC.Utils.Monad, ghc-lib-parser GHC.Utils.Monad, breakpoint Debug.Breakpoint.GhcFacade
Applicative version of mapMaybe
mapMaybeM :: Monad m => (a -> m (Maybe b)) -> [a] -> m [b]
extra Control.Monad.Extra Extra, distribution-opensuse OpenSuse.Prelude
A version of mapMaybe that works with a monadic predicate.
mapMaybeM :: Monad m => (a -> m (Maybe b)) -> [a] -> m [b]
rio RIO.Prelude
Monadic mapMaybe.
mapMaybeM :: Monad m => (a -> m (Maybe b)) -> [a] -> m [b]
Agda Agda.Utils.Monad
A monadic version of mapMaybe :: (a -> Maybe b) -> [a] -> [b].
mapMaybeA :: Applicative f => (a -> f (Maybe b)) -> [a] -> f [b]
rio RIO.Prelude
Applicative mapMaybe.
mapMaybeI :: Monoidal f => (a -> f (Maybe b)) -> [a] -> f [b]
invertible Control.Invertible.Monoidal
Map each element to a Maybe monoidal and sequence the results (like traverse and mapMaybe).
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].
forMaybeA :: Applicative f => [a] -> (a -> f (Maybe b)) -> f [b]
rio RIO.Prelude
forMaybeA == flip mapMaybeA
forMaybeM :: Monad m => [a] -> (a -> m (Maybe b)) -> m [b]
rio RIO.Prelude
forMaybeM == flip mapMaybeM
forMaybeM :: Monad m => [a] -> (a -> m (Maybe b)) -> m [b]
Agda Agda.Utils.Monad
The for version of mapMaybeM.