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