Hoogle Search

Within LTS Haskell 24.4 (ghc-9.10.2)

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

Exact lookup

1. evalRWS :: Monoid w => RWS r w s a -> r -> s -> (a, w)

   transformers	Control.Monad.Trans.RWS.CPS

   Evaluate a computation with the given initial state and environment, returning the final value and output, discarding the final state.

2. evalRWST :: (Monad m, Monoid w) => RWST r w s m a -> r -> s -> m (a, w)

   transformers	Control.Monad.Trans.RWS.CPS

   Evaluate a computation with the given initial state and environment, returning the final value and output, discarding the final state.

3. execRWS :: Monoid w => RWS r w s a -> r -> s -> (s, w)

   transformers	Control.Monad.Trans.RWS.CPS

   Evaluate a computation with the given initial state and environment, returning the final state and output, discarding the final value.

4. execRWST :: (Monad m, Monoid w) => RWST r w s m a -> r -> s -> m (s, w)

   transformers	Control.Monad.Trans.RWS.CPS

   Evaluate a computation with the given initial state and environment, returning the final state and output, discarding the final value.

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

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

7. runRWS :: Monoid w => RWS r w s a -> r -> s -> (a, s, w)

   transformers	Control.Monad.Trans.RWS.CPS

   Unwrap an RWS computation as a function. (The inverse of rws.)

8. runRWST :: Monoid w => RWST r w s m a -> r -> s -> m (a, s, w)

   transformers	Control.Monad.Trans.RWS.CPS

   Unwrap an RWST computation as a function. (The inverse of rwsT.)

9. withRWS :: (r' -> s -> (r, s)) -> RWS r w s a -> RWS r' w s a

   transformers	Control.Monad.Trans.RWS.CPS

   withRWS f m executes action m with an initial environment and state modified by applying f.

   • runRWS (withRWS f m) r s = uncurry
     (runRWS m) (f r s)

10. withRWST :: forall r' s r w (m :: Type -> Type) a . (r' -> s -> (r, s)) -> RWST r w s m a -> RWST r' w s m a

    transformers	Control.Monad.Trans.RWS.CPS

    withRWST f m executes action m with an initial environment and state modified by applying f.

    • runRWST (withRWST f m) r s = uncurry
      (runRWST m) (f r s)

Page 8 of many | Previous | Next