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