Hoogle Search

Within LTS Haskell 24.66 (ghc-9.10.3)

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

Exact lookup

1. 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.

2. 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.

3. 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.

4. 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

5. 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)

6. 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)

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

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

   monads-tf	Control.Monad.RWS.Strict

   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)

9. 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.Strict

   Map the inner computation using the given function.

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

10. mapReader :: (a -> b) -> Reader r a -> Reader r b

    monads-tf	Control.Monad.Reader

    Transform the value returned by a Reader.

    • runReader (mapReader f m) = f .
      runReader m

Page 224 of many | Previous | Next