## 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

    Methods in com.jnape.palatable.lambda.adt.choice with type parameters of type Choice6
    Modifier and Type | Method and Description
    --- | ---
    `<G,App extends Applicative<?,App>,TravB extends Traversable<G,Choice6<A,B,C,D,E,?>>,AppTrav extends Applicative<TravB,App>> AppTrav` | Choice6.`traverse(Fn1<? super F,? extends Applicative<G,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.

    Methods in com.jnape.palatable.lambda.adt.choice that return Choice6
    Modifier and Type | Method and 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 type `A` in a `Choice6`.
    `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 type `B` in a `Choice6`.
    `<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 type `C` in a `Choice6`.
    `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 type `D` in a `Choice6`.
    `<G> Choice6<A,B,C,D,E,G>` | Choice6.`discardL(Applicative<G,Choice6<A,B,C,D,E,?>> appB)` Sequence both this `Applicative` and `appB`, discarding this `Applicative's` result and returning `appB`.
    `<G> Choice6<A,B,C,D,E,F>` | Choice6.`discardR(Applicative<G,Choice6<A,B,C,D,E,?>> appB)` Sequence both this `Applicative` and `appB`, discarding `appB's` result and returning this `Applicative`.
    `<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 type `E` in a `Choice6`.
    `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 type `F` in a `Choice6`.
    `<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 value `b` 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 a `RecursiveResult` inside this `MonadRec`, internally trampoline the operation until it yields a `termination` 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 and 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 a `lazy` 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()` The canonical `Pure` instance for `Choice6`.

    Method parameters in com.jnape.palatable.lambda.adt.choice with type arguments of type Choice6
    Modifier and Type | Method and Description
    --- | ---
    `<G> Choice6<A,B,C,D,E,G>` | Choice6.`discardL(Applicative<G,Choice6<A,B,C,D,E,?>> appB)` Sequence both this `Applicative` and `appB`, discarding this `Applicative's` result and returning `appB`.
    `<G> Choice6<A,B,C,D,E,F>` | Choice6.`discardR(Applicative<G,Choice6<A,B,C,D,E,?>> appB)` Sequence both this `Applicative` and `appB`, discarding `appB's` result and returning this `Applicative`.
    `<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 a `lazy` 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 a `RecursiveResult` inside this `MonadRec`, internally trampoline the operation until it yields a `termination` 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.