Hoogle Search

Within LTS Haskell 24.4 (ghc-9.10.2)

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

Exact lookup

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

   base	Prelude

   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.

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

   base	Prelude

   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.

3. mappend :: Monoid a => a -> a -> a

   base	Prelude

   An associative operation NOTE: This method is redundant and has the default implementation mappend = (<>) since base-4.11.0.0. Should it be implemented manually, since mappend is a synonym for (<>), it is expected that the two functions are defined the same way. In a future GHC release mappend will be removed from Monoid.

4. mapping :: forall (f :: Type -> Type) (g :: Type -> Type) s t a b . (Functor f, Functor g) => AnIso s t a b -> Iso (f s) (g t) (f a) (g b)

   gogol-core	Gogol.Prelude

   This can be used to lift any Iso into an arbitrary Functor.

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

   hedgehog	Hedgehog.Internal.Prelude

   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.

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

   hedgehog	Hedgehog.Internal.Prelude

   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.

7. mappend :: Monoid a => a -> a -> a

   hedgehog	Hedgehog.Internal.Prelude

   An associative operation NOTE: This method is redundant and has the default implementation mappend = (<>) since base-4.11.0.0. Should it be implemented manually, since mappend is a synonym for (<>), it is expected that the two functions are defined the same way. In a future GHC release mappend will be removed from Monoid.

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

   ghc	GHC.Prelude.Basic

   No documentation available.

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

   ghc	GHC.Prelude.Basic

   No documentation available.

10. mappend :: Monoid a => a -> a -> a

    ghc	GHC.Prelude.Basic

    No documentation available.

Page 4 of many | Previous | Next