Hoogle Search

Within LTS Haskell 24.19 (ghc-9.10.3)

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

Exact lookup

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

   transformers	Control.Monad.Trans.Except

   Map the unwrapped computation using the given function.

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

2. mapMaybeT :: (m (Maybe a) -> n (Maybe b)) -> MaybeT m a -> MaybeT n b

   transformers	Control.Monad.Trans.Maybe

   Transform the computation inside a MaybeT.

   • runMaybeT (mapMaybeT f m) = f (runMaybeT
     m)

3. mapRWS :: (Monoid w, Monoid w') => ((a, s, w) -> (b, s, w')) -> RWS r w s a -> RWS r w' s b

   transformers	Control.Monad.Trans.RWS.CPS

   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)

4. mapRWST :: (Monad n, Monoid w, Monoid w') => (m (a, s, w) -> n (b, s, w')) -> RWST r w s m a -> RWST r w' s n b

   transformers	Control.Monad.Trans.RWS.CPS

   Map the inner computation using the given function.

   • runRWST (mapRWST f m) r s = f (runRWST m r s) mapRWST :: (m (a, s, w) -> n (b, s, w')) -> RWST r w s m a -> RWST r w' s n b

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

   transformers	Control.Monad.Trans.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)

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

   transformers	Control.Monad.Trans.RWS.Lazy

   Map the inner computation using the given function.

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

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

   transformers	Control.Monad.Trans.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)

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

   transformers	Control.Monad.Trans.RWS.Strict

   Map the inner computation using the given function.

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

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

   transformers	Control.Monad.Trans.Reader

   Transform the value returned by a Reader.

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

10. mapReaderT :: (m a -> n b) -> ReaderT r m a -> ReaderT r n b

    transformers	Control.Monad.Trans.Reader

    Transform the computation inside a ReaderT.

    • runReaderT (mapReaderT f m) = f .
      runReaderT m

Page 64 of many | Previous | Next