Hoogle Search

Within LTS Haskell 24.33 (ghc-9.10.3)

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

Exact lookup

1. mapError :: (MonadError e m, MonadError e' n) => (m (Either e a) -> n (Either e' b)) -> m a -> n b

   mtl	Control.Monad.Except

   MonadError analogue of the mapExceptT function. The computation is unwrapped, a function is applied to the Either, and the result is lifted into the second MonadError instance.

2. mapExcept :: (Either e a -> Either e' b) -> Except e a -> Except e' b

   mtl	Control.Monad.Except

   Map the unwrapped computation using the given function.

   • runExcept (mapExcept f m) = f (runExcept
     m)

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

   mtl	Control.Monad.Except

   Map the unwrapped computation using the given function.

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

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

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

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

   mtl	Control.Monad.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

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

   mtl	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

   mtl	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

   mtl	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

   mtl	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

    mtl	Control.Monad.Reader

    Transform the value returned by a Reader.

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

Page 67 of many | Previous | Next