Hoogle Search

Within LTS Haskell 24.32 (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

   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

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

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

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

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

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

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

8. mapSelect :: (a -> a) -> Select r a -> Select r a

   transformers	Control.Monad.Trans.Select

   Apply a function to transform the result of a selection computation.

   • runSelect (mapSelect f m) = f .
     runSelect m

9. mapSelectT :: (m a -> m a) -> SelectT r m a -> SelectT r m a

   transformers	Control.Monad.Trans.Select

   Apply a function to transform the result of a selection computation. This has a more restricted type than the map operations for other monad transformers, because SelectT does not define a functor in the category of monads.

   • runSelectT (mapSelectT f m) = f .
     runSelectT m

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

    transformers	Control.Monad.Trans.State.Lazy

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

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

Page 100 of many | Previous | Next