Hoogle Search
Within LTS Haskell 24.28 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
mapMaybeAndRest :: (a -> Maybe b) -> [a] -> ([b], Suffix a)Agda Agda.Utils.List Like mapMaybe, but additionally return the last partition of the list where the function always returns Nothing. O(n).
mapMaybe :: (a -> Maybe b) -> List1 a -> [b]Agda Agda.Utils.List1 Like mapMaybe.
mapListT :: (m (Maybe (a, ListT m a)) -> n (Maybe (b, ListT n b))) -> ListT m a -> ListT n bAgda Agda.Utils.ListT Boilerplate function to lift MonadReader through the ListT transformer.
mapMListT :: Monad m => (a -> m b) -> ListT m a -> ListT m bAgda Agda.Utils.ListT Extending a monadic function to ListT.
mapMListT_alt :: Monad m => (a -> m b) -> ListT m a -> ListT m bAgda Agda.Utils.ListT Alternative implementation using foldListT.
mapM' :: (Foldable t, Applicative m, Monoid b) => (a -> m b) -> t a -> m bAgda Agda.Utils.Monad Generalized version of traverse_ :: Applicative m => (a -> m ()) -> [a] -> m () Executes effects and collects results in left-to-right order. Works best with left-associative monoids. Note that there is an alternative
mapM' f t = foldr mappend mempty $ mapM f t
that collects results in right-to-left order (effects still left-to-right). It might be preferable for right associative monoids.mapMM :: (Traversable t, Monad m) => (a -> m b) -> m (t a) -> m (t b)Agda Agda.Utils.Monad No documentation available.
mapMM_ :: (Foldable t, Monad m) => (a -> m ()) -> m (t a) -> m ()Agda Agda.Utils.Monad No documentation available.
mapMaybeM :: Monad m => (a -> m (Maybe b)) -> [a] -> m [b]Agda Agda.Utils.Monad A monadic version of mapMaybe :: (a -> Maybe b) -> [a] -> [b].
mapMaybeMM :: Monad m => (a -> m (Maybe b)) -> m [a] -> m [b]Agda Agda.Utils.Monad A version of mapMaybeM with a computation for the input list.