Hoogle Search

Within LTS Haskell 24.45 (ghc-9.10.3)

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

Exact lookup

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

   prelude-compat	Prelude2010

   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.

2. mapLeft :: Bifunctor p => (a -> b) -> p a c -> p b c

   rebase	Rebase.Data.Bifunctor

   A more meaningful and conflict-free alias for first.

3. mapRight :: Bifunctor p => (b -> c) -> p a b -> p a c

   rebase	Rebase.Data.Bifunctor

   A more meaningful and conflict-free alias for second.

4. mapM :: Monad m => (a -> m b) -> Vector a -> m (Vector b)

   rebase	Rebase.Data.Vector

   No documentation available.

5. mapM_ :: Monad m => (a -> m b) -> Vector a -> m ()

   rebase	Rebase.Data.Vector

   No documentation available.

6. mapMaybe :: (a -> Maybe b) -> Vector a -> Vector b

   rebase	Rebase.Data.Vector

   No documentation available.

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

   rebase	Rebase.Data.Vector

   No documentation available.

8. mapM :: Monad m => (a -> m b) -> Stream m a -> Stream m b

   rebase	Rebase.Data.Vector.Fusion.Stream.Monadic

   Map a monadic function over a Stream

9. mapM_ :: Monad m => (a -> m b) -> Stream m a -> m ()

   rebase	Rebase.Data.Vector.Fusion.Stream.Monadic

   Execute a monadic action for each element of the Stream

10. mapMaybe :: forall (m :: Type -> Type) a b . Monad m => (a -> Maybe b) -> Stream m a -> Stream m b

    rebase	Rebase.Data.Vector.Fusion.Stream.Monadic

    No documentation available.

Page 206 of many | Previous | Next