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

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

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

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

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

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

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

   mtl	Control.Monad.Reader

   Transform the computation inside a ReaderT.

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

8. mapState :: ((a, s) -> (b, s)) -> State s a -> State s b

   mtl	Control.Monad.State.Lazy

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

   • runState (mapState f m) = f . runState
     m

9. mapStateT :: (m (a, s) -> n (b, s)) -> StateT s m a -> StateT s n b

   mtl	Control.Monad.State.Lazy

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

   • runStateT (mapStateT f m) = f .
     runStateT m

10. mapState :: ((a, s) -> (b, s)) -> State s a -> State s b

    mtl	Control.Monad.State.Strict

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

    • runState (mapState f m) = f . runState
      m

Page 67 of many | Previous | Next