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