_1 - The first slot element type_2 - The second slot element type_3 - The third slot element type_4 - The fourth slot element type_5 - The fifth slot element typepublic class Tuple5<_1,_2,_3,_4,_5> extends HList.HCons<_1,Tuple4<_2,_3,_4,_5>> implements Product5<_1,_2,_3,_4,_5>, MonadRec<_5,Tuple5<_1,_2,_3,_4,?>>, Bifunctor<_4,_5,Tuple5<_1,_2,_3,?,?>>, Traversable<_5,Tuple5<_1,_2,_3,_4,?>>
HList.HCons<Head,Tail extends HList>, HList.HNil| Modifier and Type | Method and Description |
|---|---|
_1 |
_1()
Retrieve the first element.
|
_2 |
_2()
Retrieve the second element.
|
_3 |
_3()
Retrieve the third element.
|
_4 |
_4()
Retrieve the fourth element.
|
_5 |
_5()
Retrieve the fifth element.
|
<_4Prime,_5Prime> |
biMap(Fn1<? super _4,? extends _4Prime> lFn,
Fn1<? super _5,? extends _5Prime> rFn)
Dually map covariantly over both the left and right parameters.
|
<_4Prime> Tuple5<_1,_2,_3,_4Prime,_5> |
biMapL(Fn1<? super _4,? extends _4Prime> fn)
Covariantly map over the left parameter.
|
<_5Prime> Tuple5<_1,_2,_3,_4,_5Prime> |
biMapR(Fn1<? super _5,? extends _5Prime> fn)
Covariantly map over the right parameter.
|
<_0> Tuple6<_0,_1,_2,_3,_4,_5> |
cons(_0 _0)
Cons an element onto the front of this HList.
|
<_5Prime> Tuple5<_1,_2,_3,_4,_5Prime> |
discardL(Applicative<_5Prime,Tuple5<_1,_2,_3,_4,?>> appB)
Sequence both this
Applicative and appB, discarding this Applicative's
result and returning appB. |
<_5Prime> Tuple5<_1,_2,_3,_4,_5> |
discardR(Applicative<_5Prime,Tuple5<_1,_2,_3,_4,?>> appB)
Sequence both this
Applicative and appB, discarding appB's result and
returning this Applicative. |
static <A> Tuple5<A,A,A,A,A> |
fill(A a)
Given a value of type
A, produced an instance of this tuple with each slot set to that value. |
<_5Prime> Tuple5<_1,_2,_3,_4,_5Prime> |
flatMap(Fn1<? super _5,? extends Monad<_5Prime,Tuple5<_1,_2,_3,_4,?>>> f)
Chain dependent computations that may continue or short-circuit based on previous results.
|
<_5Prime> Tuple5<_1,_2,_3,_4,_5Prime> |
fmap(Fn1<? super _5,? extends _5Prime> fn)
Covariantly transmute this functor's parameter using the given mapping function.
|
static <A> Maybe<Tuple5<A,A,A,A,A>> |
fromIterable(Iterable<A> as)
|
Tuple5<_2,_1,_3,_4,_5> |
invert()
Rotate the first two slots of this product.
|
<_5Prime> Lazy<Tuple5<_1,_2,_3,_4,_5Prime>> |
lazyZip(Lazy<? extends Applicative<Fn1<? super _5,? extends _5Prime>,Tuple5<_1,_2,_3,_4,?>>> 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. |
<_5Prime> Tuple5<_1,_2,_3,_4,_5Prime> |
pure(_5Prime _5Prime)
Lift the value
b into this applicative functor. |
static <_1,_2,_3,_4> |
pureTuple(_1 _1,
_2 _2,
_3 _3,
_4 _4)
|
Tuple5<_2,_3,_1,_4,_5> |
rotateL3()
Rotate the first three values of this product one slot to the left.
|
Tuple5<_2,_3,_4,_1,_5> |
rotateL4()
Rotate the first four values of this product one slot to the left.
|
Tuple5<_2,_3,_4,_5,_1> |
rotateL5()
Rotate the first five values of this product one slot to the left.
|
Tuple5<_3,_1,_2,_4,_5> |
rotateR3()
Rotate the first three values of this product one slot to the right.
|
Tuple5<_4,_1,_2,_3,_5> |
rotateR4()
Rotate the first four values of this product one slot to the right.
|
Tuple5<_5,_1,_2,_3,_4> |
rotateR5()
Rotate the first five values of this product one slot to the right.
|
<_5Prime> Tuple5<_1,_2,_3,_4,_5Prime> |
trampolineM(Fn1<? super _5,? extends MonadRec<RecursiveResult<_5,_5Prime>,Tuple5<_1,_2,_3,_4,?>>> fn)
Given some operation yielding a
RecursiveResult inside this MonadRec, internally trampoline the
operation until it yields a termination instruction. |
<_5Prime,App extends Applicative<?,App>,TravB extends Traversable<_5Prime,Tuple5<_1,_2,_3,_4,?>>,AppTrav extends Applicative<TravB,App>> |
traverse(Fn1<? super _5,? extends Applicative<_5Prime,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. |
<_5Prime> Tuple5<_1,_2,_3,_4,_5Prime> |
zip(Applicative<Fn1<? super _5,? extends _5Prime>,Tuple5<_1,_2,_3,_4,?>> appFn)
Given another instance of this applicative over a mapping function, "zip" the two instances together using
whatever application semantics the current applicative supports.
|
equals, hashCode, head, tailcons, nil, singletonHList, toString, tuple, tuple, tuple, tuple, tuple, tuple, tupleclone, equals, finalize, getClass, notify, notifyAll, wait, wait, waitgetKey, getValue, into, product, setValuecomparingByKey, comparingByKey, comparingByValue, comparingByValue, equals, hashCodepublic <_0> Tuple6<_0,_1,_2,_3,_4,_5> cons(_0 _0)
public _1 _1()
public _2 _2()
public _3 _3()
public _4 _4()
public _5 _5()
public Tuple5<_2,_3,_4,_5,_1> rotateL5()
public Tuple5<_5,_1,_2,_3,_4> rotateR5()
public Tuple5<_2,_3,_4,_1,_5> rotateL4()
public Tuple5<_4,_1,_2,_3,_5> rotateR4()
public Tuple5<_2,_3,_1,_4,_5> rotateL3()
public Tuple5<_3,_1,_2,_4,_5> rotateR3()
public <_5Prime> Tuple5<_1,_2,_3,_4,_5Prime> fmap(Fn1<? super _5,? extends _5Prime> fn)
fmap in interface Applicative<_5,Tuple5<_1,_2,_3,_4,?>>fmap in interface Functor<_5,Tuple5<_1,_2,_3,_4,?>>fmap in interface Monad<_5,Tuple5<_1,_2,_3,_4,?>>fmap in interface MonadRec<_5,Tuple5<_1,_2,_3,_4,?>>fmap in interface Traversable<_5,Tuple5<_1,_2,_3,_4,?>>_5Prime - the new parameter typefn - the mapping functionpublic <_4Prime> Tuple5<_1,_2,_3,_4Prime,_5> biMapL(Fn1<? super _4,? extends _4Prime> fn)
biMapL in interface Bifunctor<_4,_5,Tuple5<_1,_2,_3,?,?>>biMapL in interface BoundedBifunctor<_4,_5,Object,Object,Tuple5<_1,_2,_3,?,?>>_4Prime - the new left parameter typefn - the mapping functionpublic <_5Prime> Tuple5<_1,_2,_3,_4,_5Prime> biMapR(Fn1<? super _5,? extends _5Prime> fn)
biMapR(f) == fmap(f).biMapR in interface Bifunctor<_4,_5,Tuple5<_1,_2,_3,?,?>>biMapR in interface BoundedBifunctor<_4,_5,Object,Object,Tuple5<_1,_2,_3,?,?>>_5Prime - the new right parameter typefn - the mapping functionpublic <_4Prime,_5Prime> Tuple5<_1,_2,_3,_4Prime,_5Prime> biMap(Fn1<? super _4,? extends _4Prime> lFn, Fn1<? super _5,? extends _5Prime> rFn)
biMapL(lFn).biMapR(rFn).biMap in interface Bifunctor<_4,_5,Tuple5<_1,_2,_3,?,?>>biMap in interface BoundedBifunctor<_4,_5,Object,Object,Tuple5<_1,_2,_3,?,?>>_4Prime - the new left parameter type_5Prime - the new right parameter typelFn - the left parameter mapping functionrFn - the right parameter mapping functionpublic <_5Prime> Tuple5<_1,_2,_3,_4,_5Prime> pure(_5Prime _5Prime)
b into this applicative functor.pure in interface Applicative<_5,Tuple5<_1,_2,_3,_4,?>>pure in interface Monad<_5,Tuple5<_1,_2,_3,_4,?>>pure in interface MonadRec<_5,Tuple5<_1,_2,_3,_4,?>>_5Prime - the type of the returned applicative's parameter_5Prime - the valuepublic <_5Prime> Tuple5<_1,_2,_3,_4,_5Prime> zip(Applicative<Fn1<? super _5,? extends _5Prime>,Tuple5<_1,_2,_3,_4,?>> appFn)
zip in interface Applicative<_5,Tuple5<_1,_2,_3,_4,?>>zip in interface Monad<_5,Tuple5<_1,_2,_3,_4,?>>zip in interface MonadRec<_5,Tuple5<_1,_2,_3,_4,?>>_5Prime - the resulting applicative parameter typeappFn - the other applicative instancepublic <_5Prime> Lazy<Tuple5<_1,_2,_3,_4,_5Prime>> lazyZip(Lazy<? extends Applicative<Fn1<? super _5,? extends _5Prime>,Tuple5<_1,_2,_3,_4,?>>> lazyAppFn)
lazy instance of this applicative over a mapping function, "zip" the two instances together
using whatever application semantics the current applicative supports. This is useful for applicatives that
support lazy evaluation and early termination.lazyZip in interface Applicative<_5,Tuple5<_1,_2,_3,_4,?>>lazyZip in interface Monad<_5,Tuple5<_1,_2,_3,_4,?>>lazyZip in interface MonadRec<_5,Tuple5<_1,_2,_3,_4,?>>_5Prime - the resulting applicative parameter typelazyAppFn - the lazy other applicative instanceMaybe,
Eitherpublic <_5Prime> Tuple5<_1,_2,_3,_4,_5Prime> discardL(Applicative<_5Prime,Tuple5<_1,_2,_3,_4,?>> appB)
Applicative and appB, discarding this Applicative's
result and returning appB. This is generally useful for sequentially performing side-effects.discardL in interface Applicative<_5,Tuple5<_1,_2,_3,_4,?>>discardL in interface Monad<_5,Tuple5<_1,_2,_3,_4,?>>discardL in interface MonadRec<_5,Tuple5<_1,_2,_3,_4,?>>_5Prime - the type of the returned Applicative's parameterappB - the other Applicativepublic <_5Prime> Tuple5<_1,_2,_3,_4,_5> discardR(Applicative<_5Prime,Tuple5<_1,_2,_3,_4,?>> appB)
Applicative and appB, discarding appB's result and
returning this Applicative. This is generally useful for sequentially performing side-effects.discardR in interface Applicative<_5,Tuple5<_1,_2,_3,_4,?>>discardR in interface Monad<_5,Tuple5<_1,_2,_3,_4,?>>discardR in interface MonadRec<_5,Tuple5<_1,_2,_3,_4,?>>_5Prime - the type of appB's parameterappB - the other Applicativepublic <_5Prime> Tuple5<_1,_2,_3,_4,_5Prime> flatMap(Fn1<? super _5,? extends Monad<_5Prime,Tuple5<_1,_2,_3,_4,?>>> f)
public <_5Prime> Tuple5<_1,_2,_3,_4,_5Prime> trampolineM(Fn1<? super _5,? extends MonadRec<RecursiveResult<_5,_5Prime>,Tuple5<_1,_2,_3,_4,?>>> fn)
RecursiveResult inside this MonadRec, internally trampoline the
operation until it yields a termination instruction.
Stack-safety depends on implementations guaranteeing that the growth of the call stack is a constant factor independent of the number of invocations of the operation. For various examples of how this can be achieved in stereotypical circumstances, see the referenced types.
trampolineM in interface MonadRec<_5,Tuple5<_1,_2,_3,_4,?>>_5Prime - the ultimate resulting carrier typefn - the function to internally trampolineMonadRecfor a basic implementation,
for a {@link CoProduct2 coproduct} implementation,
for an implementation leveraging an already stack-safe {@link Monad#flatMap(Fn1)},
for a {@link MonadT monad transformer} implementationpublic <_5Prime,App extends Applicative<?,App>,TravB extends Traversable<_5Prime,Tuple5<_1,_2,_3,_4,?>>,AppTrav extends Applicative<TravB,App>> AppTrav traverse(Fn1<? super _5,? extends Applicative<_5Prime,App>> fn, Fn1<? super TravB,? extends AppTrav> pure)
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.traverse in interface Traversable<_5,Tuple5<_1,_2,_3,_4,?>>_5Prime - the resulting element typeApp - the result applicative typeTravB - this Traversable instance over BAppTrav - the full inferred resulting type from the traversalfn - the function to applypure - the applicative pure functionpublic static <A> Tuple5<A,A,A,A,A> fill(A a)
A, produced an instance of this tuple with each slot set to that value.A - the value typea - the value to fill the tuple withTuple2.fill(A)public static <_1,_2,_3,_4> Pure<Tuple5<_1,_2,_3,_4,?>> pureTuple(_1 _1, _2 _2, _3 _3, _4 _4)
_1 - the head element type_2 - the second element type_3 - the third element type_4 - the fourth element type_1 - the head element_2 - the second element_3 - the third element_4 - the fourth elementPure instance