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

    Methods in com.jnape.palatable.lambda.adt.choice with type parameters of type Choice7
    Modifier and Type | Method and Description
    --- | ---
    `<H,App extends Applicative<?,App>,TravB extends Traversable<H,Choice7<A,B,C,D,E,F,?>>,AppTrav extends Applicative<TravB,App>> AppTrav` | Choice7.`traverse(Fn1<? super G,? extends Applicative<H,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 Choice7
    Modifier and Type | Method and 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 type `A` in a `Choice7`.
    `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 type `B` in a `Choice7`.
    `<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 type `C` in a `Choice7`.
    `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 type `D` in a `Choice7`.
    `<H> Choice7<A,B,C,D,E,F,H>` | Choice7.`discardL(Applicative<H,Choice7<A,B,C,D,E,F,?>> appB)` Sequence both this `Applicative` and `appB`, discarding this `Applicative's` result and returning `appB`.
    `<H> Choice7<A,B,C,D,E,F,G>` | Choice7.`discardR(Applicative<H,Choice7<A,B,C,D,E,F,?>> appB)` Sequence both this `Applicative` and `appB`, discarding `appB's` result and returning this `Applicative`.
    `<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 type `E` in a `Choice7`.
    `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 type `F` in a `Choice7`.
    `<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 type `G` in a `Choice7`.
    `<H> Choice7<A,B,C,D,E,F,H>` | Choice7.`pure(H h)` Lift the value `b` 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 a `RecursiveResult` inside this `MonadRec`, internally trampoline the operation until it yields a `termination` 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 and 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 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,F> Pure<Choice7<A,B,C,D,E,F,?>>` | Choice7.`pureChoice()` The canonical `Pure` instance for `Choice7`.

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