Uses of Class
com.jnape.palatable.lambda.adt.choice.Choice6
-
Packages that use Choice6 Package Description com.jnape.palatable.lambda.adt.choice -
-
Uses of Choice6 in com.jnape.palatable.lambda.adt.choice
Subclasses of Choice6 in com.jnape.palatable.lambda.adt.choice Modifier and Type Class Description private static class
Choice6._A<A,B,C,D,E,F>
private static class
Choice6._B<A,B,C,D,E,F>
private static class
Choice6._C<A,B,C,D,E,F>
private static class
Choice6._D<A,B,C,D,E,F>
private static class
Choice6._E<A,B,C,D,E,F>
private static class
Choice6._F<A,B,C,D,E,F>
Methods in com.jnape.palatable.lambda.adt.choice with type parameters of type Choice6 Modifier and Type Method Description <G,App extends Applicative<?,App>,TravB extends Traversable<G,Choice6<A,B,C,D,E,?>>,AppTrav extends Applicative<TravB,App>>
AppTravChoice6. traverse(Fn1<? super F,? extends Applicative<G,App>> fn, Fn1<? super TravB,? extends AppTrav> pure)
Applyfn
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.Methods in com.jnape.palatable.lambda.adt.choice that return Choice6 Modifier and Type Method Description static <A,B,C,D,E,F>
Choice6<A,B,C,D,E,F>Choice6. a(A a)
Static factory method for wrapping a value of typeA
in aChoice6
.static <A,B,C,D,E,F>
Choice6<A,B,C,D,E,F>Choice6. b(B b)
Static factory method for wrapping a value of typeB
in aChoice6
.<G,H>
Choice6<A,B,C,D,G,H>Choice6. biMap(Fn1<? super E,? extends G> lFn, Fn1<? super F,? extends H> rFn)
Dually map covariantly over both the left and right parameters.<G> Choice6<A,B,C,D,G,F>
Choice6. biMapL(Fn1<? super E,? extends G> fn)
Covariantly map over the left parameter.<G> Choice6<A,B,C,D,E,G>
Choice6. biMapR(Fn1<? super F,? extends G> fn)
Covariantly map over the right parameter.static <A,B,C,D,E,F>
Choice6<A,B,C,D,E,F>Choice6. c(C c)
Static factory method for wrapping a value of typeC
in aChoice6
.Choice6<A,B,C,D,E,F>
Choice7. converge(Fn1<? super G,? extends CoProduct6<A,B,C,D,E,F,?>> 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,E,F>
Choice6<A,B,C,D,E,F>Choice6. d(D d)
Static factory method for wrapping a value of typeD
in aChoice6
.<G> Choice6<A,B,C,D,E,G>
Choice6. discardL(Applicative<G,Choice6<A,B,C,D,E,?>> appB)
Sequence both thisApplicative
andappB
, discarding thisApplicative's
result and returningappB
.<G> Choice6<A,B,C,D,E,F>
Choice6. discardR(Applicative<G,Choice6<A,B,C,D,E,?>> appB)
Sequence both thisApplicative
andappB
, discardingappB's
result and returning thisApplicative
.<F> Choice6<A,B,C,D,E,F>
Choice5. diverge()
Diverge this coproduct by introducing another possible type that it could represent.static <A,B,C,D,E,F>
Choice6<A,B,C,D,E,F>Choice6. e(E e)
Static factory method for wrapping a value of typeE
in aChoice6
.static <A,B,C,D,E,F>
Choice6<A,B,C,D,E,F>Choice6. f(F f)
Static factory method for wrapping a value of typeF
in aChoice6
.<G> Choice6<A,B,C,D,E,G>
Choice6. flatMap(Fn1<? super F,? extends Monad<G,Choice6<A,B,C,D,E,?>>> fn)
Chain dependent computations that may continue or short-circuit based on previous results.<G> Choice6<A,B,C,D,E,G>
Choice6. fmap(Fn1<? super F,? extends G> fn)
Covariantly transmute this functor's parameter using the given mapping function.<G> Choice6<A,B,C,D,E,G>
Choice6. pure(G g)
Lift the valueb
into this applicative functor.<G> Choice6<A,B,C,D,E,G>
Choice6. trampolineM(Fn1<? super F,? extends MonadRec<RecursiveResult<F,G>,Choice6<A,B,C,D,E,?>>> fn)
Given some operation yielding aRecursiveResult
inside thisMonadRec
, internally trampoline the operation until it yields atermination
instruction.<G> Choice6<A,B,C,D,E,G>
Choice6. zip(Applicative<Fn1<? super F,? extends G>,Choice6<A,B,C,D,E,?>> 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.adt.choice that return types with arguments of type Choice6 Modifier and Type Method Description <G> Lazy<Choice6<A,B,C,D,E,G>>
Choice6. lazyZip(Lazy<? extends Applicative<Fn1<? super F,? extends G>,Choice6<A,B,C,D,E,?>>> 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 <A,B,C,D,E>
Pure<Choice6<A,B,C,D,E,?>>Choice6. pureChoice()
Method parameters in com.jnape.palatable.lambda.adt.choice with type arguments of type Choice6 Modifier and Type Method Description <G> Choice6<A,B,C,D,E,G>
Choice6. discardL(Applicative<G,Choice6<A,B,C,D,E,?>> appB)
Sequence both thisApplicative
andappB
, discarding thisApplicative's
result and returningappB
.<G> Choice6<A,B,C,D,E,F>
Choice6. discardR(Applicative<G,Choice6<A,B,C,D,E,?>> appB)
Sequence both thisApplicative
andappB
, discardingappB's
result and returning thisApplicative
.<G> Choice6<A,B,C,D,E,G>
Choice6. flatMap(Fn1<? super F,? extends Monad<G,Choice6<A,B,C,D,E,?>>> fn)
Chain dependent computations that may continue or short-circuit based on previous results.<G> Lazy<Choice6<A,B,C,D,E,G>>
Choice6. lazyZip(Lazy<? extends Applicative<Fn1<? super F,? extends G>,Choice6<A,B,C,D,E,?>>> lazyAppFn)
Given alazy
instance of this applicative over a mapping function, "zip" the two instances together using whatever application semantics the current applicative supports.<G> Choice6<A,B,C,D,E,G>
Choice6. trampolineM(Fn1<? super F,? extends MonadRec<RecursiveResult<F,G>,Choice6<A,B,C,D,E,?>>> fn)
Given some operation yielding aRecursiveResult
inside thisMonadRec
, internally trampoline the operation until it yields atermination
instruction.<G> Choice6<A,B,C,D,E,G>
Choice6. zip(Applicative<Fn1<? super F,? extends G>,Choice6<A,B,C,D,E,?>> appFn)
Given another instance of this applicative over a mapping function, "zip" the two instances together using whatever application semantics the current applicative supports.
-