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.
getStateT :: StateT (g :: Type -> Type) (m :: Type -> Type) a -> g (m (a, Rep g))adjunctions Control.Monad.Representable.State No documentation available.
-
adjunctions Control.Monad.Representable.State Map both the return value and final state of a computation using the given function.
-
adjunctions Control.Monad.Representable.State No documentation available.
runState :: forall (g :: Type -> Type) a . Representable g => State g a -> Rep g -> (a, Rep g)adjunctions Control.Monad.Representable.State Unwrap a state monad computation as a function. (The inverse of state.)
-
adjunctions Control.Monad.Representable.State No documentation available.
class Monad m =>
MonadState (m :: Type -> Type)monads-tf Control.Monad.State.Class get returns the state from the internals of the monad. put replaces the state inside the monad.
class Monad m =>
MonadState (m :: Type -> Type)monads-tf Control.Monad.State.Lazy get returns the state from the internals of the monad. put replaces the state inside the monad.
evalState :: State s a -> s -> amonads-tf Control.Monad.State.Lazy Evaluate a state computation with the given initial state and return the final value, discarding the final state.
evalStateT :: Monad m => StateT s m a -> s -> m amonads-tf Control.Monad.State.Lazy Evaluate a state computation with the given initial state and return the final value, discarding the final state.
evalStateT m s = liftM fst (runStateT m s)
execState :: State s a -> s -> smonads-tf Control.Monad.State.Lazy Evaluate a state computation with the given initial state and return the final state, discarding the final value.