Hoogle Search

Within LTS Haskell 24.40 (ghc-9.10.3)

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

Exact lookup

1. mapEvent :: forall (m :: Type -> Type) e e' value . Monad m => (e -> e') -> ResultT e m value -> ResultT e' m value

   morpheus-graphql-core	Data.Morpheus.Internal.Ext

   No documentation available.

2. mapApplySplit :: Ord a => a -> (c -> c -> c) -> (b -> c) -> (Map a b -> Map a c) -> Map a b -> Map a c

   numeric-prelude	MathObj.PartialFraction

   Apply a function on a specific element if it exists, and another function to the rest of the map.

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

   numeric-prelude	NumericPrelude

   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.

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

   numeric-prelude	NumericPrelude

   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.

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

   numeric-prelude	NumericPrelude.Base

   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 ()

   numeric-prelude	NumericPrelude.Base

   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. mapM :: (Traversable t, Monad m) => (a -> m b) -> t a -> m (t b)

   numhask	NumHask.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.

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

   numhask	NumHask.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.

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

   numhask	NumHask.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.

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

    numhask	NumHask.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.

Page 164 of many | Previous | Next