Uses of Class
com.jnape.palatable.lambda.monad.transformer.builtin.MaybeT
-
Packages that use MaybeT Package Description com.jnape.palatable.lambda.monad.transformer.builtin -
-
Uses of MaybeT in com.jnape.palatable.lambda.monad.transformer.builtin
Methods in com.jnape.palatable.lambda.monad.transformer.builtin that return MaybeT Modifier and Type Method Description MaybeT<M,A>
MaybeT. catchError(Fn1<? super Unit,? extends Monad<A,MaybeT<M,?>>> recoveryFn)
<B> MaybeT<M,B>
MaybeT. discardL(Applicative<B,MaybeT<M,?>> appB)
Sequence both thisApplicative
andappB
, discarding thisApplicative's
result and returningappB
.<B> MaybeT<M,A>
MaybeT. discardR(Applicative<B,MaybeT<M,?>> appB)
Sequence both thisApplicative
andappB
, discardingappB's
result and returning thisApplicative
.MaybeT<M,A>
MaybeT. filter(Fn1<? super A,? extends java.lang.Boolean> predicate)
If the embedded value is present and satisfiespredicate
then returnjust
the embedded value<B> MaybeT<M,B>
MaybeT. flatMap(Fn1<? super A,? extends Monad<B,MaybeT<M,?>>> f)
Chain dependent computations that may continue or short-circuit based on previous results.<B> MaybeT<M,B>
MaybeT. fmap(Fn1<? super A,? extends B> fn)
Covariantly transmute this functor's parameter using the given mapping function.<B,N extends MonadRec<?,N>>
MaybeT<N,B>MaybeT. lift(MonadRec<B,N> mb)
static <M extends MonadRec<?,M>,A>
MaybeT<M,A>MaybeT. maybeT(MonadRec<Maybe<A>,M> mma)
MaybeT<M,A>
MaybeT. or(MaybeT<M,A> other)
<B> MaybeT<M,B>
MaybeT. pure(B b)
Lift the valueb
into this applicative functor.MaybeT<M,A>
MaybeT. throwError(Unit unit)
Throw an error value of typeE
into themonad
.<B> MaybeT<M,B>
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.<B> MaybeT<M,B>
MaybeT. zip(Applicative<Fn1<? super A,? extends B>,MaybeT<M,?>> appFn)
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 MaybeT Modifier and Type Method Description <B> Lazy<MaybeT<M,B>>
MaybeT. lazyZip(Lazy<? extends Applicative<Fn1<? super A,? extends B>,MaybeT<M,?>>> lazyAppFn)
Given alazy
instance of this applicative over a mapping function, "zip" the two instances together using whatever application semantics the current applicative supports.static Lift<MaybeT<?,?>>
MaybeT. liftMaybeT()
static <M extends MonadRec<?,M>>
Pure<MaybeT<M,?>>MaybeT. pureMaybeT(Pure<M> pureM)
Methods in com.jnape.palatable.lambda.monad.transformer.builtin with parameters of type MaybeT Modifier and Type Method Description MaybeT<M,A>
MaybeT. or(MaybeT<M,A> other)
Method parameters in com.jnape.palatable.lambda.monad.transformer.builtin with type arguments of type MaybeT Modifier and Type Method Description MaybeT<M,A>
MaybeT. catchError(Fn1<? super Unit,? extends Monad<A,MaybeT<M,?>>> recoveryFn)
<B> MaybeT<M,B>
MaybeT. discardL(Applicative<B,MaybeT<M,?>> appB)
Sequence both thisApplicative
andappB
, discarding thisApplicative's
result and returningappB
.<B> MaybeT<M,A>
MaybeT. discardR(Applicative<B,MaybeT<M,?>> appB)
Sequence both thisApplicative
andappB
, discardingappB's
result and returning thisApplicative
.<B> MaybeT<M,B>
MaybeT. flatMap(Fn1<? super A,? extends Monad<B,MaybeT<M,?>>> f)
Chain dependent computations that may continue or short-circuit based on previous results.<B> Lazy<MaybeT<M,B>>
MaybeT. lazyZip(Lazy<? extends Applicative<Fn1<? super A,? extends B>,MaybeT<M,?>>> lazyAppFn)
Given alazy
instance of this applicative over a mapping function, "zip" the two instances together using whatever application semantics the current applicative supports.<B> MaybeT<M,B>
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.<B> MaybeT<M,B>
MaybeT. zip(Applicative<Fn1<? super A,? extends B>,MaybeT<M,?>> appFn)
Given another instance of this applicative over a mapping function, "zip" the two instances together using whatever application semantics the current applicative supports.
-