Hoogle Search

Within LTS Haskell 22.25 (ghc-9.6.5)

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

Exact lookup

1. mapM :: Monad m => (a -> m b) -> ListN n a -> m (ListN n b)

   basement	Basement.Sized.List

   Map each element of a List to a monadic action, evaluate these actions sequentially and collect the results

2. mapM :: (Traversable t, Monad m) => (a -> m b) -> t a -> m (t b)

   relude	Relude.Foldable.Reexport

   Map each element of a structure to a monadic action, evaluate these actions from left to right, and collect the results. For a version that ignores the results see mapM_.

   Examples

   mapM is literally a traverse with a type signature restricted to Monad. Its implementation may be more efficient due to additional power of Monad.

3. mapM :: Monad m => (time0 -> m time1) -> (body0 -> m body1) -> T time0 body0 -> m (T time1 body1)

   event-list	Data.EventList.Absolute.TimeBody

   No documentation available.

4. mapM :: Monad m => (time0 -> m time1) -> (body0 -> m body1) -> T time0 body0 -> m (T time1 body1)

   event-list	Data.EventList.Absolute.TimeTime

   No documentation available.

5. mapM :: Monad m => (time0 -> m time1) -> (body0 -> m body1) -> T time0 body0 -> m (T time1 body1)

   event-list	Data.EventList.Relative.BodyBody

   No documentation available.

6. mapM :: Monad m => (time0 -> m time1) -> (body0 -> m body1) -> T time0 body0 -> m (T time1 body1)

   event-list	Data.EventList.Relative.BodyTime

   No documentation available.

7. mapM :: Monad m => (time0 -> m time1) -> (body0 -> m body1) -> T time0 body0 -> m (T time1 body1)

   event-list	Data.EventList.Relative.TimeBody

   No documentation available.

8. mapM :: Monad m => (time0 -> m time1) -> (body0 -> m body1) -> T time0 body0 -> m (T time1 body1)

   event-list	Data.EventList.Relative.TimeTime

   No documentation available.

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

   ghc-lib-parser	GHC.Data.Stream

   Apply a monadic operation to each element of a Stream, lazily

10. mapM :: (Traversable t, Monad m) => (a -> m b) -> t a -> m (t b)

    ghc-lib-parser	GHC.Prelude.Basic

    Map each element of a structure to a monadic action, evaluate these actions from left to right, and collect the results. For a version that ignores the results see mapM_.

    Examples

    mapM is literally a traverse with a type signature restricted to Monad. Its implementation may be more efficient due to additional power of Monad.

Page 4 of many | Previous | Next