Uses of Class
com.jnape.palatable.lambda.monad.transformer.builtin.StateT
Packages that use StateT
Package
Description
-
Uses of StateT in com.jnape.palatable.lambda.functor.builtin
Fields in com.jnape.palatable.lambda.functor.builtin declared as StateTConstructors in com.jnape.palatable.lambda.functor.builtin with parameters of type StateT -
Uses of StateT in com.jnape.palatable.lambda.monad.transformer.builtin
Methods in com.jnape.palatable.lambda.monad.transformer.builtin that return StateTModifier and TypeMethodDescriptionUpdate the accumulated state.StateT.discardL
(Applicative<B, StateT<S, M, ?>> appB) Sequence both thisApplicative
andappB
, discarding thisApplicative's
result and returningappB
.StateT.discardR
(Applicative<B, StateT<S, M, ?>> appB) Sequence both thisApplicative
andappB
, discardingappB's
result and returning thisApplicative
.Chain dependent computations that may continue or short-circuit based on previous results.Covariantly transmute this functor's parameter using the given mapping function.Given a function that produces a value inside amonadic effect
from a state, produce aStateT
that simply passes its state to the function and applies it.Map the accumulation into a value and pair it with the current output.Modify thisMonadReader's
environment after reading it but before running the effect.Map both the result and the final state to a new result and final state inside theMonad
.StateT.pure
(B b) Lift the valueb
into this applicative functor.Lift amonadic state
intoStateT
.Lift a state-sensitivemonadically embedded
computation intoStateT
.Lift amonadic value
intoStateT
.StateT.trampolineM
(Fn1<? super A, ? extends MonadRec<RecursiveResult<A, B>, StateT<S, M, ?>>> fn) Given some operation yielding aRecursiveResult
inside thisMonadRec
, internally trampoline the operation until it yields atermination
instruction.Map the final state to a new final state inside the samemonadic effect
using the provided function.Given another instance of this applicative over a mapping function, "zip" the two instances together using whatever application semantics the current applicative supports.Methods in com.jnape.palatable.lambda.monad.transformer.builtin that return types with arguments of type StateTModifier and TypeMethodDescriptionGiven alazy
instance of this applicative over a mapping function, "zip" the two instances together using whatever application semantics the current applicative supports.StateT.liftStateT()
StateT.pureStateT
(Pure<M> pureM) Method parameters in com.jnape.palatable.lambda.monad.transformer.builtin with type arguments of type StateTModifier and TypeMethodDescriptionStateT.discardL
(Applicative<B, StateT<S, M, ?>> appB) Sequence both thisApplicative
andappB
, discarding thisApplicative's
result and returningappB
.StateT.discardR
(Applicative<B, StateT<S, M, ?>> appB) Sequence both thisApplicative
andappB
, discardingappB's
result and returning thisApplicative
.Chain dependent computations that may continue or short-circuit based on previous results.Given alazy
instance of this applicative over a mapping function, "zip" the two instances together using whatever application semantics the current applicative supports.StateT.trampolineM
(Fn1<? super A, ? extends MonadRec<RecursiveResult<A, B>, StateT<S, M, ?>>> fn) Given some operation yielding aRecursiveResult
inside thisMonadRec
, internally trampoline the operation until it yields atermination
instruction.Given another instance of this applicative over a mapping function, "zip" the two instances together using whatever application semantics the current applicative supports.