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.
evalRWS :: RWS r w s a -> r -> s -> (a, w)transformers Control.Monad.Trans.RWS.Lazy Evaluate a computation with the given initial state and environment, returning the final value and output, discarding the final state.
evalRWST :: Monad m => RWST r w s m a -> r -> s -> m (a, w)transformers Control.Monad.Trans.RWS.Lazy Evaluate a computation with the given initial state and environment, returning the final value and output, discarding the final state.
execRWS :: RWS r w s a -> r -> s -> (s, w)transformers Control.Monad.Trans.RWS.Lazy Evaluate a computation with the given initial state and environment, returning the final state and output, discarding the final value.
execRWST :: Monad m => RWST r w s m a -> r -> s -> m (s, w)transformers Control.Monad.Trans.RWS.Lazy Evaluate a computation with the given initial state and environment, returning the final state and output, discarding the final value.
mapRWS :: ((a, s, w) -> (b, s, w')) -> RWS r w s a -> RWS r w' s btransformers Control.Monad.Trans.RWS.Lazy Map the return value, final state and output of a computation using the given function.
mapRWST :: (m (a, s, w) -> n (b, s, w')) -> RWST r w s m a -> RWST r w' s n btransformers Control.Monad.Trans.RWS.Lazy Map the inner computation using the given function.
runRWS :: RWS r w s a -> r -> s -> (a, s, w)transformers Control.Monad.Trans.RWS.Lazy Unwrap an RWS computation as a function. (The inverse of rws.)
runRWST :: RWST r w s (m :: Type -> Type) a -> r -> s -> m (a, s, w)transformers Control.Monad.Trans.RWS.Lazy No documentation available.
withRWS :: (r' -> s -> (r, s)) -> RWS r w s a -> RWS r' w s atransformers Control.Monad.Trans.RWS.Lazy withRWS f m executes action m with an initial environment and state modified by applying f.
-
transformers Control.Monad.Trans.RWS.Lazy withRWST f m executes action m with an initial environment and state modified by applying f.