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. map32 :: Word8

   messagepack	Data.MessagePack.Spec

   No documentation available.

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

   mixed-types-num	Numeric.MixedTypes.PreludeHiding

   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_ :: (Foldable t, Monad m) => (a -> m b) -> t a -> m ()

   mixed-types-num	Numeric.MixedTypes.PreludeHiding

   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.

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

   mixed-types-num	Numeric.MixedTypes.PreludeHiding

   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.

5. mapLoggingT :: (m a -> n b) -> LoggingT m a -> LoggingT n b

   monad-logger-aeson	Control.Monad.Logger.Aeson

   Map the unwrapped computation using the given function.

6. mapNoLoggingT :: (m a -> n b) -> NoLoggingT m a -> NoLoggingT n b

   monad-logger-aeson	Control.Monad.Logger.Aeson

   Map the unwrapped computation using the given function.

7. mapCont :: (r -> r) -> Cont r a -> Cont r a

   monads-tf	Control.Monad.Cont

   Apply a function to transform the result of a continuation-passing computation.

   • runCont (mapCont f m) = f . runCont
     m

8. mapExceptT :: (m (Either e a) -> n (Either e' b)) -> ExceptT e m a -> ExceptT e' n b

   monads-tf	Control.Monad.Except

   Map the unwrapped computation using the given function.

   • runExceptT (mapExceptT f m) = f
     (runExceptT m)

9. mapRWS :: ((a, s, w) -> (b, s, w')) -> RWS r w s a -> RWS r w' s b

   monads-tf	Control.Monad.RWS.Lazy

   Map the return value, final state and output of a computation using the given function.

   • runRWS (mapRWS f m) r s = f (runRWS m r
     s)

10. mapRWST :: (m (a, s, w) -> n (b, s, w')) -> RWST r w s m a -> RWST r w' s n b

    monads-tf	Control.Monad.RWS.Lazy

    Map the inner computation using the given function.

    • runRWST (mapRWST f m) r s = f (runRWST m
      r s)

Page 222 of many | Previous | Next