Uses of Class
com.jnape.palatable.lambda.monad.transformer.builtin.MaybeT
Packages that use MaybeT
-
Uses of MaybeT in com.jnape.palatable.lambda.monad.transformer.builtin
Methods in com.jnape.palatable.lambda.monad.transformer.builtin that return MaybeTModifier and TypeMethodDescriptionMaybeT.discardL
(Applicative<B, MaybeT<M, ?>> appB) Sequence both thisApplicative
andappB
, discarding thisApplicative's
result and returningappB
.MaybeT.discardR
(Applicative<B, MaybeT<M, ?>> appB) Sequence both thisApplicative
andappB
, discardingappB's
result and returning thisApplicative
.If the embedded value is present and satisfiespredicate
then returnjust
the embedded valueChain dependent computations that may continue or short-circuit based on previous results.Covariantly transmute this functor's parameter using the given mapping function.MaybeT.pure
(B b) Lift the valueb
into this applicative functor.MaybeT.throwError
(Unit unit) Throw an error value of typeE
into themonad
.MaybeT.trampolineM
(Fn1<? super A, ? extends MonadRec<RecursiveResult<A, B>, MaybeT<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.Methods in com.jnape.palatable.lambda.monad.transformer.builtin that return types with arguments of type MaybeTModifier and TypeMethodDescriptionGiven alazy
instance of this applicative over a mapping function, "zip" the two instances together using whatever application semantics the current applicative supports.MaybeT.liftMaybeT()
MaybeT.pureMaybeT
(Pure<M> pureM) Methods in com.jnape.palatable.lambda.monad.transformer.builtin with parameters of type MaybeTModifier and TypeMethodDescriptionMethod parameters in com.jnape.palatable.lambda.monad.transformer.builtin with type arguments of type MaybeTModifier and TypeMethodDescriptionMaybeT.discardL
(Applicative<B, MaybeT<M, ?>> appB) Sequence both thisApplicative
andappB
, discarding thisApplicative's
result and returningappB
.MaybeT.discardR
(Applicative<B, MaybeT<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.MaybeT.trampolineM
(Fn1<? super A, ? extends MonadRec<RecursiveResult<A, B>, MaybeT<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.