Control.Monad.Trans.RWS · rerebase-1.21.2

typetype RWS r w s = RWST r w s Identity

A monad containing an environment of type r, output of type w and an updatable state of type s.

valueliftCallCC

:: Monoid w
=> CallCC m (a, s, w) (b, s, w)
-> CallCC (RWST r w s m) a b

Uniform lifting of a callCC operation to the new monad. This version rolls back to the original state on entering the continuation.

valueasks :: (Monoid w, Monad m) => (r -> a) -> RWST r w s m a

#

Retrieve a function of the current environment.

```
asks f = liftM f ask
```

valuegets :: (Monoid w, Monad m) => (s -> a) -> RWST r w s m a

#

Get a specific component of the state, using a projection function supplied.

```
gets f = liftM f get
```

valuemodify :: (Monoid w, Monad m) => (s -> s) -> RWST r w s m ()

#

modify f is an action that updates the state to the result of applying f to the current state.

```
modify f = get >>= (put . f)
```

valuecensor :: Monad m => (w -> w) -> RWST r w s m a -> RWST r w s m a

#

censor f m is an action that executes the action m and applies the function f to its output, leaving the return value unchanged.

censor f m = pass (liftM (\ x -> (x,f)) m)

runRWST (censor f m) r s = liftM (\ (a, w) -> (a, f w)) (runRWST m r s)

valuelistens :: Monad m => (w -> b) -> RWST r w s m a -> RWST r w s m (a, b)

#

listens f m is an action that executes the action m and adds the result of applying f to the output to the value of the computation.

listens f m = liftM (id *** f) (listen m)

runRWST (listens f m) r s = liftM (\ (a, w) -> ((a, f w), w)) (runRWST m r s)

valueask :: (Monoid w, Monad m) => RWST r w s m r

#

Fetch the value of the environment.

valuelocal :: (r -> r) -> RWST r w s m a -> RWST r w s m a

#

Execute a computation in a modified environment

runRWST (local f m) r s = runRWST m (f r) s

valuereader :: (Monoid w, Monad m) => (r -> a) -> RWST r w s m a

#

Constructor for computations in the reader monad (equivalent to asks).

valueget :: (Monoid w, Monad m) => RWST r w s m s

#

Fetch the current value of the state within the monad.

valueput :: (Monoid w, Monad m) => s -> RWST r w s m ()

#

put s sets the state within the monad to s.

valuestate :: (Monoid w, Monad m) => (s -> (a, s)) -> RWST r w s m a

#

Construct a state monad computation from a state transformer function.

valuelisten :: Monad m => RWST r w s m a -> RWST r w s m (a, w)

#

listen m is an action that executes the action m and adds its output to the value of the computation.

runRWST (listen m) r s = liftM (\ (a, w) -> ((a, w), w)) (runRWST m r s)

valuepass :: Monad m => RWST r w s m (a, w -> w) -> RWST r w s m a

#

pass m is an action that executes the action m, which returns a value and a function, and returns the value, applying the function to the output.

runRWST (pass m) r s = liftM (\ ((a, f), w) -> (a, f w)) (runRWST m r s)

valuetell :: Monad m => w -> RWST r w s m ()

#

tell w is an action that produces the output w.

valuewriter :: Monad m => (a, w) -> RWST r w s m a

#

Construct a writer computation from a (result, output) pair.

newtypenewtype RWST r w s (m :: Type -> Type) a

#

A monad transformer adding reading an environment of type r, collecting an output of type w and updating a state of type s to an inner monad m.

Constructors

RWST
- runRWST :: r -> s -> m (a, s, w)

Instances40MonadRWS, MonadAccum, MonadError, MonadReader, MonadState, MonadWriter, …

(Monoid w, Monad m) => MonadRWS r w s (RWST r w s m)Defined in mtl-2.3.1 · Control.Monad.RWS.Class
(MonadAccum w' m, Monoid w) => MonadAccum w' (RWST r w s m)Defined in mtl-2.3.1 · Control.Monad.Accum
(Monoid w, MonadError e m) => MonadError e (RWST r w s m)Defined in mtl-2.3.1 · Control.Monad.Error.Class
(Monad m, Monoid w) => MonadReader r (RWST r w s m)Defined in mtl-2.3.1 · Control.Monad.Reader.Class
(Monad m, Monoid w) => MonadState s (RWST r w s m)Defined in mtl-2.3.1 · Control.Monad.State.Class
(Monoid w, Monad m) => MonadWriter w (RWST r w s m)Defined in mtl-2.3.1 · Control.Monad.Writer.Class
(MonadSelect w' m, Monoid w) => MonadSelect w' (RWST r w s m)Defined in mtl-2.3.1 · Control.Monad.Select
A combination of an 'outer' ReaderT, WriterT and StateT. In short, you get a value of type r which can influence what gets picked, but not how anything is ranked, and the 'ranking' function gets access to an s and a w, but can modify neither.
(Monoid w, MonadBase b m) => MonadBase b (RWST r w s m)Defined in transformers-base-0.4.6 · Control.Monad.Base
(Functor f, MonadFree f m, Monoid w) => MonadFree f (RWST r w s m)Defined in free-5.2 · Control.Monad.Free.Class
Monoid w => MonadTrans (RWST r w s)Defined in transformers-0.6.1.1 · Control.Monad.Trans.RWS.Lazy
Monoid w => BindTrans (RWST r w s)Defined in semigroupoids-6.0.1 · Data.Functor.Bind.Trans
(Monoid w, Monad m) => Monad (RWST r w s m)Defined in transformers-0.6.1.1 · Control.Monad.Trans.RWS.Lazy
Functor m => Functor (RWST r w s m)Defined in transformers-0.6.1.1 · Control.Monad.Trans.RWS.Lazy
(Monoid w, MonadFix m) => MonadFix (RWST r w s m)Defined in transformers-0.6.1.1 · Control.Monad.Trans.RWS.Lazy
(Monoid w, MonadFail m) => MonadFail (RWST r w s m)Defined in transformers-0.6.1.1 · Control.Monad.Trans.RWS.Lazy
(Monoid w, Functor m, Monad m) => Applicative (RWST r w s m)Defined in transformers-0.6.1.1 · Control.Monad.Trans.RWS.Lazy
(Monoid w, Functor m, MonadPlus m) => Alternative (RWST r w s m)Defined in transformers-0.6.1.1 · Control.Monad.Trans.RWS.Lazy
(Monoid w, MonadPlus m) => MonadPlus (RWST r w s m)Defined in transformers-0.6.1.1 · Control.Monad.Trans.RWS.Lazy
(Monoid w, MonadIO m) => MonadIO (RWST r w s m)Defined in transformers-0.6.1.1 · Control.Monad.Trans.RWS.Lazy
Contravariant m => Contravariant (RWST r w s m)Defined in transformers-0.6.1.1 · Control.Monad.Trans.RWS.Lazy
(Monoid w, MonadCont m) => MonadCont (RWST r w s m)Defined in mtl-2.3.1 · Control.Monad.Cont.Class
(MonadCatch m, Monoid w) => MonadCatch (RWST r w s m)Defined in exceptions-0.10.9 · Control.Monad.Catch
(MonadMask m, Monoid w) => MonadMask (RWST r w s m)Defined in exceptions-0.10.9 · Control.Monad.Catch
(MonadThrow m, Monoid w) => MonadThrow (RWST r w s m)Defined in exceptions-0.10.9 · Control.Monad.Catch
(Monoid w, PrimMonad m) => PrimMonad (RWST r w s m)Defined in primitive-0.9.1.0 · Control.Monad.Primitive
Decidable m => Decidable (RWST r w s m)Defined in contravariant-1.5.5 · Data.Functor.Contravariant.Divisible
Divisible m => Divisible (RWST r w s m)Defined in contravariant-1.5.5 · Data.Functor.Contravariant.Divisible
Alt f => Alt (RWST r w s f)Defined in semigroupoids-6.0.1 · Data.Functor.Alt
(Bind m, Semigroup w) => Apply (RWST r w s m)Defined in semigroupoids-6.0.1 · Data.Functor.Bind.Class
An RWST r w s m is not Applicative unless its w is a Monoid, but it is an instance of Apply
(Bind m, Semigroup w) => Bind (RWST r w s m)Defined in semigroupoids-6.0.1 · Data.Functor.Bind.Class
An RWST r w s m is not a Monad unless its w is a Monoid, but it is an instance of Bind
Conclude m => Conclude (RWST r w s m)Defined in semigroupoids-6.0.1 · Data.Functor.Contravariant.Conclude
Decide m => Decide (RWST r w s m)Defined in semigroupoids-6.0.1 · Data.Functor.Contravariant.Decide
Divise m => Divise (RWST r w s m)Defined in semigroupoids-6.0.1 · Data.Functor.Contravariant.Divise
Plus f => Plus (RWST r w s f)Defined in semigroupoids-6.0.1 · Data.Functor.Plus
Invariant m => Invariant (RWST r w s m)Defined in invariant-0.6.4 · Data.Functor.Invariant
from the transformers package
(Monoid w, Monad m) => Selective (RWST r w s m)Defined in selective-0.7.0.1 · Control.Selective
(Default w, Pointed m) => Pointed (RWST r w s m)Defined in pointed-5.0.4 · Data.Pointed
Generic (RWST r w s m a)Defined in transformers-0.6.1.1 · Control.Monad.Trans.RWS.Lazy
type Rep (RWST r w s m a) = D1 ('MetaData "RWST" "Control.Monad.Trans.RWS.Lazy" "transformers-0.6.1.1-a11a" 'True) (C1 ('MetaCons "RWST" 'PrefixI 'True) (S1 ('MetaSel ('Just "runRWST") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (r -> s -> m (a, s, w)))))Defined in transformers-0.6.1.1 · Control.Monad.Trans.RWS.Lazy
type PrimState (RWST r w s m) = PrimState mDefined in primitive-0.9.1.0 · Control.Monad.Primitive

valueliftCatch :: Catch e m (a, s, w) -> Catch e (RWST r w s m) a

#

Lift a catchE operation to the new monad.

valueliftCallCC'

:: Monoid w
=> CallCC m (a, s, w) (b, s, w)
-> CallCC (RWST r w s m) a b

#

In-situ lifting of a callCC operation to the new monad. This version uses the current state on entering the continuation.

valueevalRWS

:: RWS r w s a
RWS computation to execute
-> r
initial environment
-> s
initial value
-> (a, w)
final value and output

#

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

valueevalRWST

:: Monad m
=> RWST r w s m a
computation to execute
-> r
initial environment
-> s
initial value
-> m (a, w)
computation yielding final value and output

#

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

valueexecRWS

:: RWS r w s a
RWS computation to execute
-> r
initial environment
-> s
initial value
-> (s, w)
final state and output

#

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

valueexecRWST

:: Monad m
=> RWST r w s m a
computation to execute
-> r
initial environment
-> s
initial value
-> m (s, w)
computation yielding final state and output

#

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

valuemapRWS :: ((a, s, w) -> (b, s, w')) -> RWS r w s a -> RWS r w' s b

#

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)

valuemapRWST

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

#

Map the inner computation using the given function.

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

valuerunRWS :: RWS r w s a -> r -> s -> (a, s, w)

#

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

valuerws :: (r -> s -> (a, s, w)) -> RWS r w s a

#

Construct an RWS computation from a function. (The inverse of runRWS.)

valuewithRWS :: (r' -> s -> (r, s)) -> RWS r w s a -> RWS r' w s a

#

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)

valuewithRWST :: (r' -> s -> (r, s)) -> RWST r w s m a -> RWST r' w s m a

#

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)