Uses of Class
com.jnape.palatable.lambda.monad.transformer.builtin.ReaderT
Packages that use ReaderT
-
Uses of ReaderT in com.jnape.palatable.lambda.monad.transformer.builtin
Methods in com.jnape.palatable.lambda.monad.transformer.builtin that return ReaderTModifier and TypeMethodDescriptionLeft-to-right composition betweenReaderTinstances running under the same effect and compatible between their inputs and outputs.Given aPureask will give you access to the input within the monadic embeddingReaderT.carry()Pair the covariantly-positioned carrier type with the contravariantly-positioned carrier type.ReaderT.cartesian()Pair some typeCto this profunctor's carrier types.Contravariantly mapA <- B.Dually map contravariantly over the left parameter and covariantly over the right parameter.Contravariantly map over the left parameter.Covariantly map over the right parameter.ReaderT.discardL(Applicative<B, ReaderT<R, M, ?>> appB) Sequence both thisApplicativeandappB, discarding thisApplicative'sresult and returningappB.ReaderT.discardR(Applicative<B, ReaderT<R, M, ?>> appB) Sequence both thisApplicativeandappB, discardingappB'sresult 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.Modify thisMonadReader'senvironment after reading it but before running the effect.ReaderT.mapReaderT(Fn1<? super MA, ? extends MonadRec<B, N>> fn) ReaderT.pure(B b) Lift the valuebinto this applicative functor.ReaderT.trampolineM(Fn1<? super A, ? extends MonadRec<RecursiveResult<A, B>, ReaderT<R, M, ?>>> fn) Given some operation yielding aRecursiveResultinside thisMonadRec, internally trampoline the operation until it yields aterminationinstruction.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 ReaderTModifier and TypeMethodDescriptionGiven alazyinstance of this applicative over a mapping function, "zip" the two instances together using whatever application semantics the current applicative supports.ReaderT.liftReaderT()ReaderT.pureReaderT(Pure<M> pureM) Methods in com.jnape.palatable.lambda.monad.transformer.builtin with parameters of type ReaderTModifier and TypeMethodDescriptionLeft-to-right composition betweenReaderTinstances running under the same effect and compatible between their inputs and outputs.Method parameters in com.jnape.palatable.lambda.monad.transformer.builtin with type arguments of type ReaderTModifier and TypeMethodDescriptionReaderT.discardL(Applicative<B, ReaderT<R, M, ?>> appB) Sequence both thisApplicativeandappB, discarding thisApplicative'sresult and returningappB.ReaderT.discardR(Applicative<B, ReaderT<R, M, ?>> appB) Sequence both thisApplicativeandappB, discardingappB'sresult and returning thisApplicative.Chain dependent computations that may continue or short-circuit based on previous results.Given alazyinstance of this applicative over a mapping function, "zip" the two instances together using whatever application semantics the current applicative supports.ReaderT.trampolineM(Fn1<? super A, ? extends MonadRec<RecursiveResult<A, B>, ReaderT<R, M, ?>>> fn) Given some operation yielding aRecursiveResultinside thisMonadRec, internally trampoline the operation until it yields aterminationinstruction.Given another instance of this applicative over a mapping function, "zip" the two instances together using whatever application semantics the current applicative supports.