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