## Uses of Class
com.jnape.palatable.lambda.adt.hlist.Tuple7

- Packages that use Tuple7
  Package | Description
  --- | ---
  com.jnape.palatable.lambda.adt.choice |
  com.jnape.palatable.lambda.adt.hlist |
  com.jnape.palatable.lambda.adt.hmap |

- - ### Uses of Tuple7 in com.jnape.palatable.lambda.adt.choice

    Methods in com.jnape.palatable.lambda.adt.choice that return Tuple7
    Modifier and Type | Method and Description
    --- | ---
    `Tuple7<Maybe<A>,Maybe<B>,Maybe<C>,Maybe<D>,Maybe<E>,Maybe<F>,Maybe<G>>` | Choice7.`project()` Specialize this choice's projection to a `Tuple7`.

  - ### Uses of Tuple7 in com.jnape.palatable.lambda.adt.hlist

    Methods in com.jnape.palatable.lambda.adt.hlist with type parameters of type Tuple7
    Modifier and Type | Method and Description
    --- | ---
    `<_7Prime,App extends Applicative<?,App>,TravB extends Traversable<_7Prime,Tuple7<_1,_2,_3,_4,_5,_6,?>>,AppTrav extends Applicative<TravB,App>> AppTrav` | Tuple7.`traverse(Fn1<? super _7,? extends Applicative<_7Prime,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.hlist that return Tuple7
    Modifier and Type | Method and Description
    --- | ---
    `<_6Prime,_7Prime> Tuple7<_1,_2,_3,_4,_5,_6Prime,_7Prime>` | Tuple7.`biMap(Fn1<? super _6,? extends _6Prime> lFn, Fn1<? super _7,? extends _7Prime> rFn)` Dually map covariantly over both the left and right parameters.
    `<_6Prime> Tuple7<_1,_2,_3,_4,_5,_6Prime,_7>` | Tuple7.`biMapL(Fn1<? super _6,? extends _6Prime> fn)` Covariantly map over the left parameter.
    `<_7Prime> Tuple7<_1,_2,_3,_4,_5,_6,_7Prime>` | Tuple7.`biMapR(Fn1<? super _7,? extends _7Prime> fn)` Covariantly map over the right parameter.
    `<_0> Tuple7<_0,_1,_2,_3,_4,_5,_6>` | Tuple6.`cons(_0 _0)` Cons an element onto the front of this HList.
    `<_7Prime> Tuple7<_1,_2,_3,_4,_5,_6,_7Prime>` | Tuple7.`discardL(Applicative<_7Prime,Tuple7<_1,_2,_3,_4,_5,_6,?>> appB)` Sequence both this `Applicative` and `appB`, discarding this `Applicative's` result and returning `appB`.
    `<_7Prime> Tuple7<_1,_2,_3,_4,_5,_6,_7>` | Tuple7.`discardR(Applicative<_7Prime,Tuple7<_1,_2,_3,_4,_5,_6,?>> appB)` Sequence both this `Applicative` and `appB`, discarding `appB's` result and returning this `Applicative`.
    `static <A> Tuple7<A,A,A,A,A,A,A>` | Tuple7.`fill(A a)` Given a value of type `A`, produced an instance of this tuple with each slot set to that value.
    `<_7Prime> Tuple7<_1,_2,_3,_4,_5,_6,_7Prime>` | Tuple7.`flatMap(Fn1<? super _7,? extends Monad<_7Prime,Tuple7<_1,_2,_3,_4,_5,_6,?>>> f)` Chain dependent computations that may continue or short-circuit based on previous results.
    `<_7Prime> Tuple7<_1,_2,_3,_4,_5,_6,_7Prime>` | Tuple7.`fmap(Fn1<? super _7,? extends _7Prime> fn)` Covariantly transmute this functor's parameter using the given mapping function.
    `Tuple7<_2,_1,_3,_4,_5,_6,_7>` | Tuple7.`invert()` Rotate the first two slots of this product.
    `<_7Prime> Tuple7<_1,_2,_3,_4,_5,_6,_7Prime>` | Tuple7.`pure(_7Prime _7Prime)` Lift the value `b` into this applicative functor.
    `Tuple7<_2,_3,_1,_4,_5,_6,_7>` | Tuple7.`rotateL3()` Rotate the first three values of this product one slot to the left.
    `Tuple7<_2,_3,_4,_1,_5,_6,_7>` | Tuple7.`rotateL4()` Rotate the first four values of this product one slot to the left.
    `Tuple7<_2,_3,_4,_5,_1,_6,_7>` | Tuple7.`rotateL5()` Rotate the first five values of this product one slot to the left.
    `Tuple7<_2,_3,_4,_5,_6,_1,_7>` | Tuple7.`rotateL6()` Rotate the first six values of this product one slot to the left.
    `Tuple7<_2,_3,_4,_5,_6,_7,_1>` | Tuple7.`rotateL7()` Rotate the first seven values of this product one slot to the left.
    `Tuple7<_3,_1,_2,_4,_5,_6,_7>` | Tuple7.`rotateR3()` Rotate the first three values of this product one slot to the right.
    `Tuple7<_4,_1,_2,_3,_5,_6,_7>` | Tuple7.`rotateR4()` Rotate the first four values of this product one slot to the right.
    `Tuple7<_5,_1,_2,_3,_4,_6,_7>` | Tuple7.`rotateR5()` Rotate the first five values of this product one slot to the right.
    `Tuple7<_6,_1,_2,_3,_4,_5,_7>` | Tuple7.`rotateR6()` Rotate the first six values of this product one slot to the right.
    `Tuple7<_7,_1,_2,_3,_4,_5,_6>` | Tuple7.`rotateR7()` Rotate the first seven values of this product one slot to the right.
    `<_7Prime> Tuple7<_1,_2,_3,_4,_5,_6,_7Prime>` | Tuple7.`trampolineM(Fn1<? super _7,? extends MonadRec<RecursiveResult<_7,_7Prime>,Tuple7<_1,_2,_3,_4,_5,_6,?>>> fn)` Given some operation yielding a `RecursiveResult` inside this `MonadRec`, internally trampoline the operation until it yields a `termination` instruction.
    `static <_1,_2,_3,_4,_5,_6,_7> Tuple7<_1,_2,_3,_4,_5,_6,_7>` | HList.`tuple(_1 _1, _2 _2, _3 _3, _4 _4, _5 _5, _6 _6, _7 _7)` Static factory method for creating a 7-element HList.
    `<_7Prime> Tuple7<_1,_2,_3,_4,_5,_6,_7Prime>` | Tuple7.`zip(Applicative<Fn1<? super _7,? extends _7Prime>,Tuple7<_1,_2,_3,_4,_5,_6,?>> 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.hlist that return types with arguments of type Tuple7
    Modifier and Type | Method and Description
    --- | ---
    `static <A> Maybe<Tuple7<A,A,A,A,A,A,A>>` | Tuple7.`fromIterable(Iterable<A> as)` Return `just` the first seven elements from the given `Iterable`, or `nothing` if there are less than seven elements.
    `<_7Prime> Lazy<Tuple7<_1,_2,_3,_4,_5,_6,_7Prime>>` | Tuple7.`lazyZip(Lazy<? extends Applicative<Fn1<? super _7,? extends _7Prime>,Tuple7<_1,_2,_3,_4,_5,_6,?>>> 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 <_1,_2,_3,_4,_5,_6> Pure<Tuple7<_1,_2,_3,_4,_5,_6,?>>` | Tuple7.`pureTuple(_1 _1, _2 _2, _3 _3, _4 _4, _5 _5, _6 _6)` The canonical `Pure` instance for `Tuple7`.

    Method parameters in com.jnape.palatable.lambda.adt.hlist with type arguments of type Tuple7
    Modifier and Type | Method and Description
    --- | ---
    `<_7Prime> Tuple7<_1,_2,_3,_4,_5,_6,_7Prime>` | Tuple7.`discardL(Applicative<_7Prime,Tuple7<_1,_2,_3,_4,_5,_6,?>> appB)` Sequence both this `Applicative` and `appB`, discarding this `Applicative's` result and returning `appB`.
    `<_7Prime> Tuple7<_1,_2,_3,_4,_5,_6,_7>` | Tuple7.`discardR(Applicative<_7Prime,Tuple7<_1,_2,_3,_4,_5,_6,?>> appB)` Sequence both this `Applicative` and `appB`, discarding `appB's` result and returning this `Applicative`.
    `<_7Prime> Tuple7<_1,_2,_3,_4,_5,_6,_7Prime>` | Tuple7.`flatMap(Fn1<? super _7,? extends Monad<_7Prime,Tuple7<_1,_2,_3,_4,_5,_6,?>>> f)` Chain dependent computations that may continue or short-circuit based on previous results.
    `<_7Prime> Lazy<Tuple7<_1,_2,_3,_4,_5,_6,_7Prime>>` | Tuple7.`lazyZip(Lazy<? extends Applicative<Fn1<? super _7,? extends _7Prime>,Tuple7<_1,_2,_3,_4,_5,_6,?>>> 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.
    `<_7Prime> Tuple7<_1,_2,_3,_4,_5,_6,_7Prime>` | Tuple7.`trampolineM(Fn1<? super _7,? extends MonadRec<RecursiveResult<_7,_7Prime>,Tuple7<_1,_2,_3,_4,_5,_6,?>>> fn)` Given some operation yielding a `RecursiveResult` inside this `MonadRec`, internally trampoline the operation until it yields a `termination` instruction.
    `<_7Prime> Tuple7<_1,_2,_3,_4,_5,_6,_7Prime>` | Tuple7.`zip(Applicative<Fn1<? super _7,? extends _7Prime>,Tuple7<_1,_2,_3,_4,_5,_6,?>> appFn)` Given another instance of this applicative over a mapping function, "zip" the two instances together using whatever application semantics the current applicative supports.

  - ### Uses of Tuple7 in com.jnape.palatable.lambda.adt.hmap

    Methods in com.jnape.palatable.lambda.adt.hmap that return types with arguments of type Tuple7
    Modifier and Type | Method and Description
    --- | ---
    `static <A,B,C,D,E,F,G> Schema<Tuple7<A,B,C,D,E,F,G>>` | Schema.`schema(TypeSafeKey<?,A> aKey, TypeSafeKey<?,B> bKey, TypeSafeKey<?,C> cKey, TypeSafeKey<?,D> dKey, TypeSafeKey<?,E> eKey, TypeSafeKey<?,F> fKey, TypeSafeKey<?,G> gKey)` Create a `Schema` from seven `TypeSafeKeys`.