A - the first possible typeB - the second possible typeC - the third possible typeD - the fourth possible typepublic abstract class Choice4<A,B,C,D> extends Object implements CoProduct4<A,B,C,D,Choice4<A,B,C,D>>, MonadRec<D,Choice4<A,B,C,?>>, Bifunctor<C,D,Choice4<A,B,?,?>>, Traversable<D,Choice4<A,B,C,?>>
CoProduct4.| Modifier and Type | Method and Description |
|---|---|
static <A,B,C,D> Choice4<A,B,C,D> |
a(A a)
Static factory method for wrapping a value of type
A in a Choice4. |
static <A,B,C,D> Choice4<A,B,C,D> |
b(B b)
Static factory method for wrapping a value of type
B in a Choice4. |
<E,F> Choice4<A,B,E,F> |
biMap(Fn1<? super C,? extends E> lFn,
Fn1<? super D,? extends F> rFn)
Dually map covariantly over both the left and right parameters.
|
<E> Choice4<A,B,E,D> |
biMapL(Fn1<? super C,? extends E> fn)
Covariantly map over the left parameter.
|
<E> Choice4<A,B,C,E> |
biMapR(Fn1<? super D,? extends E> fn)
Covariantly map over the right parameter.
|
static <A,B,C,D> Choice4<A,B,C,D> |
c(C c)
Static factory method for wrapping a value of type
C in a Choice4. |
Choice3<A,B,C> |
converge(Fn1<? super D,? extends CoProduct3<A,B,C,?>> convergenceFn)
Converge this coproduct down to a lower order coproduct by mapping the last possible type into an earlier
possible type.
|
static <A,B,C,D> Choice4<A,B,C,D> |
d(D d)
Static factory method for wrapping a value of type
D in a Choice4. |
<E> Choice4<A,B,C,E> |
discardL(Applicative<E,Choice4<A,B,C,?>> appB)
Sequence both this
Applicative and appB, discarding this Applicative's
result and returning appB. |
<E> Choice4<A,B,C,D> |
discardR(Applicative<E,Choice4<A,B,C,?>> appB)
Sequence both this
Applicative and appB, discarding appB's result and
returning this Applicative. |
<E> Choice5<A,B,C,D,E> |
diverge()
Diverge this coproduct by introducing another possible type that it could represent.
|
<E> Choice4<A,B,C,E> |
flatMap(Fn1<? super D,? extends Monad<E,Choice4<A,B,C,?>>> f)
Chain dependent computations that may continue or short-circuit based on previous results.
|
<E> Choice4<A,B,C,E> |
fmap(Fn1<? super D,? extends E> fn)
Covariantly transmute this functor's parameter using the given mapping function.
|
<E> Lazy<Choice4<A,B,C,E>> |
lazyZip(Lazy<? extends Applicative<Fn1<? super D,? extends E>,Choice4<A,B,C,?>>> 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. |
Tuple4<Maybe<A>,Maybe<B>,Maybe<C>,Maybe<D>> |
project()
Specialize this choice's projection to a
Tuple4. |
<E> Choice4<A,B,C,E> |
pure(E e)
Lift the value
b into this applicative functor. |
static <A,B,C> Pure<Choice4<A,B,C,?>> |
pureChoice()
|
<E> Choice4<A,B,C,E> |
trampolineM(Fn1<? super D,? extends MonadRec<RecursiveResult<D,E>,Choice4<A,B,C,?>>> fn)
Given some operation yielding a
RecursiveResult inside this MonadRec, internally trampoline the
operation until it yields a termination instruction. |
<E,App extends Applicative<?,App>,TravB extends Traversable<E,Choice4<A,B,C,?>>,AppTrav extends Applicative<TravB,App>> |
traverse(Fn1<? super D,? extends Applicative<E,App>> fn,
Fn1<? super TravB,? extends AppTrav> pure)
Apply
fn to each element of this traversable from left to right, and collapse the results into
a single resulting applicative, potentially with the assistance of the applicative's pure function. |
<E> Choice4<A,B,C,E> |
zip(Applicative<Fn1<? super D,? extends E>,Choice4<A,B,C,?>> appFn)
Given another instance of this applicative over a mapping function, "zip" the two instances together using
whatever application semantics the current applicative supports.
|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, waitpublic Tuple4<Maybe<A>,Maybe<B>,Maybe<C>,Maybe<D>> project()
Tuple4.public <E> Choice5<A,B,C,D,E> diverge()
public Choice3<A,B,C> converge(Fn1<? super D,? extends CoProduct3<A,B,C,?>> convergenceFn)
converge in interface CoProduct4<A,B,C,D,Choice4<A,B,C,D>>convergenceFn - function from last possible type to earlier typeCoProduct3<A, B, C>CoProduct3.converge(com.jnape.palatable.lambda.functions.Fn1<? super C, ? extends com.jnape.palatable.lambda.adt.coproduct.CoProduct2<A, B, ?>>)public final <E> Choice4<A,B,C,E> fmap(Fn1<? super D,? extends E> fn)
fmap in interface Applicative<D,Choice4<A,B,C,?>>fmap in interface Functor<D,Choice4<A,B,C,?>>fmap in interface Monad<D,Choice4<A,B,C,?>>fmap in interface MonadRec<D,Choice4<A,B,C,?>>fmap in interface Traversable<D,Choice4<A,B,C,?>>E - the new parameter typefn - the mapping functionpublic final <E> Choice4<A,B,E,D> biMapL(Fn1<? super C,? extends E> fn)
biMapL in interface Bifunctor<C,D,Choice4<A,B,?,?>>biMapL in interface BoundedBifunctor<C,D,Object,Object,Choice4<A,B,?,?>>E - the new left parameter typefn - the mapping functionpublic final <E> Choice4<A,B,C,E> biMapR(Fn1<? super D,? extends E> fn)
biMapR(f) == fmap(f).biMapR in interface Bifunctor<C,D,Choice4<A,B,?,?>>biMapR in interface BoundedBifunctor<C,D,Object,Object,Choice4<A,B,?,?>>E - the new right parameter typefn - the mapping functionpublic final <E,F> Choice4<A,B,E,F> biMap(Fn1<? super C,? extends E> lFn, Fn1<? super D,? extends F> rFn)
BifunctorbiMapL(lFn).biMapR(rFn).biMap in interface Bifunctor<C,D,Choice4<A,B,?,?>>biMap in interface BoundedBifunctor<C,D,Object,Object,Choice4<A,B,?,?>>E - the new left parameter typeF - the new right parameter typelFn - the left parameter mapping functionrFn - the right parameter mapping functionpublic <E> Choice4<A,B,C,E> pure(E e)
b into this applicative functor.pure in interface Applicative<D,Choice4<A,B,C,?>>pure in interface Monad<D,Choice4<A,B,C,?>>pure in interface MonadRec<D,Choice4<A,B,C,?>>E - the type of the returned applicative's parametere - the valuepublic <E> Choice4<A,B,C,E> zip(Applicative<Fn1<? super D,? extends E>,Choice4<A,B,C,?>> appFn)
zip in interface Applicative<D,Choice4<A,B,C,?>>zip in interface Monad<D,Choice4<A,B,C,?>>zip in interface MonadRec<D,Choice4<A,B,C,?>>E - the resulting applicative parameter typeappFn - the other applicative instancepublic <E> Lazy<Choice4<A,B,C,E>> lazyZip(Lazy<? extends Applicative<Fn1<? super D,? extends E>,Choice4<A,B,C,?>>> lazyAppFn)
lazy instance of this applicative over a mapping function, "zip" the two instances together
using whatever application semantics the current applicative supports. This is useful for applicatives that
support lazy evaluation and early termination.lazyZip in interface Applicative<D,Choice4<A,B,C,?>>lazyZip in interface Monad<D,Choice4<A,B,C,?>>lazyZip in interface MonadRec<D,Choice4<A,B,C,?>>E - the resulting applicative parameter typelazyAppFn - the lazy other applicative instanceMaybe,
Eitherpublic <E> Choice4<A,B,C,E> discardL(Applicative<E,Choice4<A,B,C,?>> appB)
Applicative and appB, discarding this Applicative's
result and returning appB. This is generally useful for sequentially performing side-effects.discardL in interface Applicative<D,Choice4<A,B,C,?>>discardL in interface Monad<D,Choice4<A,B,C,?>>discardL in interface MonadRec<D,Choice4<A,B,C,?>>E - the type of the returned Applicative's parameterappB - the other Applicativepublic <E> Choice4<A,B,C,D> discardR(Applicative<E,Choice4<A,B,C,?>> appB)
Applicative and appB, discarding appB's result and
returning this Applicative. This is generally useful for sequentially performing side-effects.discardR in interface Applicative<D,Choice4<A,B,C,?>>discardR in interface Monad<D,Choice4<A,B,C,?>>discardR in interface MonadRec<D,Choice4<A,B,C,?>>E - the type of appB's parameterappB - the other Applicativepublic <E> Choice4<A,B,C,E> flatMap(Fn1<? super D,? extends Monad<E,Choice4<A,B,C,?>>> f)
public <E> Choice4<A,B,C,E> trampolineM(Fn1<? super D,? extends MonadRec<RecursiveResult<D,E>,Choice4<A,B,C,?>>> fn)
RecursiveResult inside this MonadRec, internally trampoline the
operation until it yields a termination instruction.
Stack-safety depends on implementations guaranteeing that the growth of the call stack is a constant factor independent of the number of invocations of the operation. For various examples of how this can be achieved in stereotypical circumstances, see the referenced types.
trampolineM in interface MonadRec<D,Choice4<A,B,C,?>>E - the ultimate resulting carrier typefn - the function to internally trampolineMonadRecfor a basic implementation,
for a {@link CoProduct2 coproduct} implementation,
for an implementation leveraging an already stack-safe {@link Monad#flatMap(Fn1)},
for a {@link MonadT monad transformer} implementationpublic <E,App extends Applicative<?,App>,TravB extends Traversable<E,Choice4<A,B,C,?>>,AppTrav extends Applicative<TravB,App>> AppTrav traverse(Fn1<? super D,? extends Applicative<E,App>> fn, Fn1<? super TravB,? extends AppTrav> pure)
fn to each element of this traversable from left to right, and collapse the results into
a single resulting applicative, potentially with the assistance of the applicative's pure function.traverse in interface Traversable<D,Choice4<A,B,C,?>>E - the resulting element typeApp - the result applicative typeTravB - this Traversable instance over BAppTrav - the full inferred resulting type from the traversalfn - the function to applypure - the applicative pure functionpublic static <A,B,C,D> Choice4<A,B,C,D> a(A a)
A in a Choice4.A - the first possible typeB - the second possible typeC - the third possible typeD - the fourth possible typea - the valueChoice4<A, B, C, D>public static <A,B,C,D> Choice4<A,B,C,D> b(B b)
B in a Choice4.A - the first possible typeB - the second possible typeC - the third possible typeD - the fourth possible typeb - the valueChoice4<A, B, C, D>public static <A,B,C,D> Choice4<A,B,C,D> c(C c)
C in a Choice4.A - the first possible typeB - the second possible typeC - the third possible typeD - the fourth possible typec - the valueChoice4<A, B, C, D>public static <A,B,C,D> Choice4<A,B,C,D> d(D d)
D in a Choice4.A - the first possible typeB - the second possible typeC - the third possible typeD - the fourth possible typed - the valueChoice4<A, B, C, D>