Uses of Class
com.jnape.palatable.lambda.adt.hlist.Tuple5
-
Packages that use Tuple5 Package Description com.jnape.palatable.lambda.adt.choice com.jnape.palatable.lambda.adt.hlist com.jnape.palatable.lambda.adt.hmap -
-
Uses of Tuple5 in com.jnape.palatable.lambda.adt.choice
Methods in com.jnape.palatable.lambda.adt.choice that return Tuple5 Modifier and Type Method Description Tuple5<Maybe<A>,Maybe<B>,Maybe<C>,Maybe<D>,Maybe<E>>
Choice5. project()
Specialize this choice's projection to aTuple5
. -
Uses of Tuple5 in com.jnape.palatable.lambda.adt.hlist
Methods in com.jnape.palatable.lambda.adt.hlist with type parameters of type Tuple5 Modifier and Type Method Description <_5Prime,App extends Applicative<?,App>,TravB extends Traversable<_5Prime,Tuple5<_1,_2,_3,_4,?>>,AppTrav extends Applicative<TravB,App>>
AppTravTuple5. traverse(Fn1<? super _5,? extends Applicative<_5Prime,App>> fn, Fn1<? super TravB,? extends AppTrav> pure)
Applyfn
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 Tuple5 Modifier and Type Method Description <_4Prime,_5Prime>
Tuple5<_1,_2,_3,_4Prime,_5Prime>Tuple5. 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>
Tuple5. biMapL(Fn1<? super _4,? extends _4Prime> fn)
Covariantly map over the left parameter.<_5Prime> Tuple5<_1,_2,_3,_4,_5Prime>
Tuple5. biMapR(Fn1<? super _5,? extends _5Prime> fn)
Covariantly map over the right parameter.<_0> Tuple5<_0,_1,_2,_3,_4>
Tuple4. cons(_0 _0)
Cons an element onto the front of this HList.<_5Prime> Tuple5<_1,_2,_3,_4,_5Prime>
Tuple5. discardL(Applicative<_5Prime,Tuple5<_1,_2,_3,_4,?>> appB)
Sequence both thisApplicative
andappB
, discarding thisApplicative's
result and returningappB
.<_5Prime> Tuple5<_1,_2,_3,_4,_5>
Tuple5. discardR(Applicative<_5Prime,Tuple5<_1,_2,_3,_4,?>> appB)
Sequence both thisApplicative
andappB
, discardingappB's
result and returning thisApplicative
.static <A> Tuple5<A,A,A,A,A>
Tuple5. fill(A a)
Given a value of typeA
, produced an instance of this tuple with each slot set to that value.<_5Prime> Tuple5<_1,_2,_3,_4,_5Prime>
Tuple5. 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>
Tuple5. fmap(Fn1<? super _5,? extends _5Prime> fn)
Covariantly transmute this functor's parameter using the given mapping function.Tuple5<_1,_2,_3,_4,_5>
Tuple6. init()
Tuple5<_2,_1,_3,_4,_5>
Tuple5. invert()
Rotate the first two slots of this product.<_5Prime> Tuple5<_1,_2,_3,_4,_5Prime>
Tuple5. pure(_5Prime _5Prime)
Lift the valueb
into this applicative functor.Tuple5<_2,_3,_1,_4,_5>
Tuple5. rotateL3()
Rotate the first three values of this product one slot to the left.Tuple5<_2,_3,_4,_1,_5>
Tuple5. rotateL4()
Rotate the first four values of this product one slot to the left.Tuple5<_2,_3,_4,_5,_1>
Tuple5. rotateL5()
Rotate the first five values of this product one slot to the left.Tuple5<_3,_1,_2,_4,_5>
Tuple5. rotateR3()
Rotate the first three values of this product one slot to the right.Tuple5<_4,_1,_2,_3,_5>
Tuple5. rotateR4()
Rotate the first four values of this product one slot to the right.Tuple5<_5,_1,_2,_3,_4>
Tuple5. rotateR5()
Rotate the first five values of this product one slot to the right.<_5> Tuple5<_1,_2,_3,_4,_5>
Tuple4. snoc(_5 _5)
Snoc an element onto the back of thisTuple4
.<_5Prime> Tuple5<_1,_2,_3,_4,_5Prime>
Tuple5. trampolineM(Fn1<? super _5,? extends MonadRec<RecursiveResult<_5,_5Prime>,Tuple5<_1,_2,_3,_4,?>>> fn)
Given some operation yielding aRecursiveResult
inside thisMonadRec
, internally trampoline the operation until it yields atermination
instruction.static <_1,_2,_3,_4,_5>
Tuple5<_1,_2,_3,_4,_5>HList. tuple(_1 _1, _2 _2, _3 _3, _4 _4, _5 _5)
Static factory method for creating a 5-element HList.<_5Prime> Tuple5<_1,_2,_3,_4,_5Prime>
Tuple5. 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.Methods in com.jnape.palatable.lambda.adt.hlist that return types with arguments of type Tuple5 Modifier and Type Method Description static <A> Maybe<Tuple5<A,A,A,A,A>>
Tuple5. fromIterable(java.lang.Iterable<A> as)
<_5Prime> Lazy<Tuple5<_1,_2,_3,_4,_5Prime>>
Tuple5. lazyZip(Lazy<? extends Applicative<Fn1<? super _5,? extends _5Prime>,Tuple5<_1,_2,_3,_4,?>>> lazyAppFn)
Given alazy
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>
Pure<Tuple5<_1,_2,_3,_4,?>>Tuple5. pureTuple(_1 _1, _2 _2, _3 _3, _4 _4)
Method parameters in com.jnape.palatable.lambda.adt.hlist with type arguments of type Tuple5 Modifier and Type Method Description <_5Prime> Tuple5<_1,_2,_3,_4,_5Prime>
Tuple5. discardL(Applicative<_5Prime,Tuple5<_1,_2,_3,_4,?>> appB)
Sequence both thisApplicative
andappB
, discarding thisApplicative's
result and returningappB
.<_5Prime> Tuple5<_1,_2,_3,_4,_5>
Tuple5. discardR(Applicative<_5Prime,Tuple5<_1,_2,_3,_4,?>> appB)
Sequence both thisApplicative
andappB
, discardingappB's
result and returning thisApplicative
.<_5Prime> Tuple5<_1,_2,_3,_4,_5Prime>
Tuple5. 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> Lazy<Tuple5<_1,_2,_3,_4,_5Prime>>
Tuple5. lazyZip(Lazy<? extends Applicative<Fn1<? super _5,? extends _5Prime>,Tuple5<_1,_2,_3,_4,?>>> lazyAppFn)
Given alazy
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>
Tuple5. trampolineM(Fn1<? super _5,? extends MonadRec<RecursiveResult<_5,_5Prime>,Tuple5<_1,_2,_3,_4,?>>> fn)
Given some operation yielding aRecursiveResult
inside thisMonadRec
, internally trampoline the operation until it yields atermination
instruction.<_5Prime> Tuple5<_1,_2,_3,_4,_5Prime>
Tuple5. 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.Constructors in com.jnape.palatable.lambda.adt.hlist with parameters of type Tuple5 Constructor Description Tuple6(_1 _1, Tuple5<_2,_3,_4,_5,_6> tail)
-
Uses of Tuple5 in com.jnape.palatable.lambda.adt.hmap
Methods in com.jnape.palatable.lambda.adt.hmap that return types with arguments of type Tuple5 Modifier and Type Method Description static <A,B,C,D,E>
Schema<Tuple5<A,B,C,D,E>>Schema. schema(TypeSafeKey<?,A> aKey, TypeSafeKey<?,B> bKey, TypeSafeKey<?,C> cKey, TypeSafeKey<?,D> dKey, TypeSafeKey<?,E> eKey)
Create aSchema
from fiveTypeSafeKeys
.
-