Package | Description |
---|---|
com.jnape.palatable.lambda.adt.choice | |
com.jnape.palatable.lambda.adt.hlist | |
com.jnape.palatable.lambda.adt.hmap |
Modifier and Type | Method and Description |
---|---|
Tuple6<Maybe<A>,Maybe<B>,Maybe<C>,Maybe<D>,Maybe<E>,Maybe<F>> |
Choice6.project()
Specialize this choice's projection to a
Tuple6 . |
Modifier and Type | Method and Description |
---|---|
<_6Prime,App extends Applicative<?,App>,TravB extends Traversable<_6Prime,Tuple6<_1,_2,_3,_4,_5,?>>,AppTrav extends Applicative<TravB,App>> |
Tuple6.traverse(Fn1<? super _6,? extends Applicative<_6Prime,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. |
Modifier and Type | Method and Description |
---|---|
<_5Prime,_6Prime> |
Tuple6.biMap(Fn1<? super _5,? extends _5Prime> lFn,
Fn1<? super _6,? extends _6Prime> rFn)
Dually map covariantly over both the left and right parameters.
|
<_5Prime> Tuple6<_1,_2,_3,_4,_5Prime,_6> |
Tuple6.biMapL(Fn1<? super _5,? extends _5Prime> fn)
Covariantly map over the left parameter.
|
<_6Prime> Tuple6<_1,_2,_3,_4,_5,_6Prime> |
Tuple6.biMapR(Fn1<? super _6,? extends _6Prime> fn)
Covariantly map over the right parameter.
|
<_0> Tuple6<_0,_1,_2,_3,_4,_5> |
Tuple5.cons(_0 _0)
Cons an element onto the front of this HList.
|
<_6Prime> Tuple6<_1,_2,_3,_4,_5,_6Prime> |
Tuple6.discardL(Applicative<_6Prime,Tuple6<_1,_2,_3,_4,_5,?>> appB)
Sequence both this
Applicative and appB , discarding this Applicative's
result and returning appB . |
<_6Prime> Tuple6<_1,_2,_3,_4,_5,_6> |
Tuple6.discardR(Applicative<_6Prime,Tuple6<_1,_2,_3,_4,_5,?>> appB)
Sequence both this
Applicative and appB , discarding appB's result and
returning this Applicative . |
static <A> Tuple6<A,A,A,A,A,A> |
Tuple6.fill(A a)
Given a value of type
A , produced an instance of this tuple with each slot set to that value. |
<_6Prime> Tuple6<_1,_2,_3,_4,_5,_6Prime> |
Tuple6.flatMap(Fn1<? super _6,? extends Monad<_6Prime,Tuple6<_1,_2,_3,_4,_5,?>>> f)
Chain dependent computations that may continue or short-circuit based on previous results.
|
<_6Prime> Tuple6<_1,_2,_3,_4,_5,_6Prime> |
Tuple6.fmap(Fn1<? super _6,? extends _6Prime> fn)
Covariantly transmute this functor's parameter using the given mapping function.
|
Tuple6<_2,_1,_3,_4,_5,_6> |
Tuple6.invert()
Rotate the first two slots of this product.
|
<_6Prime> Tuple6<_1,_2,_3,_4,_5,_6Prime> |
Tuple6.pure(_6Prime _6Prime)
Lift the value
b into this applicative functor. |
Tuple6<_2,_3,_1,_4,_5,_6> |
Tuple6.rotateL3()
Rotate the first three values of this product one slot to the left.
|
Tuple6<_2,_3,_4,_1,_5,_6> |
Tuple6.rotateL4()
Rotate the first four values of this product one slot to the left.
|
Tuple6<_2,_3,_4,_5,_1,_6> |
Tuple6.rotateL5()
Rotate the first five values of this product one slot to the left.
|
Tuple6<_2,_3,_4,_5,_6,_1> |
Tuple6.rotateL6()
Rotate the first six values of this product one slot to the left.
|
Tuple6<_3,_1,_2,_4,_5,_6> |
Tuple6.rotateR3()
Rotate the first three values of this product one slot to the right.
|
Tuple6<_4,_1,_2,_3,_5,_6> |
Tuple6.rotateR4()
Rotate the first four values of this product one slot to the right.
|
Tuple6<_5,_1,_2,_3,_4,_6> |
Tuple6.rotateR5()
Rotate the first five values of this product one slot to the right.
|
Tuple6<_6,_1,_2,_3,_4,_5> |
Tuple6.rotateR6()
Rotate the first six values of this product one slot to the right.
|
<_6Prime> Tuple6<_1,_2,_3,_4,_5,_6Prime> |
Tuple6.trampolineM(Fn1<? super _6,? extends MonadRec<RecursiveResult<_6,_6Prime>,Tuple6<_1,_2,_3,_4,_5,?>>> 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> |
HList.tuple(_1 _1,
_2 _2,
_3 _3,
_4 _4,
_5 _5,
_6 _6)
Static factory method for creating a 6-element HList.
|
<_6Prime> Tuple6<_1,_2,_3,_4,_5,_6Prime> |
Tuple6.zip(Applicative<Fn1<? super _6,? extends _6Prime>,Tuple6<_1,_2,_3,_4,_5,?>> appFn)
Given another instance of this applicative over a mapping function, "zip" the two instances together using
whatever application semantics the current applicative supports.
|
Modifier and Type | Method and Description |
---|---|
static <A> Maybe<Tuple6<A,A,A,A,A,A>> |
Tuple6.fromIterable(Iterable<A> as)
|
<_6Prime> Lazy<Tuple6<_1,_2,_3,_4,_5,_6Prime>> |
Tuple6.lazyZip(Lazy<? extends Applicative<Fn1<? super _6,? extends _6Prime>,Tuple6<_1,_2,_3,_4,_5,?>>> 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> |
Tuple6.pureTuple(_1 _1,
_2 _2,
_3 _3,
_4 _4,
_5 _5)
|
Modifier and Type | Method and Description |
---|---|
<_6Prime> Tuple6<_1,_2,_3,_4,_5,_6Prime> |
Tuple6.discardL(Applicative<_6Prime,Tuple6<_1,_2,_3,_4,_5,?>> appB)
Sequence both this
Applicative and appB , discarding this Applicative's
result and returning appB . |
<_6Prime> Tuple6<_1,_2,_3,_4,_5,_6> |
Tuple6.discardR(Applicative<_6Prime,Tuple6<_1,_2,_3,_4,_5,?>> appB)
Sequence both this
Applicative and appB , discarding appB's result and
returning this Applicative . |
<_6Prime> Tuple6<_1,_2,_3,_4,_5,_6Prime> |
Tuple6.flatMap(Fn1<? super _6,? extends Monad<_6Prime,Tuple6<_1,_2,_3,_4,_5,?>>> f)
Chain dependent computations that may continue or short-circuit based on previous results.
|
<_6Prime> Lazy<Tuple6<_1,_2,_3,_4,_5,_6Prime>> |
Tuple6.lazyZip(Lazy<? extends Applicative<Fn1<? super _6,? extends _6Prime>,Tuple6<_1,_2,_3,_4,_5,?>>> 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. |
<_6Prime> Tuple6<_1,_2,_3,_4,_5,_6Prime> |
Tuple6.trampolineM(Fn1<? super _6,? extends MonadRec<RecursiveResult<_6,_6Prime>,Tuple6<_1,_2,_3,_4,_5,?>>> fn)
Given some operation yielding a
RecursiveResult inside this MonadRec , internally trampoline the
operation until it yields a termination instruction. |
<_6Prime> Tuple6<_1,_2,_3,_4,_5,_6Prime> |
Tuple6.zip(Applicative<Fn1<? super _6,? extends _6Prime>,Tuple6<_1,_2,_3,_4,_5,?>> appFn)
Given another instance of this applicative over a mapping function, "zip" the two instances together using
whatever application semantics the current applicative supports.
|
Modifier and Type | Method and Description |
---|---|
static <A,B,C,D,E,F> |
Schema.schema(TypeSafeKey<?,A> aKey,
TypeSafeKey<?,B> bKey,
TypeSafeKey<?,C> cKey,
TypeSafeKey<?,D> dKey,
TypeSafeKey<?,E> eKey,
TypeSafeKey<?,F> fKey)
Create a
Schema from six TypeSafeKeys . |