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 and Description
<B> MaybeT<M,B>	MaybeT.discardL(Applicative<B,MaybeT<M,?>> appB) Sequence both this Applicative and appB, discarding this Applicative's result and returning appB.
<B> MaybeT<M,A>	MaybeT.discardR(Applicative<B,MaybeT<M,?>> appB) Sequence both this Applicative and appB, discarding appB's result and returning this Applicative.
<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) Lift a new argument MonadRec into this MonadBase.
static <M extends MonadRec<?,M>,A> MaybeT<M,A>	MaybeT.maybeT(MonadRec<Maybe<A>,M> mma) Static factory method for lifting a Monad<Maybe<A>, M> into a MaybeT.
<B> MaybeT<M,B>	MaybeT.pure(B b) Lift the value b into this applicative functor.
<B> MaybeT<M,B>	MaybeT.trampolineM(Fn1<? super A,? extends MonadRec<RecursiveResult<A,B>,MaybeT<M,?>>> fn) Given some operation yielding a RecursiveResult inside this MonadRec, internally trampoline the operation until it yields a termination 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 and Description
<B> Lazy<MaybeT<M,B>>	MaybeT.lazyZip(Lazy<? extends Applicative<Fn1<? super A,? extends B>,MaybeT<M,?>>> lazyAppFn) Given a lazy 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() Lift for MaybeT.
static <M extends MonadRec<?,M>> Pure<MaybeT<M,?>>	MaybeT.pureMaybeT(Pure<M> pureM) The canonical Pure instance for MaybeT.

Method parameters in com.jnape.palatable.lambda.monad.transformer.builtin with type arguments of type MaybeT

Modifier and Type	Method and Description
<B> MaybeT<M,B>	MaybeT.discardL(Applicative<B,MaybeT<M,?>> appB) Sequence both this Applicative and appB, discarding this Applicative's result and returning appB.
<B> MaybeT<M,A>	MaybeT.discardR(Applicative<B,MaybeT<M,?>> appB) Sequence both this Applicative and appB, discarding appB's result and returning this Applicative.
<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 a lazy 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 a RecursiveResult inside this MonadRec, internally trampoline the operation until it yields a termination 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.