A
- The first argument typeB
- The second argument typeC
- The third argument typeD
- The fourth argument typeE
- The fifth argument typeF
- The sixth argument typeG
- The return type@FunctionalInterface public interface Fn6<A,B,C,D,E,F,G> extends Fn5<A,B,C,D,E,Fn1<F,G>>
Fn5
, so similarly auto-curried.Fn5
Modifier and Type | Method and Description |
---|---|
default Fn5<B,C,D,E,F,G> |
apply(A a)
Partially apply this function by taking its first argument.
|
default Fn4<C,D,E,F,G> |
apply(A a,
B b)
Partially apply this function by taking its first two arguments.
|
default Fn3<D,E,F,G> |
apply(A a,
B b,
C c)
Partially apply this function by taking its first three arguments.
|
default Fn2<E,F,G> |
apply(A a,
B b,
C c,
D d)
Partially apply this function by taking its first four arguments.
|
default Fn1<F,G> |
apply(A a,
B b,
C c,
D d,
E e)
Partially apply this function by taking its first five arguments.
|
default G |
apply(A a,
B b,
C c,
D d,
E e,
F f)
Invoke this function with the given arguments.
|
default Fn1<F,G> |
checkedApply(A a,
B b,
C c,
D d,
E e) |
G |
checkedApply(A a,
B b,
C c,
D d,
E e,
F f) |
default <Y,Z> Fn7<Y,Z,B,C,D,E,F,G> |
compose(Fn2<? super Y,? super Z,? extends A> before)
Right-to-left composition between different arity functions.
|
default <Z> Fn6<Z,B,C,D,E,F,G> |
contraMap(Fn1<? super Z,? extends A> fn)
Contravariantly map
A <- B . |
default <Z> Fn6<Z,B,C,D,E,F,G> |
diMapL(Fn1<? super Z,? extends A> fn)
Contravariantly map over the argument to this function, producing a function that takes the new argument type,
and produces the same result.
|
default <H> Fn6<A,B,C,D,E,F,G> |
discardR(Applicative<H,Fn1<A,?>> appB)
Sequence both this
Applicative and appB , discarding appB's result and
returning this Applicative . |
default Fn6<B,A,C,D,E,F,G> |
flip()
Flip the order of the first two arguments.
|
static <A,B,C,D,E,F,G> |
fn6(Fn1<A,Fn5<B,C,D,E,F,G>> curriedFn1)
|
static <A,B,C,D,E,F,G> |
fn6(Fn2<A,B,Fn4<C,D,E,F,G>> curriedFn2)
|
static <A,B,C,D,E,F,G> |
fn6(Fn3<A,B,C,Fn3<D,E,F,G>> curriedFn3)
|
static <A,B,C,D,E,F,G> |
fn6(Fn4<A,B,C,D,Fn2<E,F,G>> curriedFn4)
|
static <A,B,C,D,E,F,G> |
fn6(Fn5<A,B,C,D,E,Fn1<F,G>> curriedFn5)
|
static <A,B,C,D,E,F,G> |
fn6(Fn6<A,B,C,D,E,F,G> fn)
Static factory method for coercing a lambda to an
Fn6 . |
default Fn5<? super Product2<? extends A,? extends B>,C,D,E,F,G> |
uncurry()
|
default <Z> Fn7<Z,A,B,C,D,E,F,G> |
widen()
Widen this function's argument list by prepending an ignored argument of any type to the front.
|
checkedApply, fn5, fn5, fn5, fn5, fn5
checkedApply, fn4, fn4, fn4, fn4
checkedApply, fn3, fn3, fn3
checkedApply, curried, curry, fn2, fromBiFunction, toBiFunction
default G apply(A a, B b, C c, D d, E e, F f)
a
- the first argumentb
- the second argumentc
- the third argumentd
- the fourth argumente
- the fifth argumentf
- the sixth argumentdefault <Z> Fn7<Z,A,B,C,D,E,F,G> widen()
widen
in interface Fn1<A,Fn1<B,Fn1<C,Fn1<D,Fn1<E,Fn1<F,G>>>>>>
widen
in interface Fn2<A,B,Fn1<C,Fn1<D,Fn1<E,Fn1<F,G>>>>>
widen
in interface Fn3<A,B,C,Fn1<D,Fn1<E,Fn1<F,G>>>>
widen
in interface Fn4<A,B,C,D,Fn1<E,Fn1<F,G>>>
widen
in interface Fn5<A,B,C,D,E,Fn1<F,G>>
Z
- the new first argument typedefault Fn5<B,C,D,E,F,G> apply(A a)
apply
in interface Fn1<A,Fn1<B,Fn1<C,Fn1<D,Fn1<E,Fn1<F,G>>>>>>
apply
in interface Fn2<A,B,Fn1<C,Fn1<D,Fn1<E,Fn1<F,G>>>>>
apply
in interface Fn3<A,B,C,Fn1<D,Fn1<E,Fn1<F,G>>>>
apply
in interface Fn4<A,B,C,D,Fn1<E,Fn1<F,G>>>
apply
in interface Fn5<A,B,C,D,E,Fn1<F,G>>
a
- the first argumentFn5
that takes the remaining arguments and returns the resultdefault Fn4<C,D,E,F,G> apply(A a, B b)
apply
in interface Fn2<A,B,Fn1<C,Fn1<D,Fn1<E,Fn1<F,G>>>>>
apply
in interface Fn3<A,B,C,Fn1<D,Fn1<E,Fn1<F,G>>>>
apply
in interface Fn4<A,B,C,D,Fn1<E,Fn1<F,G>>>
apply
in interface Fn5<A,B,C,D,E,Fn1<F,G>>
a
- the first argumentb
- the second argumentFn4
that takes the remaining arguments and returns the resultdefault Fn3<D,E,F,G> apply(A a, B b, C c)
apply
in interface Fn3<A,B,C,Fn1<D,Fn1<E,Fn1<F,G>>>>
apply
in interface Fn4<A,B,C,D,Fn1<E,Fn1<F,G>>>
apply
in interface Fn5<A,B,C,D,E,Fn1<F,G>>
a
- the first argumentb
- the second argumentc
- the third argumentFn3
that takes remaining arguments and returns the resultdefault Fn2<E,F,G> apply(A a, B b, C c, D d)
default Fn1<F,G> apply(A a, B b, C c, D d, E e)
default Fn6<B,A,C,D,E,F,G> flip()
flip
in interface Fn2<A,B,Fn1<C,Fn1<D,Fn1<E,Fn1<F,G>>>>>
flip
in interface Fn3<A,B,C,Fn1<D,Fn1<E,Fn1<F,G>>>>
flip
in interface Fn4<A,B,C,D,Fn1<E,Fn1<F,G>>>
flip
in interface Fn5<A,B,C,D,E,Fn1<F,G>>
Fn6
that takes the first and second arguments in reversed orderdefault Fn5<? super Product2<? extends A,? extends B>,C,D,E,F,G> uncurry()
uncurry
in interface Fn2<A,B,Fn1<C,Fn1<D,Fn1<E,Fn1<F,G>>>>>
uncurry
in interface Fn3<A,B,C,Fn1<D,Fn1<E,Fn1<F,G>>>>
uncurry
in interface Fn4<A,B,C,D,Fn1<E,Fn1<F,G>>>
uncurry
in interface Fn5<A,B,C,D,E,Fn1<F,G>>
Fn5
taking a Product2
and the remaining argumentsdefault <H> Fn6<A,B,C,D,E,F,G> discardR(Applicative<H,Fn1<A,?>> appB)
Fn2
Applicative
and appB
, discarding appB's
result and
returning this Applicative
. This is generally useful for sequentially performing side-effects.discardR
in interface Applicative<Fn1<B,Fn1<C,Fn1<D,Fn1<E,Fn1<F,G>>>>>,Fn1<A,?>>
discardR
in interface Fn1<A,Fn1<B,Fn1<C,Fn1<D,Fn1<E,Fn1<F,G>>>>>>
discardR
in interface Fn2<A,B,Fn1<C,Fn1<D,Fn1<E,Fn1<F,G>>>>>
discardR
in interface Fn3<A,B,C,Fn1<D,Fn1<E,Fn1<F,G>>>>
discardR
in interface Fn4<A,B,C,D,Fn1<E,Fn1<F,G>>>
discardR
in interface Fn5<A,B,C,D,E,Fn1<F,G>>
discardR
in interface Monad<Fn1<B,Fn1<C,Fn1<D,Fn1<E,Fn1<F,G>>>>>,Fn1<A,?>>
discardR
in interface MonadReader<A,Fn1<B,Fn1<C,Fn1<D,Fn1<E,Fn1<F,G>>>>>,Fn1<A,?>>
discardR
in interface MonadRec<Fn1<B,Fn1<C,Fn1<D,Fn1<E,Fn1<F,G>>>>>,Fn1<A,?>>
discardR
in interface MonadWriter<A,Fn1<B,Fn1<C,Fn1<D,Fn1<E,Fn1<F,G>>>>>,Fn1<A,?>>
H
- the type of appB's parameterappB
- the other Applicativedefault <Z> Fn6<Z,B,C,D,E,F,G> diMapL(Fn1<? super Z,? extends A> fn)
Fn2
diMapL
in interface Cartesian<A,Fn1<B,Fn1<C,Fn1<D,Fn1<E,Fn1<F,G>>>>>,Fn1<?,?>>
diMapL
in interface Cocartesian<A,Fn1<B,Fn1<C,Fn1<D,Fn1<E,Fn1<F,G>>>>>,Fn1<?,?>>
diMapL
in interface Fn1<A,Fn1<B,Fn1<C,Fn1<D,Fn1<E,Fn1<F,G>>>>>>
diMapL
in interface Fn2<A,B,Fn1<C,Fn1<D,Fn1<E,Fn1<F,G>>>>>
diMapL
in interface Fn3<A,B,C,Fn1<D,Fn1<E,Fn1<F,G>>>>
diMapL
in interface Fn4<A,B,C,D,Fn1<E,Fn1<F,G>>>
diMapL
in interface Fn5<A,B,C,D,E,Fn1<F,G>>
diMapL
in interface Profunctor<A,Fn1<B,Fn1<C,Fn1<D,Fn1<E,Fn1<F,G>>>>>,Fn1<?,?>>
Z
- the new argument typefn
- the contravariant argument mapping functionFn1
<Z, B>default <Z> Fn6<Z,B,C,D,E,F,G> contraMap(Fn1<? super Z,? extends A> fn)
Fn2
A <- B
.contraMap
in interface Cartesian<A,Fn1<B,Fn1<C,Fn1<D,Fn1<E,Fn1<F,G>>>>>,Fn1<?,?>>
contraMap
in interface Cocartesian<A,Fn1<B,Fn1<C,Fn1<D,Fn1<E,Fn1<F,G>>>>>,Fn1<?,?>>
contraMap
in interface Contravariant<A,Profunctor<?,Fn1<B,Fn1<C,Fn1<D,Fn1<E,Fn1<F,G>>>>>,Fn1<?,?>>>
contraMap
in interface Fn1<A,Fn1<B,Fn1<C,Fn1<D,Fn1<E,Fn1<F,G>>>>>>
contraMap
in interface Fn2<A,B,Fn1<C,Fn1<D,Fn1<E,Fn1<F,G>>>>>
contraMap
in interface Fn3<A,B,C,Fn1<D,Fn1<E,Fn1<F,G>>>>
contraMap
in interface Fn4<A,B,C,D,Fn1<E,Fn1<F,G>>>
contraMap
in interface Fn5<A,B,C,D,E,Fn1<F,G>>
contraMap
in interface Profunctor<A,Fn1<B,Fn1<C,Fn1<D,Fn1<E,Fn1<F,G>>>>>,Fn1<?,?>>
Z
- the new parameter typefn
- the mapping functiondefault <Y,Z> Fn7<Y,Z,B,C,D,E,F,G> compose(Fn2<? super Y,? super Z,? extends A> before)
Fn2
compose
in interface Fn1<A,Fn1<B,Fn1<C,Fn1<D,Fn1<E,Fn1<F,G>>>>>>
compose
in interface Fn2<A,B,Fn1<C,Fn1<D,Fn1<E,Fn1<F,G>>>>>
compose
in interface Fn3<A,B,C,Fn1<D,Fn1<E,Fn1<F,G>>>>
compose
in interface Fn4<A,B,C,D,Fn1<E,Fn1<F,G>>>
compose
in interface Fn5<A,B,C,D,E,Fn1<F,G>>
Y
- the resulting function's first argument typeZ
- the resulting function's second argument typebefore
- the function to pass its return value to this function's inputFn2
<Y, Z, B>static <A,B,C,D,E,F,G> Fn6<A,B,C,D,E,F,G> fn6(Fn1<A,Fn5<B,C,D,E,F,G>> curriedFn1)
A
- the first input argument typeB
- the second input argument typeC
- the third input argument typeD
- the fourth input argument typeE
- the fifth input argument typeF
- the sixth input argument typeG
- the output typecurriedFn1
- the curried fn1 to adaptFn6
static <A,B,C,D,E,F,G> Fn6<A,B,C,D,E,F,G> fn6(Fn2<A,B,Fn4<C,D,E,F,G>> curriedFn2)
A
- the first input argument typeB
- the second input argument typeC
- the third input argument typeD
- the fourth input argument typeE
- the fifth input argument typeF
- the sixth input argument typeG
- the output typecurriedFn2
- the curried fn2 to adaptFn6
static <A,B,C,D,E,F,G> Fn6<A,B,C,D,E,F,G> fn6(Fn3<A,B,C,Fn3<D,E,F,G>> curriedFn3)
A
- the first input argument typeB
- the second input argument typeC
- the third input argument typeD
- the fourth input argument typeE
- the fifth input argument typeF
- the sixth input argument typeG
- the output typecurriedFn3
- the curried fn3 to adaptFn6
static <A,B,C,D,E,F,G> Fn6<A,B,C,D,E,F,G> fn6(Fn4<A,B,C,D,Fn2<E,F,G>> curriedFn4)
A
- the first input argument typeB
- the second input argument typeC
- the third input argument typeD
- the fourth input argument typeE
- the fifth input argument typeF
- the sixth input argument typeG
- the output typecurriedFn4
- the curried fn4 to adaptFn6
static <A,B,C,D,E,F,G> Fn6<A,B,C,D,E,F,G> fn6(Fn5<A,B,C,D,E,Fn1<F,G>> curriedFn5)
A
- the first input argument typeB
- the second input argument typeC
- the third input argument typeD
- the fourth input argument typeE
- the fifth input argument typeF
- the sixth input argument typeG
- the output typecurriedFn5
- the curried fn4 to adaptFn6
static <A,B,C,D,E,F,G> Fn6<A,B,C,D,E,F,G> fn6(Fn6<A,B,C,D,E,F,G> fn)
Fn6
.A
- the first input argument typeB
- the second input argument typeC
- the third input argument typeD
- the fourth input argument typeE
- the fifth input argument typeF
- the sixth input argument typeG
- the output typefn
- the lambda to coerceFn6