Uses of Interface
fj.F
Packages that use F
Package
Description
Types that set the premise for the existence of Functional Java.
Functional control abstractions.
Abstractions for JDBC connections.
Parallelization strategies.
Common algebraic data types.
Provides 2-3 finger trees, a functional representation of persistent sequences supporting access to the ends in
amortized O(1) time.
Type-safe, extensible, heterogeneous lists
Optic data types adapted from the Scala Monocle library
and inspired by the
Haskell Lens library.
Fixed-length vectors
A prelude of commonly used first-class functions
Parser combinators.
-
Uses of F in fj
Modifier and TypeFieldDescriptionPrimitive.Boolean_Byte
A function that converts booleans to bytes.Primitive.Boolean_Character
A function that converts booleans to characters.Primitive.Boolean_Double
A function that converts booleans to doubles.Primitive.Boolean_Float
A function that converts booleans to floats.Primitive.Boolean_Integer
A function that converts booleans to integers.Primitive.Boolean_Long
A function that converts booleans to longs.Primitive.Boolean_Short
A function that converts booleans to shorts.Primitive.Byte_Boolean
A function that converts bytes to booleans.Primitive.Byte_Character
A function that converts bytes to characters.Primitive.Byte_Double
A function that converts bytes to doubles.Primitive.Byte_Float
A function that converts bytes to floats.Primitive.Byte_Integer
A function that converts bytes to integers.Primitive.Byte_Long
A function that converts bytes to longs.Primitive.Byte_Short
A function that converts bytes to shorts.Primitive.Character_Boolean
A function that converts characters to booleans.Primitive.Character_Byte
A function that converts characters to bytes.Primitive.Character_Double
A function that converts characters to doubles.Primitive.Character_Float
A function that converts characters to floats.Primitive.Character_Integer
A function that converts characters to integers.Primitive.Character_Long
A function that converts characters to longs.Primitive.Character_Short
A function that converts characters to shorts.Primitive.Double_Boolean
A function that converts doubles to booleans.Primitive.Double_Byte
A function that converts doubles to bytes.Primitive.Double_Character
A function that converts doubles to characters.Primitive.Double_Float
A function that converts doubles to floats.Primitive.Double_Integer
A function that converts doubles to integers.Primitive.Double_Long
A function that converts doubles to longs.Primitive.Double_Short
A function that converts doubles to shorts.Hash.f
Show.f
Primitive.Float_Boolean
A function that converts floats to booleans.Primitive.Float_Byte
A function that converts floats to bytes.Primitive.Float_Character
A function that converts floats to characters.Primitive.Float_Double
A function that converts floats to doubles.Primitive.Float_Integer
A function that converts floats to integers.Primitive.Float_Long
A function that converts floats to longs.Primitive.Float_Short
A function that converts floats to shorts.Digit.fromChar
First-class conversion from a character to a digit.Digit.fromLong
First-class conversion from a long to a digit.Primitive.Integer_Boolean
A function that converts integers to booleans.Primitive.Integer_Byte
A function that converts integers to bytes.Primitive.Integer_Character
A function that converts integers to characters.Primitive.Integer_Double
A function that converts integers to doubles.Primitive.Integer_Float
A function that converts integers to floats.Primitive.Integer_Long
A function that converts integers to longs.Primitive.Integer_Short
A function that converts integers to shorts.Primitive.Long_Boolean
A function that converts longs to booleans.Primitive.Long_Byte
A function that converts longs to bytes.Primitive.Long_Character
A function that converts longs to characters.Primitive.Long_Double
A function that converts longs to doubles.Primitive.Long_Float
A function that converts longs to floats.Primitive.Long_Integer
A function that converts longs to integers.Primitive.Long_Short
A function that converts longs to shorts.Ord.max
A function that returns the greater of its two arguments.Ord.min
A function that returns the lesser of its two arguments.Primitive.Short_Boolean
A function that converts shorts to booleans.Primitive.Short_Byte
A function that converts shorts to bytes.Primitive.Short_Character
A function that converts shorts to characters.Primitive.Short_Double
A function that converts shorts to doubles.Primitive.Short_Float
A function that converts shorts to floats.Primitive.Short_Integer
A function that converts shorts to integers.Primitive.Short_Long
A function that converts shorts to longs.Digit.toChar
First-class conversion from a digit to a character.Digit.toLong
First-class conversion from digit to a long.Modifier and TypeFieldDescriptionOrd.max
A function that returns the greater of its two arguments.Ord.min
A function that returns the lesser of its two arguments.Modifier and TypeMethodDescriptionP1.__1()
Returns a function that returns the first element of a product.P2.__1()
Returns a function that returns the first element of a product.P3.__1()
Returns a function that returns the first element of a product.P4.__1()
Returns a function that returns the first element of a product.P5.__1()
Returns a function that returns the first element of a product.P6.__1()
Returns a function that returns the first element of a product.P7.__1()
Returns a function that returns the first element of a product.P8.__1()
Returns a function that returns the first element of a product.P2.__2()
Returns a function that returns the second element of a product.P3.__2()
Returns a function that returns the second element of a product.P4.__2()
Returns a function that returns the second element of a product.P5.__2()
Returns a function that returns the second element of a product.P6.__2()
Returns a function that returns the second element of a product.P7.__2()
Returns a function that returns the second element of a product.P8.__2()
Returns a function that returns the second element of a product.P3.__3()
Returns a function that returns the third element of a product.P4.__3()
Returns a function that returns the third element of a product.P5.__3()
Returns a function that returns the third element of a product.P6.__3()
Returns a function that returns the third element of a product.P7.__3()
Returns a function that returns the third element of a product.P8.__3()
Returns a function that returns the third element of a product.P4.__4()
Returns a function that returns the fourth element of a product.P5.__4()
Returns a function that returns the fourth element of a product.P6.__4()
Returns a function that returns the fourth element of a product.P7.__4()
Returns a function that returns the fourth element of a product.P8.__4()
Returns a function that returns the fourth element of a product.P5.__5()
Returns a function that returns the fifth element of a product.P6.__5()
Returns a function that returns the fifth element of a product.P7.__5()
Returns a function that returns the fifth element of a product.P8.__5()
Returns a function that returns the fifth element of a product.P6.__6()
Returns a function that returns the sixth element of a product.P7.__6()
Returns a function that returns the sixth element of a product.P8.__6()
Returns a function that returns the sixth element of a product.P7.__7()
Returns a function that returns the seventh element of a product.P8.__7()
Returns a function that returns the seventh element of a product.P8.__8()
Returns a function that returns the eighth element of a product.F.andThen()
First-class composition flipped.Function composition flipped.Function.andThen()
Function composition flipped.static <A,
B, C> F <A, C> Function composition flipped.F.apply()
First-class function application in an environment.Function application in an environment (Applicative Functor).Function.apply
(A a) Function application with the arguments flipped.static <A,
B, C> F <C, B> Performs function application within a higher-order function (applicative functor pattern).static <A,
B, C> F <C, B> Performs function application within a higher-order function (applicative functor pattern).F.arrayK()
Promotes this function so that it returns its result in a Array.F.bind()
First-class function binding.Binds a given function across this function (Reader Monad).static <A,
B, C> F <C, B> Binds the function in the second argument to the function in the first argument.static <A,
B, C, D>
F<D, C> Binds the given function f to the values of the given functions, with a final join.Ord.compare()
First-class ordering.Function.compose()
Function composition.static <A,
B, C> F <A, C> Function composition.Function composition.Function.constant()
Returns a function that given an argument, returns a function that ignores its argument.static <A,
B> F <A, B> Function.constant
(B b) Returns a function that ignores its argument to constantly produce the given value.P1.constant()
Returns a constant function that always uses this value.F.contramapActor()
Returns a function that contramaps over a given actor.F.contramapEqual()
Promotes this function to map over an Equal as a contravariant functor.F.contramapHash()
Promotes this function to map over a Hash as a contravariant functor.F.contramapShow()
Promotes this function to map over a Show as a contravariant functor.F2.curry()
Curries this wrapped function to a wrapped function of arity-1 that returns another wrapped function.Curry a function of arity-2.static <A,
B, C> F <B, C> Curry a function of arity-2.Curry a function of arity-3.Curry a function of arity-3.static <A,
B, C, D>
F<C, D> Curry a function of arity-3.Curry a function of arity-4.Curry a function of arity-4.Curry a function of arity-4.static <A,
B, C, D, E>
F<D, E> Curry a function of arity-4.Curry a function of arity-5.Curry a function of arity-5.Curry a function of arity-5.Curry a function of arity-5.static <A,
B, C, D, E, F$>
F<E, F$> Curry a function of arity-5.Curry a function of arity-6.Curry a function of arity-7.Curry a function of arity-7.Curry a function of arity-7.Curry a function of arity-7.Curry a function of arity-7.Curry a function of arity-7.static <A,
B, C, D, E, F$, G, H>
F<G, H> Curry a function of arity-7.Curry a function of arity-8.Curry a function of arity-8.Curry a function of arity-8.Curry a function of arity-8.Curry a function of arity-8.Curry a function of arity-8.Curry a function of arity-8.static <A,
B, C, D, E, F$, G, H, I>
F<H, I> Curry a function of arity-7.Promotes the given function so that it returns its value in a P1.default <C,
D> F <C, D> Both map (with g) and contramap (with f) the target function.F.eitherLeftK()
Promotes this function so that it returns its result on the left side of an Either.F.eitherRightK()
Promotes this function so that it returns its result on the right side of an Either.Bottom.eMessage()
A function that returns thegetMessage
for a throwable.Partially applied equality check.static <A,
B> F <A, B> Provides a function that throws an error using the given message, ignoring its argument.Bottom.eToString()
A function that returns thetoString
for a throwable.Returns a function for the given effect.Partial application.static <A,
B, E extends Exception>
F<A, Validation<E, B>> Promotes the Try1 to a Validation that returns an Exception on the failure side and its result on the success side.static <A,
Z extends Exception>
F<A, Validation<Z, Unit>> TryEffect.f
(TryEffect1<A, Z> t) default <C> F
<A, Validation<B, C>> F.failK()
Promotes this function so that it returns its result on the failure side of a Validation.Function.flip()
Function argument flipping.Function argument flipping.Function.flip2()
Function argument flipping.F.foldMapTree
(Monoid<B> m) Returns a function that maps this function over a tree and folds it with the given monoid.static <A> F
<A, A> Function.identity()
The identity transformation.Ord.isGreaterThan
(A a) Returns a function that returns true if its argument is greater than than the argument to this method.Ord.isLessThan
(A a) Returns a function that returns true if its argument is less than the argument to this method.F.iterableK()
Promotes this function to return its value in an Iterable.static <A,
B> F <B, A> Joins two arguments of a function of arity-2 into one argument, yielding a function of arity-1.F.lazy()
Promotes this function so that it returns its result in a product-1.Promotes a function of arity-2 to a higher-order function.Promotes a function of arity-2 to a function on P1s.F.listK()
Promotes this function so that it returns its result in a List.Promote any function to a transformation between P1s.Promotes a function so that it maps the first element of a product.Promotes a function so that it maps the second element of a product.F.mapArray()
Promotes this function to map over a Array.F.mapBoth()
Promotes this function to map over both elements of a pair.default <X> F
<Validation<A, X>, Validation<B, X>> F.mapFail()
Promotes this function to map over the failure side of a Validation.F.mapFst()
Promotes this function to map over the first element of a pair.F.mapIterable()
Promotes this function to map over Iterables.F.mapLeft()
Promotes this function to map over the left side of an Either.F.mapList()
Promotes this function to map over a List.default F
<NonEmptyList<A>, NonEmptyList<B>> F.mapNel()
Promotes this function to map over a NonEmptyList.F.mapOption()
Promotes this function to map over an optional value.F.mapP1()
Promotes this function to map over a product-1.F.mapPromise()
Promotes this function to map over a Promise.F.mapRight()
Promotes this function to map over the right side of an Either.Promotes this function to map over a Set.F.mapSnd()
Promotes this function to map over the second element of a pair.F.mapStream()
Promotes this function to map over a Stream.default <X> F
<Validation<X, A>, Validation<X, B>> F.mapSuccess()
Promotes this function to map over the success side of a Validation.F.mapTree()
Promotes this function to map over a Tree.default F
<TreeZipper<A>, TreeZipper<B>> F.mapTreeZipper()
Promotes this function to map over a TreeZipper.F.mapZipper()
Promotes this function to map over a Zipper.default F
<A, NonEmptyList<B>> F.nelK()
Promotes this function to return its value in a NonEmptyList.Return a function that inspects the argument of the given function for anull
value and if so, does not apply the value, instead returning an empty optional value.F.o()
First-class function compositionFunction compositionF.on()
Applies this function over the arguments of another function.Applies this function over the arguments of another function.Applies a given function over the arguments of another function of arity-2.default F
<Validation<B, A>, B> F.onFail()
Returns a function that returns the failure side of a given Validation, or this function applied to the success side.F.onLeft()
Returns a function that returns the left side of a given Either, or this function applied to the right side.F.onRight()
Returns a function that returns the right side of a given Either, or this function applied to the left side.default F
<Validation<A, B>, B> F.onSuccess()
Returns a function that returns the success side of a given Validation, or this function applied to the failure side.F.optionK()
Promotes this function so that it returns its result in an Option.P.p1()
A function that puts an element in a product-1.P.p2()
A function that puts an element in a product-2.P.p3()
A function that puts elements in a product-3.P.p4()
A function that puts an element in a product-4.P.p5()
A function that puts an element in a product-5.P.p6()
A function that puts an element in a product-6.P.p7()
A function that puts an element in a product-7.P.p8()
A function that puts an element in a product-8.static <A,
B, C> F <A, C> Function.partialApply2
(F<A, F<B, C>> f, B b) Partial application of the second argument to the supplied function to get a function of typeA -> C
.Function.partialApply3
(F<A, F<B, F<C, D>>> f, C c) Partial application of the third argument to the supplied function to get a function of typeA -> B -> D
.Function.partialApply4
(F<A, F<B, F<C, F<D, E>>>> f, D d) Partial application of the fourth argument to the supplied function to get a function of typeA -> B -> C -> E
.Partial application of the fifth argument to the supplied function to get a function of typeA -> B -> C -> D -> F$
.Partial application of the sixth argument to the supplied function to get a function of typeA -> B -> C -> D -> E -> G
.Partial application of the seventh argument to the supplied function to get a function of typeA -> B -> C -> D -> E -> F$ -> H
.Partial application of the eigth argument to the supplied function to get a function of typeA -> B -> C -> D -> E -> F$ -> G -> I
.Promotes this function to a concurrent function that returns a Promise of a value.P1.sequenceList()
A first-class version of the sequence method for lists of P1s.Promotes this function to return its value in a Set.Show.show_()
Returns the transformation equivalent to this show.Show.showS_()
Returns the transformation equivalent to this show.A first-class version of the split function.F.streamK()
Promotes this function so that it returns its result in a Stream.Show.streamShow_
(Show<A> sa, String start, String sep, String end) Returns the transformation equivalent for the stream show.default <C> F
<A, Validation<C, B>> F.successK()
Promotes this function so that it returns its result on the success side of an Validation.Monoid.sum()
Returns a function that sums according to this monoid.Returns a function that sums the given value according to this monoid.Semigroup.sum()
Returns a function that sums according to this semigroup.Returns a function that sums the given value according to this semigroup.Monoid.sumLeft()
Returns a function that sums the given values with left-fold.Monoid.sumLeftS()
Returns a function that sums the given values with left-fold.Monoid.sumRight()
Returns a function that sums the given values with right-fold.P2.swap_()
Returns a curried form ofP2.swap()
.F.treeK()
Promotes this function to return its value in a Tree.default F
<A, TreeZipper<B>> F.treeZipperK()
Promotes this function to return its value in a TreeZipper.F2.tuple()
Uncurries this function to a function on tuples.Transforms a curried function of arity-2 to a function of a product-2Transforms an uncurried function of arity-2 to a function of a product-2Function.uncurryF2()
Uncurry a function of arity-2.Function.uncurryF3()
Uncurry a function of arity-3.Function.uncurryF4()
Uncurry a function of arity-4.Function.uncurryF5()
Uncurry a function of arity-5.Function.uncurryF6()
Uncurry a function of arity-6.Function.uncurryF7()
Uncurry a function of arity-7.static <A,
B, C, D, E, F$, G, H, I>
F<F<A, F<B, F<C, F<D, F<E, F<F$, F<G, F<H, I>>>>>>>>, F8<A, B, C, D, E, F$, G, H, I>> Function.uncurryF8()
Uncurry a function of arity-8.Function.vary()
Simultaneously covaries and contravaries a function.static <A,
B> F <A, B> Simultaneously covaries and contravaries a function.F.zipperK()
Promotes this function to return its value in a Zipper.Modifier and TypeMethodDescriptionF.andThen()
First-class composition flipped.F.andThen()
First-class composition flipped.Function.andThen()
Function composition flipped.Function.andThen()
Function composition flipped.Function.andThen()
Function composition flipped.Function.andThen()
Function composition flipped.F.apply()
First-class function application in an environment.F.apply()
First-class function application in an environment.F.apply()
First-class function application in an environment.Function.apply
(A a) Function application with the arguments flipped.F.bind()
First-class function binding.F.bind()
First-class function binding.F.bind()
First-class function binding.Ord.compare()
First-class ordering.Function.compose()
Function composition.Function.compose()
Function composition.Function.compose()
Function composition.Function.compose()
Function composition.Function composition.Function.constant()
Returns a function that given an argument, returns a function that ignores its argument.F2.curry()
Curries this wrapped function to a wrapped function of arity-1 that returns another wrapped function.Curry a function of arity-2.Curry a function of arity-3.Curry a function of arity-3.Curry a function of arity-3.Curry a function of arity-4.Curry a function of arity-4.Curry a function of arity-4.Curry a function of arity-4.Curry a function of arity-4.Curry a function of arity-4.Curry a function of arity-5.Curry a function of arity-5.Curry a function of arity-5.Curry a function of arity-5.Curry a function of arity-5.Curry a function of arity-5.Curry a function of arity-5.Curry a function of arity-5.Curry a function of arity-5.Curry a function of arity-5.Curry a function of arity-6.Curry a function of arity-6.Curry a function of arity-6.Curry a function of arity-6.Curry a function of arity-6.Curry a function of arity-7.Curry a function of arity-7.Curry a function of arity-7.Curry a function of arity-7.Curry a function of arity-7.Curry a function of arity-7.Curry a function of arity-7.Curry a function of arity-7.Curry a function of arity-7.Curry a function of arity-7.Curry a function of arity-7.Curry a function of arity-7.Curry a function of arity-7.Curry a function of arity-7.Curry a function of arity-7.Curry a function of arity-7.Curry a function of arity-7.Curry a function of arity-7.Curry a function of arity-7.Curry a function of arity-7.Curry a function of arity-7.Curry a function of arity-8.Curry a function of arity-8.Curry a function of arity-8.Curry a function of arity-8.Curry a function of arity-8.Curry a function of arity-8.Curry a function of arity-8.Curry a function of arity-8.Curry a function of arity-8.Curry a function of arity-8.Curry a function of arity-8.Curry a function of arity-8.Curry a function of arity-8.Curry a function of arity-8.Curry a function of arity-8.Curry a function of arity-8.Curry a function of arity-8.Curry a function of arity-8.Curry a function of arity-8.Curry a function of arity-8.Curry a function of arity-8.Curry a function of arity-8.Curry a function of arity-8.Curry a function of arity-8.Curry a function of arity-8.Curry a function of arity-8.Curry a function of arity-8.Curry a function of arity-8.Function.flip()
Function argument flipping.Function.flip()
Function argument flipping.Function.flip()
Function argument flipping.Function.flip()
Function argument flipping.Function argument flipping.Monoid.functionMonoid
(Monoid<B> mb) A monoid for functions.Semigroup.functionSemigroup
(Semigroup<B> sb) A semigroup for functions.Promotes a function of arity-2 to a higher-order function.Promotes a function of arity-2 to a higher-order function.Promotes a function of arity-2 to a higher-order function.Promotes a function of arity-2 to a higher-order function.Promotes a function of arity-2 to a function on P1s.F.o()
First-class function compositionF.o()
First-class function compositionF.on()
Applies this function over the arguments of another function.F.on()
Applies this function over the arguments of another function.F.on()
Applies this function over the arguments of another function.F.on()
Applies this function over the arguments of another function.Applies this function over the arguments of another function.Applies a given function over the arguments of another function of arity-2.P.p2()
A function that puts an element in a product-2.P.p3()
A function that puts elements in a product-3.P.p3()
A function that puts elements in a product-3.P.p4()
A function that puts an element in a product-4.P.p4()
A function that puts an element in a product-4.P.p4()
A function that puts an element in a product-4.P.p5()
A function that puts an element in a product-5.P.p5()
A function that puts an element in a product-5.P.p5()
A function that puts an element in a product-5.P.p5()
A function that puts an element in a product-5.P.p6()
A function that puts an element in a product-6.P.p6()
A function that puts an element in a product-6.P.p6()
A function that puts an element in a product-6.P.p6()
A function that puts an element in a product-6.P.p6()
A function that puts an element in a product-6.P.p7()
A function that puts an element in a product-7.P.p7()
A function that puts an element in a product-7.P.p7()
A function that puts an element in a product-7.P.p7()
A function that puts an element in a product-7.P.p7()
A function that puts an element in a product-7.P.p7()
A function that puts an element in a product-7.P.p8()
A function that puts an element in a product-8.P.p8()
A function that puts an element in a product-8.P.p8()
A function that puts an element in a product-8.P.p8()
A function that puts an element in a product-8.P.p8()
A function that puts an element in a product-8.P.p8()
A function that puts an element in a product-8.P.p8()
A function that puts an element in a product-8.Function.partialApply3
(F<A, F<B, F<C, D>>> f, C c) Partial application of the third argument to the supplied function to get a function of typeA -> B -> D
.Function.partialApply4
(F<A, F<B, F<C, F<D, E>>>> f, D d) Partial application of the fourth argument to the supplied function to get a function of typeA -> B -> C -> E
.Function.partialApply4
(F<A, F<B, F<C, F<D, E>>>> f, D d) Partial application of the fourth argument to the supplied function to get a function of typeA -> B -> C -> E
.Partial application of the fifth argument to the supplied function to get a function of typeA -> B -> C -> D -> F$
.Partial application of the fifth argument to the supplied function to get a function of typeA -> B -> C -> D -> F$
.Partial application of the fifth argument to the supplied function to get a function of typeA -> B -> C -> D -> F$
.Partial application of the sixth argument to the supplied function to get a function of typeA -> B -> C -> D -> E -> G
.Partial application of the sixth argument to the supplied function to get a function of typeA -> B -> C -> D -> E -> G
.Partial application of the sixth argument to the supplied function to get a function of typeA -> B -> C -> D -> E -> G
.Partial application of the sixth argument to the supplied function to get a function of typeA -> B -> C -> D -> E -> G
.Partial application of the seventh argument to the supplied function to get a function of typeA -> B -> C -> D -> E -> F$ -> H
.Partial application of the seventh argument to the supplied function to get a function of typeA -> B -> C -> D -> E -> F$ -> H
.Partial application of the seventh argument to the supplied function to get a function of typeA -> B -> C -> D -> E -> F$ -> H
.Partial application of the seventh argument to the supplied function to get a function of typeA -> B -> C -> D -> E -> F$ -> H
.Partial application of the seventh argument to the supplied function to get a function of typeA -> B -> C -> D -> E -> F$ -> H
.Partial application of the eigth argument to the supplied function to get a function of typeA -> B -> C -> D -> E -> F$ -> G -> I
.Partial application of the eigth argument to the supplied function to get a function of typeA -> B -> C -> D -> E -> F$ -> G -> I
.Partial application of the eigth argument to the supplied function to get a function of typeA -> B -> C -> D -> E -> F$ -> G -> I
.Partial application of the eigth argument to the supplied function to get a function of typeA -> B -> C -> D -> E -> F$ -> G -> I
.Partial application of the eigth argument to the supplied function to get a function of typeA -> B -> C -> D -> E -> F$ -> G -> I
.Partial application of the eigth argument to the supplied function to get a function of typeA -> B -> C -> D -> E -> F$ -> G -> I
.Monoid.sum()
Returns a function that sums according to this monoid.Semigroup.sum()
Returns a function that sums according to this semigroup.Function.uncurryF2()
Uncurry a function of arity-2.Function.uncurryF2()
Uncurry a function of arity-2.Function.uncurryF3()
Uncurry a function of arity-3.Function.uncurryF3()
Uncurry a function of arity-3.Function.uncurryF3()
Uncurry a function of arity-3.Function.uncurryF4()
Uncurry a function of arity-4.Function.uncurryF4()
Uncurry a function of arity-4.Function.uncurryF4()
Uncurry a function of arity-4.Function.uncurryF4()
Uncurry a function of arity-4.Function.uncurryF5()
Uncurry a function of arity-5.Function.uncurryF5()
Uncurry a function of arity-5.Function.uncurryF5()
Uncurry a function of arity-5.Function.uncurryF5()
Uncurry a function of arity-5.Function.uncurryF5()
Uncurry a function of arity-5.Function.uncurryF6()
Uncurry a function of arity-6.Function.uncurryF6()
Uncurry a function of arity-6.Function.uncurryF6()
Uncurry a function of arity-6.Function.uncurryF6()
Uncurry a function of arity-6.Function.uncurryF6()
Uncurry a function of arity-6.Function.uncurryF6()
Uncurry a function of arity-6.Function.uncurryF7()
Uncurry a function of arity-7.Function.uncurryF7()
Uncurry a function of arity-7.Function.uncurryF7()
Uncurry a function of arity-7.Function.uncurryF7()
Uncurry a function of arity-7.Function.uncurryF7()
Uncurry a function of arity-7.Function.uncurryF7()
Uncurry a function of arity-7.Function.uncurryF7()
Uncurry a function of arity-7.static <A,
B, C, D, E, F$, G, H, I>
F<F<A, F<B, F<C, F<D, F<E, F<F$, F<G, F<H, I>>>>>>>>, F8<A, B, C, D, E, F$, G, H, I>> Function.uncurryF8()
Uncurry a function of arity-8.static <A,
B, C, D, E, F$, G, H, I>
F<F<A, F<B, F<C, F<D, F<E, F<F$, F<G, F<H, I>>>>>>>>, F8<A, B, C, D, E, F$, G, H, I>> Function.uncurryF8()
Uncurry a function of arity-8.static <A,
B, C, D, E, F$, G, H, I>
F<F<A, F<B, F<C, F<D, F<E, F<F$, F<G, F<H, I>>>>>>>>, F8<A, B, C, D, E, F$, G, H, I>> Function.uncurryF8()
Uncurry a function of arity-8.static <A,
B, C, D, E, F$, G, H, I>
F<F<A, F<B, F<C, F<D, F<E, F<F$, F<G, F<H, I>>>>>>>>, F8<A, B, C, D, E, F$, G, H, I>> Function.uncurryF8()
Uncurry a function of arity-8.static <A,
B, C, D, E, F$, G, H, I>
F<F<A, F<B, F<C, F<D, F<E, F<F$, F<G, F<H, I>>>>>>>>, F8<A, B, C, D, E, F$, G, H, I>> Function.uncurryF8()
Uncurry a function of arity-8.static <A,
B, C, D, E, F$, G, H, I>
F<F<A, F<B, F<C, F<D, F<E, F<F$, F<G, F<H, I>>>>>>>>, F8<A, B, C, D, E, F$, G, H, I>> Function.uncurryF8()
Uncurry a function of arity-8.static <A,
B, C, D, E, F$, G, H, I>
F<F<A, F<B, F<C, F<D, F<E, F<F$, F<G, F<H, I>>>>>>>>, F8<A, B, C, D, E, F$, G, H, I>> Function.uncurryF8()
Uncurry a function of arity-8.static <A,
B, C, D, E, F$, G, H, I>
F<F<A, F<B, F<C, F<D, F<E, F<F$, F<G, F<H, I>>>>>>>>, F8<A, B, C, D, E, F$, G, H, I>> Function.uncurryF8()
Uncurry a function of arity-8.Function.vary()
Simultaneously covaries and contravaries a function.Function.vary()
Simultaneously covaries and contravaries a function.Modifier and TypeMethodDescriptionFunction composition flipped.static <A,
B, C> F <A, C> Function composition flipped.Function application in an environment (Applicative Functor).static <A,
B, C> F <C, B> Performs function application within a higher-order function (applicative functor pattern).static <A,
B, C> F <C, B> Performs function application within a higher-order function (applicative functor pattern).Binds a given function across this function (Reader Monad).static <A,
B, C> F <C, B> Binds the function in the second argument to the function in the first argument.static <A,
B, C, D>
F<D, C> Binds the given function f to the values of the given functions, with a final join.final <B> P1
<B> Binds the given function to the value in a product-1 with a final join.final <B,
C> P1 <C> Binds the given function to the values in the given P1s with a final join.Duplicates this product on the first element, and maps the given function across the duplicate (Comonad pattern).static <A,
B, C> F <A, C> Function composition.<B,
C> Monoid <C> <B,
C> Semigroup <C> Function composition.static <A,
B> Effect1 <B> A contra-variant functor on effect.static <A,
B> Equal <A> Static version ofEqual.contramap(F)
<B> Equal
<B> Maps the given function across this equal as a contra-variant functor.<B> Hash
<B> Maps the given function across this hash as a contra-variant functor.static <A,
B> Ord <A> Static version ofOrd.contramap(F)
<B> Ord
<B> Maps the given function across this ord as a contra-variant functor.<B> Show
<B> Maps the given function across this show as a contra-variant functor.private static <A,
B> Equal.Definition <B> Equal.contramapDef
(F<B, A> f, Equal.Definition<A> aEqDef) private static <A,
B> Ord.Definition <B> Ord.contramapDef
(F<B, A> f, Ord.Definition<A> def) F2.contramapFirst
(F<Z, A> f) F2.contramapSecond
(F<Z, B> f) Promotes the given function so that it returns its value in a P1.default <C,
D> F <C, D> Both map (with g) and contramap (with f) the target function.static <A> Equal
<A> Constructs an equal instance from the given function.static <B,
C, D> P2 <C, D> Sends the given input value to both argument functions and combines their output.Function argument flipping.static <A> Hash
<A> Construct a hash with the given hash function.static <A,
B> F <B, A> Joins two arguments of a function of arity-2 into one argument, yielding a function of arity-1.static <A> Effect1
<A> static <A> P1
<A> static <A,
B> P2 <A, B> static <A,
B, C> P3 <A, B, C> static <A,
B, C, D>
P4<A, B, C, D> static <A,
B, C, D, E>
P5<A, B, C, D, E> static <A,
B, C, D, E, F$>
P6<A, B, C, D, E, F$> static <A,
B, C, D, E, F$, G>
P7<A, B, C, D, E, F$, G> P.lazy
(F<Unit, A> fa, F<Unit, B> fb, F<Unit, C> fc, F<Unit, D> fd, F<Unit, E> fe, F<Unit, F$> ff, F<Unit, G> fg) static <A,
B, C, D, E, F$, G, H>
P8<A, B, C, D, E, F$, G, H> P.lazy
(F<Unit, A> fa, F<Unit, B> fb, F<Unit, C> fc, F<Unit, D> fd, F<Unit, E> fe, F<Unit, F$> ff, F<Unit, G> fg, F<Unit, H> fh) Promotes a function of arity-2 to a higher-order function.Promotes a function of arity-2 to a function on P1s.final <B> P1
<B> Map the element of the product.static <A,
B> P2 <B, B> Maps the given function across both the elements of the given product.Promote any function to a transformation between P1s.Map the first element of the product.Map the first element of the product.Map the first element of the product.Map the first element of the product.Map the first element of the product.Map the first element of the product.Map the first element of the product.Promotes a function so that it maps the first element of a product.Map the second element of the product.Map the second element of the product.Map the second element of the product.Map the second element of the product.Map the second element of the product.Map the second element of the product.Map the second element of the product.Promotes a function so that it maps the second element of a product.Map the third element of the product.Map the third element of the product.Map the third element of the product.Map the third element of the product.Map the third element of the product.Map the third element of the product.Map the fourth element of the product.Map the fourth element of the product.Map the fourth element of the product.Map the fourth element of the product.Map the fourth element of the product.Map the fifth element of the product.Map the fifth element of the product.Map the fifth element of the product.Map the fifth element of the product.Map the sixth element of the product.Map the sixth element of the product.Map the sixth element of the product.Map the seventh element of the product.Map the seventh element of the product.Map the eighth element of the product.static <A> Monoid
<A> Constructs a monoid from the given sum function and zero value, which must follow the monoidal laws.Return a function that inspects the argument of the given function for anull
value and if so, does not apply the value, instead returning an empty optional value.Function compositionstatic <A,
B> Equal.Definition <A> Begin definition of an equal instance.Applies this function over the arguments of another function.Applies a given function over the arguments of another function of arity-2.static <A,
B> Ord.Definition <A> Begin definition of an ord instance.static <A> Ord
<A> Returns an order instance that uses the given equality test and ordering function.static <A,
B, C> F <A, C> Function.partialApply2
(F<A, F<B, C>> f, B b) Partial application of the second argument to the supplied function to get a function of typeA -> C
.Function.partialApply3
(F<A, F<B, F<C, D>>> f, C c) Partial application of the third argument to the supplied function to get a function of typeA -> B -> D
.Function.partialApply4
(F<A, F<B, F<C, F<D, E>>>> f, D d) Partial application of the fourth argument to the supplied function to get a function of typeA -> B -> C -> E
.Partial application of the fifth argument to the supplied function to get a function of typeA -> B -> C -> D -> F$
.Partial application of the sixth argument to the supplied function to get a function of typeA -> B -> C -> D -> E -> G
.Partial application of the seventh argument to the supplied function to get a function of typeA -> B -> C -> D -> E -> F$ -> H
.Partial application of the eigth argument to the supplied function to get a function of typeA -> B -> C -> D -> E -> F$ -> G -> I
.static <A> Semigroup
<A> Constructs a semigroup from the given function.static <A> Show
<A> Returns a show instance using the given function.static <A> Show
<A> Returns a show instance using the given function.final <C,
D> P2 <C, D> Split this product between two argument functions and combine their output.A first-class version of the split function.default <B> Equal.Definition
<A> Refine this equal definition, to tests equality of self and the mapped object in "and" manner.default <B> Ord.Definition
<A> Refine this ord definition: compares using self and if objects are equal compares using givenOrd
.P1.traverseEither
(F<A, Either<X, B>> f) Traversable instance of P1 for EitherP2.traverseEither
(F<B, Either<X, C>> f) P2.traverseIO
(F<B, IO<C>> f) P1.traverseList
(F<A, List<B>> f) Traversable instance of P1 for ListP2.traverseList
(F<B, List<C>> f) P1.traverseOption
(F<A, Option<B>> f) Traversable instance of P1 for OptionP2.traverseOption
(F<B, Option<C>> f) P1.traverseStream
(F<A, Stream<B>> f) Traversable instance of P1 for StreamP2.traverseStream
(F<B, Stream<C>> f) final <B,
E> Validation <E, P1<B>> P1.traverseValidation
(F<A, Validation<E, B>> f) Traversable instance of P1 for ValidationTransforms a curried function of arity-2 to a function of a product-2static <A,
B, C> F2 <A, B, C> Uncurry a function of arity-2.static <A,
B, C, D>
F3<A, B, C, D> Uncurry a function of arity-3.static <A,
B, C, D, E>
F4<A, B, C, D, E> Uncurry a function of arity-4.static <A,
B, C, D, E, F$>
F5<A, B, C, D, E, F$> Uncurry a function of arity-6.static <A,
B, C, D, E, F$, G>
F6<A, B, C, D, E, F$, G> Uncurry a function of arity-6.static <A,
B, C, D, E, F$, G, H>
F7<A, B, C, D, E, F$, G, H> Uncurry a function of arity-7.static <A,
B, C, D, E, F$, G, H, I>
F8<A, B, C, D, E, F$, G, H, I> Uncurry a function of arity-8.static <A,
B, C> F2 <A, B, C> Transforms a function of a product-2 to an uncurried function or arity-2.static <A,
B> F <A, B> Simultaneously covaries and contravaries a function.<B> Monoid
<B> Maps the given functions across this monoid as an invariant functor.<B> Semigroup
<B> Maps the given functions across this monoid as an invariant functor.Modifier and TypeMethodDescriptionFunction application in an environment (Applicative Functor).static <A,
B, C> F <C, B> Performs function application within a higher-order function (applicative functor pattern).final <B> P1
<B> Performs function application within a P1 (applicative functor pattern).Binds a given function across this function (Reader Monad).final <B,
C> P1 <C> Binds the given function to the values in the given P1s with a final join.static <A> Equal
<A> Constructs an equal instance from the given function.Function argument flipping.static <A,
B> F <B, A> Joins two arguments of a function of arity-2 into one argument, yielding a function of arity-1.Promotes a function of arity-2 to a higher-order function.Promotes a function of arity-2 to a function on P1s.static <A> Monoid
<A> Constructs a monoid from the given sum function and zero value, which must follow the monoidal laws.Applies this function over the arguments of another function.Applies a given function over the arguments of another function of arity-2.static <A> Ord
<A> Returns an order instance that uses the given equality test and ordering function.static <A,
B, C> F <A, C> Function.partialApply2
(F<A, F<B, C>> f, B b) Partial application of the second argument to the supplied function to get a function of typeA -> C
.Function.partialApply3
(F<A, F<B, F<C, D>>> f, C c) Partial application of the third argument to the supplied function to get a function of typeA -> B -> D
.Function.partialApply3
(F<A, F<B, F<C, D>>> f, C c) Partial application of the third argument to the supplied function to get a function of typeA -> B -> D
.Function.partialApply4
(F<A, F<B, F<C, F<D, E>>>> f, D d) Partial application of the fourth argument to the supplied function to get a function of typeA -> B -> C -> E
.Function.partialApply4
(F<A, F<B, F<C, F<D, E>>>> f, D d) Partial application of the fourth argument to the supplied function to get a function of typeA -> B -> C -> E
.Function.partialApply4
(F<A, F<B, F<C, F<D, E>>>> f, D d) Partial application of the fourth argument to the supplied function to get a function of typeA -> B -> C -> E
.Partial application of the fifth argument to the supplied function to get a function of typeA -> B -> C -> D -> F$
.Partial application of the fifth argument to the supplied function to get a function of typeA -> B -> C -> D -> F$
.Partial application of the fifth argument to the supplied function to get a function of typeA -> B -> C -> D -> F$
.Partial application of the fifth argument to the supplied function to get a function of typeA -> B -> C -> D -> F$
.Partial application of the sixth argument to the supplied function to get a function of typeA -> B -> C -> D -> E -> G
.Partial application of the sixth argument to the supplied function to get a function of typeA -> B -> C -> D -> E -> G
.Partial application of the sixth argument to the supplied function to get a function of typeA -> B -> C -> D -> E -> G
.Partial application of the sixth argument to the supplied function to get a function of typeA -> B -> C -> D -> E -> G
.Partial application of the sixth argument to the supplied function to get a function of typeA -> B -> C -> D -> E -> G
.Partial application of the seventh argument to the supplied function to get a function of typeA -> B -> C -> D -> E -> F$ -> H
.Partial application of the seventh argument to the supplied function to get a function of typeA -> B -> C -> D -> E -> F$ -> H
.Partial application of the seventh argument to the supplied function to get a function of typeA -> B -> C -> D -> E -> F$ -> H
.Partial application of the seventh argument to the supplied function to get a function of typeA -> B -> C -> D -> E -> F$ -> H
.Partial application of the seventh argument to the supplied function to get a function of typeA -> B -> C -> D -> E -> F$ -> H
.Partial application of the seventh argument to the supplied function to get a function of typeA -> B -> C -> D -> E -> F$ -> H
.Partial application of the eigth argument to the supplied function to get a function of typeA -> B -> C -> D -> E -> F$ -> G -> I
.Partial application of the eigth argument to the supplied function to get a function of typeA -> B -> C -> D -> E -> F$ -> G -> I
.Partial application of the eigth argument to the supplied function to get a function of typeA -> B -> C -> D -> E -> F$ -> G -> I
.Partial application of the eigth argument to the supplied function to get a function of typeA -> B -> C -> D -> E -> F$ -> G -> I
.Partial application of the eigth argument to the supplied function to get a function of typeA -> B -> C -> D -> E -> F$ -> G -> I
.Partial application of the eigth argument to the supplied function to get a function of typeA -> B -> C -> D -> E -> F$ -> G -> I
.Partial application of the eigth argument to the supplied function to get a function of typeA -> B -> C -> D -> E -> F$ -> G -> I
.static <A> Semigroup
<A> Constructs a semigroup from the given function.final <C> List
<C> Applies a list of comonadic functions to this product, returning a list of values.final <C> Stream
<C> Applies a stream of comonadic functions to this product, returning a stream of values.Transforms a curried function of arity-2 to a function of a product-2static <A,
B, C> F2 <A, B, C> Uncurry a function of arity-2.static <A,
B, C, D>
F3<A, B, C, D> Uncurry a function of arity-3.static <A,
B, C, D>
F3<A, B, C, D> Uncurry a function of arity-3.static <A,
B, C, D, E>
F4<A, B, C, D, E> Uncurry a function of arity-4.static <A,
B, C, D, E>
F4<A, B, C, D, E> Uncurry a function of arity-4.static <A,
B, C, D, E>
F4<A, B, C, D, E> Uncurry a function of arity-4.static <A,
B, C, D, E, F$>
F5<A, B, C, D, E, F$> Uncurry a function of arity-6.static <A,
B, C, D, E, F$>
F5<A, B, C, D, E, F$> Uncurry a function of arity-6.static <A,
B, C, D, E, F$>
F5<A, B, C, D, E, F$> Uncurry a function of arity-6.static <A,
B, C, D, E, F$>
F5<A, B, C, D, E, F$> Uncurry a function of arity-6.static <A,
B, C, D, E, F$, G>
F6<A, B, C, D, E, F$, G> Uncurry a function of arity-6.static <A,
B, C, D, E, F$, G>
F6<A, B, C, D, E, F$, G> Uncurry a function of arity-6.static <A,
B, C, D, E, F$, G>
F6<A, B, C, D, E, F$, G> Uncurry a function of arity-6.static <A,
B, C, D, E, F$, G>
F6<A, B, C, D, E, F$, G> Uncurry a function of arity-6.static <A,
B, C, D, E, F$, G>
F6<A, B, C, D, E, F$, G> Uncurry a function of arity-6.static <A,
B, C, D, E, F$, G, H>
F7<A, B, C, D, E, F$, G, H> Uncurry a function of arity-7.static <A,
B, C, D, E, F$, G, H>
F7<A, B, C, D, E, F$, G, H> Uncurry a function of arity-7.static <A,
B, C, D, E, F$, G, H>
F7<A, B, C, D, E, F$, G, H> Uncurry a function of arity-7.static <A,
B, C, D, E, F$, G, H>
F7<A, B, C, D, E, F$, G, H> Uncurry a function of arity-7.static <A,
B, C, D, E, F$, G, H>
F7<A, B, C, D, E, F$, G, H> Uncurry a function of arity-7.static <A,
B, C, D, E, F$, G, H>
F7<A, B, C, D, E, F$, G, H> Uncurry a function of arity-7.static <A,
B, C, D, E, F$, G, H, I>
F8<A, B, C, D, E, F$, G, H, I> Uncurry a function of arity-8.static <A,
B, C, D, E, F$, G, H, I>
F8<A, B, C, D, E, F$, G, H, I> Uncurry a function of arity-8.static <A,
B, C, D, E, F$, G, H, I>
F8<A, B, C, D, E, F$, G, H, I> Uncurry a function of arity-8.static <A,
B, C, D, E, F$, G, H, I>
F8<A, B, C, D, E, F$, G, H, I> Uncurry a function of arity-8.static <A,
B, C, D, E, F$, G, H, I>
F8<A, B, C, D, E, F$, G, H, I> Uncurry a function of arity-8.static <A,
B, C, D, E, F$, G, H, I>
F8<A, B, C, D, E, F$, G, H, I> Uncurry a function of arity-8.static <A,
B, C, D, E, F$, G, H, I>
F8<A, B, C, D, E, F$, G, H, I> Uncurry a function of arity-8. -
Uses of F in fj.control
Fields in fj.control declared as FMethods in fj.control that return FModifier and TypeMethodDescriptionstatic <A,
B> F <F<A, Trampoline<B>>, F<Trampoline<A>, Trampoline<B>>> Trampoline.bind_()
static <A,
B, C> F <Trampoline<A>, F<Trampoline<B>, Trampoline<C>>> Promotes the given function of arity-2 to a function on Trampolines.static <A,
B> F <F<A, B>, F<Trampoline<A>, Trampoline<B>>> Trampoline.map_()
static <A> F
<A, Trampoline<A>> Trampoline.pure()
static <A> F
<Trampoline<A>, Either<P1<Trampoline<A>>, A>> Trampoline.resume_()
static <A> F
<P1<Trampoline<A>>, Trampoline<A>> Trampoline.suspend_()
Methods in fj.control that return types with arguments of type FModifier and TypeMethodDescriptionstatic <A,
B> F <F<A, Trampoline<B>>, F<Trampoline<A>, Trampoline<B>>> Trampoline.bind_()
static <A,
B> F <F<A, Trampoline<B>>, F<Trampoline<A>, Trampoline<B>>> Trampoline.bind_()
static <A,
B, C> F <Trampoline<A>, F<Trampoline<B>, Trampoline<C>>> Promotes the given function of arity-2 to a function on Trampolines.static <A,
B> F <F<A, B>, F<Trampoline<A>, Trampoline<B>>> Trampoline.map_()
static <A,
B> F <F<A, B>, F<Trampoline<A>, Trampoline<B>>> Trampoline.map_()
Methods in fj.control with parameters of type FModifier and TypeMethodDescriptionfinal <B,
C> Trampoline <C> Trampoline.bind
(Trampoline<B> lb, F<A, F<B, C>> f) Binds the given function across the result of this Trampoline and the given Trampoline.abstract <B> Trampoline
<B> Trampoline.bind
(F<A, Trampoline<B>> f) Binds the given continuation to the result of this trampoline.<B> Trampoline
<B> Trampoline.Codense.bind
(F<A, Trampoline<B>> f) final <B> Trampoline
<B> Trampoline.Normal.bind
(F<A, Trampoline<B>> f) private static <A,
B> Trampoline.Codense <B> Trampoline.codense
(Trampoline.Normal<A> a, F<A, Trampoline<B>> k) <R> R
Trampoline.Codense.fold
(F<Trampoline.Normal<A>, R> n, F<Trampoline.Codense<A>, R> gs) protected abstract <R> R
Trampoline.fold
(F<Trampoline.Normal<A>, R> n, F<Trampoline.Codense<A>, R> gs) <R> R
Trampoline.Pure.fold
(F<Trampoline.Normal<A>, R> n, F<Trampoline.Codense<A>, R> gs) <R> R
Trampoline.Suspend.fold
(F<Trampoline.Normal<A>, R> n, F<Trampoline.Codense<A>, R> gs) abstract <R> R
Trampoline.Normal.foldNormal
(F<A, R> pure, F<P1<Trampoline<A>>, R> k) <R> R
Trampoline.Pure.foldNormal
(F<A, R> pure, F<P1<Trampoline<A>>, R> k) <R> R
Trampoline.Suspend.foldNormal
(F<A, R> pure, F<P1<Trampoline<A>>, R> k) static <A,
B, C> F <Trampoline<A>, F<Trampoline<B>, Trampoline<C>>> Promotes the given function of arity-2 to a function on Trampolines.final <B> Trampoline
<B> Maps the given function across the result of this trampoline.Method parameters in fj.control with type arguments of type FModifier and TypeMethodDescriptionfinal <B> Trampoline
<B> Trampoline.apply
(Trampoline<F<A, B>> lf) Performs function application within a Trampoline (applicative functor pattern).final <B,
C> Trampoline <C> Trampoline.bind
(Trampoline<B> lb, F<A, F<B, C>> f) Binds the given function across the result of this Trampoline and the given Trampoline.static <A,
B, C> F <Trampoline<A>, F<Trampoline<B>, Trampoline<C>>> Promotes the given function of arity-2 to a function on Trampolines.Constructors in fj.control with parameters of type FModifierConstructorDescriptionprivate
Codense
(Trampoline.Normal<Object> t, F<Object, Trampoline<A>> k) -
Uses of F in fj.control.db
Methods in fj.control.db that return FModifier and TypeMethodDescriptionfinal F
<Connection, Callable<A>> DB.asFunction()
Returns the callable-valued function projection of this database action.Promotes any given function so that it transforms between values in the database.Methods in fj.control.db with parameters of type FModifier and TypeMethodDescriptionfinal <B> DB
<B> Binds the given action across the result of this database action.static <A> DB
<A> DB.db
(F<Connection, A> f) Constructs a database action as a function from a database connection to a value.Promotes any given function so that it transforms between values in the database.final <B> DB
<B> Map a function over the result of this action. -
Uses of F in fj.control.parallel
Fields in fj.control.parallel declared as FMethods in fj.control.parallel that return FModifier and TypeMethodDescriptionParModule.actor()
A first-class constructor of actors.Callables.arrow()
Provides a transformation from a function to a Callable-valued function that is equivalent to it.Callables.callable()
Provides a transformation from a value to a Callable that completely preserves that value.Wraps a given function's return value in a Callable.Promotes a function to a concurrent function.Promotes a function of arity-2 to a concurrent function.ParModule.effect()
A first-class constructor of concurrent effects, as actors that don't guarantee ordering of messages.Callables.either()
Returns a transformation from a Callable to an Either.Strategy.f()
Returns the functional representation of this Strategy, a function that evaluates a product-1.Lifts any function to a function on Callables.Promotes any function to a transformation between promises (covariant functor pattern).Performs a right-fold reduction across a list in constant stack space.Performs a right-fold reduction across a Stream in constant stack space.Callables.fromEither()
Returns a transformation from an Either to a Callable.Callables.fromOption()
Returns a transformation from an optional value to a CallablePromotes a function of arity-2 to a function on callables.Promotes a function of arity-2 to a function on promises.ParModule.mapList()
First-class function that maps a concurrent function over a List inside a promise.ParModule.mapStream()
First-class function that maps a concurrent function over a Stream inside a promise.Callables.normalise()
A first-class version of the normalise function.Strategy.obtain()
Returns a function which returns a product-1 which waits for the given Future to obtain a value.Callables.option()
Returns a transformation from a Callable to an optional value.ParModule.parMapArray()
A first-class function that maps another function across an array in parallel.Strategy.parMapArray()
First-class version of parMap on arrays.Strategy.parMapArray
(F<B, A> f) Promotes a function to a parallel function on arrays using this strategy.Strategy.parMapArray1()
First-class version of parMap1 on arrays (parallel array functor).ParModule.parMapIterable()
A first-class function that maps another function across an iterable in parallel.ParModule.parMapList()
A first-class function that maps another function across a list in parallel.Strategy.parMapList()
First-class version of parMap on lists.Strategy.parMapList
(F<B, A> f) Promotes a function to a parallel function on lists using this strategy.Strategy.parMapList1()
First-class version of parMap1 on lists (parallel list functor).ParModule.parMapStream()
A first-class function that maps another function across a stream in parallel.ParModule.parMapTree()
A first-class function that maps across a Tree in parallel.ParModule.promise()
Returns a function that evaluates a given product concurrently and returns a Promise of the result.Promotes the given function to a concurrent function that returns a Promise.Provides a first-class unit function for promises.Transforms any function so that it returns a promise of a value instead of an actual value.ParModule.promisePure()
Returns a function that promotes a given function to a concurrent function that returns a Promise.First-class version of the sequence function through a List.Callables.sequence_()
A first-class version of the sequence method.ParModule.sequenceList()
A first-class function that traverses a list inside a promise.First-class version of the sequence function through a Stream.ParModule.sequenceStream()
A first-class function that traverses a stream inside a promise.Methods in fj.control.parallel that return types with arguments of type FModifier and TypeMethodDescriptionCallables.arrow()
Provides a transformation from a function to a Callable-valued function that is equivalent to it.Callables.arrow()
Provides a transformation from a function to a Callable-valued function that is equivalent to it.Promotes a function of arity-2 to a concurrent function.Promotes a function of arity-2 to a function on callables.Promotes a function of arity-2 to a function on promises.ParModule.mapList()
First-class function that maps a concurrent function over a List inside a promise.ParModule.mapList()
First-class function that maps a concurrent function over a List inside a promise.ParModule.mapStream()
First-class function that maps a concurrent function over a Stream inside a promise.ParModule.mapStream()
First-class function that maps a concurrent function over a Stream inside a promise.ParModule.parMapArray()
A first-class function that maps another function across an array in parallel.ParModule.parMapArray()
A first-class function that maps another function across an array in parallel.Strategy.parMapArray()
First-class version of parMap on arrays.Strategy.parMapArray()
First-class version of parMap on arrays.Strategy.parMapArray1()
First-class version of parMap1 on arrays (parallel array functor).Strategy.parMapArray1()
First-class version of parMap1 on arrays (parallel array functor).ParModule.parMapIterable()
A first-class function that maps another function across an iterable in parallel.ParModule.parMapIterable()
A first-class function that maps another function across an iterable in parallel.ParModule.parMapList()
A first-class function that maps another function across a list in parallel.ParModule.parMapList()
A first-class function that maps another function across a list in parallel.Strategy.parMapList()
First-class version of parMap on lists.Strategy.parMapList()
First-class version of parMap on lists.Strategy.parMapList1()
First-class version of parMap1 on lists (parallel list functor).Strategy.parMapList1()
First-class version of parMap1 on lists (parallel list functor).ParModule.parMapStream()
A first-class function that maps another function across a stream in parallel.ParModule.parMapStream()
A first-class function that maps another function across a stream in parallel.ParModule.parMapTree()
A first-class function that maps across a Tree in parallel.ParModule.parMapTree()
A first-class function that maps across a Tree in parallel.ParModule.promisePure()
Returns a function that promotes a given function to a concurrent function that returns a Promise.ParModule.promisePure()
Returns a function that promotes a given function to a concurrent function that returns a Promise.Methods in fj.control.parallel with parameters of type FModifier and TypeMethodDescriptionstatic <A> Actor
<A> Creates a new Actor that uses the given parallelization strategy and has the given side-effect.static <A,
B> Callable <B> Binds the given function to the value in a Callable with a final join.static <A,
B, C> Callable <C> Binds the given function to the values in the given callables with a final join.<B,
C> Promise <C> Binds the given function to this promise and the given promise, with a final join.<B> Promise
<B> Binds the given function over this promise, with a final join.<B,
C> Promise <C> Binds the given function to this promise and the given promise, with a final join.Wraps a given function's return value in a Callable.<B> Promise
<B> Binds the given function across a promise of this promise (Comonad pattern).Promotes a function to a concurrent function.<B> Actor
<B> Contravariant functor pattern.Maps the given transformation across this strategy's codomain (Invariant Functor pattern).Lifts any function to a function on Callables.<B> Promise
<B> Provides a promise to apply the given function to this promise's future value (covariant functor pattern).Promotes any function to a transformation between promises (covariant functor pattern).Performs a right-fold reduction across a list in constant stack space.Performs a right-fold reduction across a Stream in constant stack space.Promotes a function of arity-2 to a function on callables.Promotes a function of arity-2 to a function on promises.Maps the given transformation across this strategy's domain (Invariant Functor pattern).Takes a Promise-valued function and applies it to each element in the given List, yielding a promise of a List of results.Takes a Promise-valued function and applies it to each element in the given Stream, yielding a promise of a Stream of results.Maps a concurrent function over a Product-1 inside a Promise.<A,
B> Promise <NonEmptyList<B>> ParModule.parExtend
(NonEmptyList<A> as, F<NonEmptyList<A>, B> f) Maps the given function across all sublists of the given NonEmptyList in parallel.Maps the given function across all subtrees of the given Tree in parallel.<A,
B> Promise <TreeZipper<B>> ParModule.parExtend
(TreeZipper<A> za, F<TreeZipper<A>, B> f) Maps the given function across all positions of the given TreeZipper in parallel.Maps the given function across all positions of the given zipper in parallel.ParModule.parFlatMap
(Array<A> as, F<A, Array<B>> f) Binds an Array-valued function across an Array in parallel, concatenating the results into a new Array.ParModule.parFlatMap
(List<A> as, F<A, List<B>> f) Binds a list-valued function across a list in parallel, concatenating the results into a new list.ParModule.parFlatMap
(Stream<A> as, F<A, Stream<B>> f) Binds a Stream-valued function across a Stream in parallel, concatenating the results into a new Stream.ParModule.parFlatMap
(Iterable<A> as, F<A, Iterable<B>> f) Binds an Iterable-valued function across an Iterable in parallel, concatenating the results into a new Iterable.Binds the given function in parallel across the given array, using the given strategy, with a final join.Binds the given function in parallel across the given list, using the given strategy, with a final join.<A,
B> Promise <B> ParModule.parFoldMap
(Stream<A> as, F<A, B> map, Monoid<B> reduce) Maps with the given function across the given stream in parallel, while folding with the given monoid.<A,
B> Promise <B> ParModule.parFoldMap
(Stream<A> as, F<A, B> map, Monoid<B> reduce, F<Stream<A>, P2<Stream<A>, Stream<A>>> chunking) Maps with the given function across chunks of the given stream in parallel, while folding with the given monoid.<A,
B> Promise <B> ParModule.parFoldMap
(Iterable<A> as, F<A, B> map, Monoid<B> reduce) Maps with the given function across the given iterable in parallel, while folding with the given monoid.<A,
B> Promise <B> ParModule.parFoldMap
(Iterable<A> as, F<A, B> map, Monoid<B> reduce, F<Iterable<A>, P2<Iterable<A>, Iterable<A>>> chunking) Maps with the given function across chunks of the given Iterable in parallel, while folding with the given monoid.Maps across an Array in parallel.Maps across a list in parallel.<A,
B> Promise <NonEmptyList<B>> ParModule.parMap
(NonEmptyList<A> as, F<A, B> f) Maps across a nonempty list in parallel.Maps across a Stream in parallel.Maps a function across a Tree in parallel.<A,
B> Promise <TreeZipper<B>> ParModule.parMap
(TreeZipper<A> za, F<A, B> f) Maps a function across a TreeZipper in parallel.Maps a function across a Zipper in parallel.Maps across an Iterable in parallel.Maps the given function over the given array in parallel using this strategy.Maps the given function over the given list in parallel using this strategy.A strict version of parMap over arrays.A strict version of parMap over lists.Strategy.parMapArray
(F<B, A> f) Promotes a function to a parallel function on arrays using this strategy.Strategy.parMapList
(F<B, A> f) Promotes a function to a parallel function on lists using this strategy.ParModule.parZipWith
(Array<A> as, Array<B> bs, F<A, F<B, C>> f) Zips two arrays together with a given function, in parallel.ParModule.parZipWith
(List<A> as, List<B> bs, F<A, F<B, C>> f) Zips two lists together with a given function, in parallel.ParModule.parZipWith
(Stream<A> as, Stream<B> bs, F<A, F<B, C>> f) Zips two streams together with a given function, in parallel.ParModule.parZipWith
(Iterable<A> as, Iterable<B> bs, F<A, F<B, C>> f) Zips two iterables together with a given function, in parallel.Promotes the given function to a concurrent function that returns a Promise.Transforms any function so that it returns a promise of a value instead of an actual value.static <A> Strategy
<A> Constructs a strategy from the given evaluation function.<B> Strategy
<B> Maps the given bijective transformation across this strategy (Exponential Functor pattern).Method parameters in fj.control.parallel with type arguments of type FModifier and TypeMethodDescription<B> Promise
<B> Performs function application within a promise (applicative functor pattern).static <A,
B, C> Callable <C> Binds the given function to the values in the given callables with a final join.<B,
C> Promise <C> Binds the given function to this promise and the given promise, with a final join.<B,
C> Promise <C> Binds the given function to this promise and the given promise, with a final join.Performs a right-fold reduction across a list in constant stack space.Performs a right-fold reduction across a Stream in constant stack space.Promotes a function of arity-2 to a function on callables.Promotes a function of arity-2 to a function on promises.ParModule.parZipWith
(Array<A> as, Array<B> bs, F<A, F<B, C>> f) Zips two arrays together with a given function, in parallel.ParModule.parZipWith
(List<A> as, List<B> bs, F<A, F<B, C>> f) Zips two lists together with a given function, in parallel.ParModule.parZipWith
(Stream<A> as, Stream<B> bs, F<A, F<B, C>> f) Zips two streams together with a given function, in parallel.ParModule.parZipWith
(Iterable<A> as, Iterable<B> bs, F<A, F<B, C>> f) Zips two iterables together with a given function, in parallel.<B> Stream
<B> Applies a stream of comonadic functions to this promise, returning a stream of values.Constructors in fj.control.parallel with parameters of type F -
Uses of F in fj.data
Modifier and TypeClassDescriptionprivate static class
private static class
private static class
Modifier and TypeFieldDescriptionNatural.add
A function that adds two natural numbers.DList.appendFn
Java.Array_BitSet
A function that converts arrays to bit sets.Conversions.Array_String
A function that converts arrays to strings.static final F
<Array<Character>, StringBuffer> Conversions.Array_StringBuffer
A function that converts arrays to string buffers.static final F
<Array<Character>, StringBuilder> Conversions.Array_StringBuilder
A function that converts arrays to string builders.static final F
<Natural, BigInteger> Natural.bigIntegerValue
A function that returns the BigInteger value of a given Natural.Java.BitSet_List
A function that converts bit sets to lists.IOFunctions.closeReader
Natural.divide
A function that divides its second argument by its first.Natural.divmod
A function that divides its second argument by its first, yielding both the quotient and the remainder.private final F
<P2<A, Iteratee.Input<char[]>>, P1<Iteratee.IterV<char[], A>>> IOFunctions.CharChunkReader.done
private final F
<P2<A, Iteratee.Input<Character>>, Iteratee.IterV<Character, A>> IOFunctions.CharChunkReader2.done
private final F
<P2<A, Iteratee.Input<String>>, P1<Iteratee.IterV<String, A>>> IOFunctions.LineReader.done
Eval.BindTrampolineEval.f
static final F
<BigInteger, Option<Natural>> Natural.fromBigInt
A function that returns the natural number equal to a given BigIntegerstatic final F
<Stream<Character>, LazyString> LazyString.fromStream
First-class conversion from character streams to lazy strings.Reader.function
private final F
<Iteratee.IterV<char[], A>, Boolean> IOFunctions.CharChunkReader.isDone
private final F
<Iteratee.IterV<Character, A>, Boolean> IOFunctions.CharChunkReader2.isDone
private final F
<Iteratee.IterV<String, A>, Boolean> IOFunctions.LineReader.isDone
Java.List_BitSet
A function that converts lists to bit sets.Conversions.List_String
A function that converts lists to strings.static final F
<List<Character>, StringBuffer> Conversions.List_StringBuffer
A function that converts lists to string buffers.static final F
<List<Character>, StringBuilder> Conversions.List_StringBuilder
A function that converts lists to string builders.Natural.mod
A function that yields the remainder of division of its second argument by its first.Natural.multiply
A function that multiplies a natural number by another.Java.Option_BitSet
A function that converts options to bit sets.Conversions.Option_String
A function that converts options to strings.static final F
<Option<Character>, StringBuffer> Conversions.Option_StringBuffer
A function that converts options to string buffers.static final F
<Option<Character>, StringBuilder> Conversions.Option_StringBuilder
A function that converts options to string builders.Option.parseByte
A function that parses a string to a byte.static final F
<String, Validation<NumberFormatException, Byte>> Validation.parseByte
A function that parses a string into a byte.Option.parseDouble
A function that parses a string to a double.static final F
<String, Validation<NumberFormatException, Double>> Validation.parseDouble
A function that parses a string into a double.Option.parseFloat
A function that parses a string to a float.static final F
<String, Validation<NumberFormatException, Float>> Validation.parseFloat
A function that parses a string into a float.Option.parseInt
A function that parses a string to an integer.static final F
<String, Validation<NumberFormatException, Integer>> Validation.parseInt
A function that parses a string into an integer.Option.parseLong
A function that parses a string to a long.static final F
<String, Validation<NumberFormatException, Long>> Validation.parseLong
A function that parses a string into a long.Option.parseShort
A function that parses a string to a short.static final F
<String, Validation<NumberFormatException, Short>> Validation.parseShort
A function that parses a string into a short.Enumerator.plus
Enumerator.predecessor
State.runF
Java.Stream_BitSet
A function that converts streams to bit sets.Conversions.Stream_String
A function that converts streams to strings.static final F
<Stream<Character>, StringBuffer> Conversions.Stream_StringBuffer
A function that converts streams to string buffers.static final F
<Stream<Character>, StringBuilder> Conversions.Stream_StringBuilder
A function that converts streams to string builders.Conversions.String_Array
A function that converts strings to arrays.Java.String_ArrayList
A function that converts strings to array lists.static final F
<String, ConcurrentLinkedQueue<Character>> A function that converts strings to concurrent linked queues.static final F
<String, CopyOnWriteArrayList<Character>> A function that converts strings to copy on write array lists.static final F
<String, CopyOnWriteArraySet<Character>> A function that converts strings to copy on write array sets.Java.String_HashSet
A function that converts strings to hash sets.static final F
<String, LinkedBlockingQueue<Character>> A function that converts strings to linked blocking queues.static final F
<String, LinkedHashSet<Character>> Java.String_LinkedHashSet
A function that converts strings to linked hash sets.static final F
<String, LinkedList<Character>> Java.String_LinkedList
A function that converts strings to linked lists.Conversions.String_List
A function that converts strings to lists.Conversions.String_Option
A function that converts strings to options.static final F
<String, PriorityBlockingQueue<Character>> A function that converts strings to priority blocking queues.static final F
<String, PriorityQueue<Character>> Java.String_PriorityQueue
A function that converts strings to priority queues.Java.String_Stack
A function that converts strings to stacks.Conversions.String_Stream
A function that converts strings to streams.static final F
<String, StringBuffer> Conversions.String_StringBuffer
A function that converts strings to string buffers.static final F
<String, StringBuilder> Conversions.String_StringBuilder
A function that converts strings to string builders.Java.String_TreeSet
A function that converts strings to tree sets.Java.String_Vector
A function that converts strings to vectors.static final F
<StringBuffer, Array<Character>> Conversions.StringBuffer_Array
A function that converts string buffers to arrays.static final F
<StringBuffer, ArrayList<Character>> A function that converts string buffers to array lists.static final F
<StringBuffer, ConcurrentLinkedQueue<Character>> A function that converts string buffers to concurrent linked queues.static final F
<StringBuffer, CopyOnWriteArrayList<Character>> A function that converts string buffers to copy on write array lists.static final F
<StringBuffer, CopyOnWriteArraySet<Character>> A function that converts string buffers to copy on write array sets.static final F
<StringBuffer, HashSet<Character>> Java.StringBuffer_HashSet
A function that converts string buffers to hash sets.static final F
<StringBuffer, LinkedBlockingQueue<Character>> A function that converts string buffers to linked blocking queues.static final F
<StringBuffer, LinkedHashSet<Character>> A function that converts string buffers to linked hash sets.static final F
<StringBuffer, LinkedList<Character>> A function that converts string buffers to linked lists.static final F
<StringBuffer, List<Character>> Conversions.StringBuffer_List
A function that converts string buffers to lists.static final F
<StringBuffer, Option<Character>> Conversions.StringBuffer_Option
A function that converts string buffers to options.static final F
<StringBuffer, PriorityBlockingQueue<Character>> A function that converts string buffers to priority blocking queues.static final F
<StringBuffer, PriorityQueue<Character>> A function that converts string buffers to priority queues.static final F
<StringBuffer, Stack<Character>> Java.StringBuffer_Stack
A function that converts string buffers to stacks.static final F
<StringBuffer, Stream<Character>> Conversions.StringBuffer_Stream
A function that converts string buffers to streams.static final F
<StringBuffer, String> Conversions.StringBuffer_String
A function that converts string buffers to strings.static final F
<StringBuffer, StringBuilder> Conversions.StringBuffer_StringBuilder
A function that converts string buffers to string builders.static final F
<StringBuffer, TreeSet<Character>> Java.StringBuffer_TreeSet
A function that converts string buffers to tree sets.static final F
<StringBuffer, Vector<Character>> Java.StringBuffer_Vector
A function that converts string buffers to vectors.static final F
<StringBuilder, Array<Character>> Conversions.StringBuilder_Array
A function that converts string builders to arrays.static final F
<StringBuilder, ArrayList<Character>> A function that converts string builders to array lists.static final F
<StringBuilder, ConcurrentLinkedQueue<Character>> A function that converts string builders to concurrent linked queues.static final F
<StringBuilder, CopyOnWriteArrayList<Character>> A function that converts string builders to copy on write array lists.static final F
<StringBuilder, CopyOnWriteArraySet<Character>> A function that converts string builders to copy on write array sets.static final F
<StringBuilder, HashSet<Character>> A function that converts string builders to hash sets.static final F
<StringBuilder, LinkedBlockingQueue<Character>> A function that converts string builders to linked blocking queues.static final F
<StringBuilder, LinkedHashSet<Character>> A function that converts string builders to linked hash sets.static final F
<StringBuilder, LinkedList<Character>> A function that converts string builders to linked lists.static final F
<StringBuilder, List<Character>> Conversions.StringBuilder_List
A function that converts string builders to lists.static final F
<StringBuilder, Option<Character>> Conversions.StringBuilder_Option
A function that converts string builders to options.static final F
<StringBuilder, PriorityBlockingQueue<Character>> A function that converts string builders to priority blocking queues.static final F
<StringBuilder, PriorityQueue<Character>> A function that converts string builders to priority queues.static final F
<StringBuilder, Stack<Character>> Java.StringBuilder_Stack
A function that converts string builders to stacks.static final F
<StringBuilder, Stream<Character>> Conversions.StringBuilder_Stream
A function that converts string builders to streams.static final F
<StringBuilder, String> Conversions.StringBuilder_String
A function that converts string builders to strings.static final F
<StringBuilder, StringBuffer> Conversions.StringBuilder_StringBuffer
A function that converts string builders to string buffers.static final F
<StringBuilder, TreeSet<Character>> A function that converts string builders to tree sets.static final F
<StringBuilder, Vector<Character>> Java.StringBuilder_Vector
A function that converts string builders to vectors.Natural.subtract
A function that subtracts its first argument from its second.Enumerator.successor
static final F
<LazyString, Stream<Character>> LazyString.toStream
First-class conversion from lazy strings to streams.static final F
<LazyString, String> LazyString.toString
First-class conversion from lazy strings to String.Modifier and TypeFieldDescriptionNatural.add
A function that adds two natural numbers.Natural.divide
A function that divides its second argument by its first.Natural.divmod
A function that divides its second argument by its first, yielding both the quotient and the remainder.Natural.mod
A function that yields the remainder of division of its second argument by its first.Natural.multiply
A function that multiplies a natural number by another.Enumerator.plus
Natural.subtract
A function that subtracts its first argument from its second.Modifier and TypeMethodDescriptionstatic <A> F
<Array<A>, ArrayBlockingQueue<A>> Java.Array_ArrayBlockingQueue
(boolean fair) A function that converts arrays to array blocking queues.Java.Array_ArrayList()
A function that converts arrays to array lists.static <A> F
<Array<A>, ConcurrentLinkedQueue<A>> Java.Array_ConcurrentLinkedQueue()
A function that converts arrays to concurrent linked queues.static <A> F
<Array<A>, CopyOnWriteArrayList<A>> Java.Array_CopyOnWriteArrayList()
A function that converts arrays to copy on write array lists.static <A> F
<Array<A>, CopyOnWriteArraySet<A>> Java.Array_CopyOnWriteArraySet()
A function that converts arrays to copy on write array sets.static <A extends Delayed>
F<Array<A>, DelayQueue<A>> Java.Array_DelayQueue()
A function that converts arrays to delay queues.Conversions.Array_Either()
A function that converts arrays to eithers.Java.Array_EnumSet()
A function that converts arrays to enum sets.Java.Array_HashSet()
A function that converts arrays to hash sets.static <A> F
<Array<A>, LinkedBlockingQueue<A>> Java.Array_LinkedBlockingQueue()
A function that converts arrays to linked blocking queues.static <A> F
<Array<A>, LinkedHashSet<A>> Java.Array_LinkedHashSet()
A function that converts arrays to linked hash sets.static <A> F
<Array<A>, LinkedList<A>> Java.Array_LinkedList()
A function that converts arrays to linked lists.Conversions.Array_List()
A function that converts arrays to lists.Conversions.Array_Option()
A function that converts arrays to options.static <A> F
<Array<A>, PriorityBlockingQueue<A>> Java.Array_PriorityBlockingQueue()
A function that converts arrays to priority blocking queues.static <A> F
<Array<A>, PriorityQueue<A>> Java.Array_PriorityQueue()
A function that converts arrays to priority queues.Java.Array_Stack()
A function that converts arrays to stacks.Conversions.Array_Stream()
A function that converts arrays to streams.static <A> F
<Array<A>, SynchronousQueue<A>> Java.Array_SynchronousQueue
(boolean fair) A function that converts arrays to synchronous queues.Java.Array_TreeSet()
A function that converts arrays to tree sets.Java.Array_Vector()
A function that converts arrays to vectors.static <A> F
<ArrayBlockingQueue<A>, List<A>> Java.ArrayBlockingQueue_List()
A function that converts array blocking queues to lists.Java.ArrayList_List()
A function that converts array lists to lists.IterableW.arrow()
Provides a transformation from a function to a Iterable-valued function that is equivalent to it.List.asString()
A first-classasString
.static <A,
B, C> F <BiFunction<A, B, C>, F2<A, B, C>> Java8.BiFunction_F2()
IterableW.bind()
The first-class bind function over Iterable.Option.bind()
First-class bind function.List.bind_()
Provides a first-class version of bind()Stream.bind_()
A first-class version of the bind function.static <A> F
<Reader, F<Iteratee.IterV<char[], A>, IO<Iteratee.IterV<char[], A>>>> IOFunctions.charChunkReader()
A function that feeds an iteratee with character chunks read from aReader
(char[] of sizeIOFunctions.DEFAULT_BUFFER_SIZE
).static <A> F
<Reader, F<Iteratee.IterV<Character, A>, IO<Iteratee.IterV<Character, A>>>> IOFunctions.charChunkReader2()
A function that feeds an iteratee with characters read from aReader
(chars are read in chunks of sizeIOFunctions.DEFAULT_BUFFER_SIZE
).static <A> F
<Collection<A>, List<A>> Java.Collection_List()
static <A> F
<ConcurrentLinkedQueue<A>, List<A>> Java.ConcurrentLinkedQueue_List()
A function that converts concurrent linked queues to lists.List.cons()
Returns a function that prepends (cons) an element to a list to produce a new list.Returns a function that prepends a value to the given list.Stream.cons()
Returns a function that prepends (cons) an element to a stream to produce a new stream.List.cons_
(A a) Returns a function that prepends the given value to a list.Stream.cons_()
Returns a function that prepends (cons) an element to a stream to produce a new stream.Java8.Consumer_F()
Java8.Consumer_F
(Consumer<A> c) static <A> F
<CopyOnWriteArrayList<A>, List<A>> Java.CopyOnWriteArrayList_List()
A function that converts copy on write array lists to lists.static <A> F
<CopyOnWriteArraySet<A>, List<A>> Java.CopyOnWriteArraySet_List()
A function that converts copy on write array sets to lists.static <A extends Delayed>
F<DelayQueue<A>, List<A>> Java.DelayQueue_List()
A function that converts delay queues to lists.Set.delete()
First-class deletion function.private static <A> F
<TreeZipper<A>, P2<TreeZipper<A>, P1<Stream<TreeZipper<A>>>>> TreeZipper.dwn()
Conversions.Effect_IO()
Conversions.Effect_SafeIO()
Conversions.Effect0_P1()
Conversions.Effect1_F()
static <E,
T> F <Validation<E, T>, Either<E, T>> Validation.either()
Returns a function that constructs an either with a validation.First class catamorphism for either.Conversions.Either_ArrayA()
A function that converts eithers to arrays.Conversions.Either_ArrayB()
A function that converts eithers to arrays.static <A,
B> F <Either<A, B>, ArrayBlockingQueue<A>> Java.Either_ArrayBlockingQueueA
(boolean fair) A function that converts eithers to array blocking queues.static <A,
B> F <Either<A, B>, ArrayBlockingQueue<B>> Java.Either_ArrayBlockingQueueB
(boolean fair) A function that converts eithers to array blocking queues.Java.Either_ArrayListA()
A function that converts eithers to array lists.Java.Either_ArrayListB()
A function that converts eithers to array lists.Java.Either_BitSetA()
A function that converts eithers to bit sets.Java.Either_BitSetB()
A function that converts eithers to bit sets.static <A,
B> F <Either<A, B>, ConcurrentLinkedQueue<A>> A function that converts eithers to concurrent linked queues.static <A,
B> F <Either<A, B>, ConcurrentLinkedQueue<B>> A function that converts eithers to concurrent linked queues.static <A,
B> F <Either<A, B>, CopyOnWriteArrayList<A>> Java.Either_CopyOnWriteArrayListA()
A function that converts eithers to copy on write array lists.static <A,
B> F <Either<A, B>, CopyOnWriteArrayList<B>> Java.Either_CopyOnWriteArrayListB()
A function that converts eithers to copy on write array lists.static <A,
B> F <Either<A, B>, CopyOnWriteArraySet<A>> Java.Either_CopyOnWriteArraySetA()
A function that converts eithers to copy on write array sets.static <A,
B> F <Either<A, B>, CopyOnWriteArraySet<B>> Java.Either_CopyOnWriteArraySetB()
A function that converts eithers to copy on write array sets.static <A extends Delayed,
B>
F<Either<A, B>, DelayQueue<A>> Java.Either_DelayQueueA()
A function that converts eithers to delay queues.static <A,
B extends Delayed>
F<Either<A, B>, DelayQueue<B>> Java.Either_DelayQueueB()
A function that converts eithers to delay queues.Java.Either_EnumSetA()
A function that converts eithers to enum sets.Java.Either_EnumSetB()
A function that converts eithers to enum sets.Java.Either_HashSetA()
A function that converts eithers to hash sets.Java.Either_HashSetB()
A function that converts eithers to hash sets.static <A,
B> F <Either<A, B>, LinkedBlockingQueue<A>> Java.Either_LinkedBlockingQueueA()
A function that converts eithers to linked blocking queues.static <A,
B> F <Either<A, B>, LinkedBlockingQueue<B>> Java.Either_LinkedBlockingQueueB()
A function that converts eithers to linked blocking queues.static <A,
B> F <Either<A, B>, LinkedHashSet<A>> Java.Either_LinkedHashSetA()
A function that converts eithers to linked hash sets.static <A,
B> F <Either<A, B>, LinkedHashSet<B>> Java.Either_LinkedHashSetB()
A function that converts eithers to linked hash sets.static <A,
B> F <Either<A, B>, LinkedList<A>> Java.Either_LinkedListA()
A function that converts eithers to linked lists.static <A,
B> F <Either<A, B>, LinkedList<B>> Java.Either_LinkedListB()
A function that converts eithers to linked lists.Conversions.Either_ListA()
A function that converts eithers to lists.Conversions.Either_ListB()
A function that converts eithers to lists.Conversions.Either_OptionA()
A function that converts eithers to options.Conversions.Either_OptionB()
A function that converts eithers to options.static <A,
B> F <Either<A, B>, PriorityBlockingQueue<A>> A function that converts eithers to priority blocking queues.static <A,
B> F <Either<A, B>, PriorityBlockingQueue<B>> A function that converts eithers to priority blocking queues.Java.Either_StackA()
A function that converts eithers to stacks.Java.Either_StackB()
A function that converts eithers to stacks.Conversions.Either_StreamA()
A function that converts eithers to streams.Conversions.Either_StreamB()
A function that converts eithers to streams.Conversions.Either_StringA()
A function that converts eithers to strings.Conversions.Either_StringB()
A function that converts eithers to strings.static <B> F
<Either<Character, B>, StringBuffer> Conversions.Either_StringBufferA()
A function that converts eithers to string buffers.static <A> F
<Either<A, Character>, StringBuffer> Conversions.Either_StringBufferB()
A function that converts eithers to string buffers.static <B> F
<Either<Character, B>, StringBuilder> Conversions.Either_StringBuilderA()
A function that converts eithers to string builders.static <A> F
<Either<A, Character>, StringBuilder> Conversions.Either_StringBuilderB()
A function that converts eithers to string builders.static <A,
B> F <Either<A, B>, SynchronousQueue<A>> Java.Either_SynchronousQueueA
(boolean fair) A function that converts eithers to synchronous queues.static <A,
B> F <Either<A, B>, SynchronousQueue<B>> Java.Either_SynchronousQueueB
(boolean fair) A function that converts eithers to synchronous queues.Java.Either_TreeSetA()
A function that converts eithers to tree sets.Java.Either_TreeSetB()
A function that converts eithers to tree sets.Java.Either_VectorA()
A function that converts eithers to vectors.Java.Either_VectorB()
A function that converts eithers to vectors.Java.EnumSet_List()
A function that converts enum sets to lists.Java8.F_Function()
Conversions.F_SafeIO()
static <A,
B, C> F <F2<A, B, C>, BiFunction<A, B, C>> Java8.F2_BiFunction()
Stream.filter()
Returns a first-class version of the filter function.Tree.flatten_()
flatten :: Tree a -> [a] flatten t = squish t []
Tree.fmap_()
Provides a transformation to lift any function so that it maps over Trees.List.foldLeft()
Provides a first-class version of foldLeft.Provides a function that folds a tree with the given monoid.Stream.foldRight()
A first-class version of the foldRight function.Option.fromNull()
Turns an unsafe nullable value into a safe optional value.Option.fromSome()
Returns a function that takes an optional value to a value or errors if there is no value.List.fromString()
A first-classfromString
.Option.fromString()
Returns a function that transforms a string to an optional non-empty string, or no value if the string is empty.static <A> F
<Tree<A>, TreeZipper<A>> TreeZipper.fromTree()
First-class conversion of a Tree to the corresponding tree zipper.Java8.Function_F()
static <A,
B> F <A, B> Java8.Function_F
(Function<A, B> f) Java.Future_P1()
HashMap.get()
A curried version ofHashMap.get(Object)
.TreeMap.get()
Returns a first-class version of the get method for this TreeMap.Reader.getFunction()
Tree.getRoot()
Java.HashSet_List()
A function that converts hash sets to lists.List.head_()
First-class head function.Set.insert()
First-class insertion function.Set.intersect()
A first class function forSet.intersect(Set)
.List.isEmpty_()
Returns a function that determines whether a given list is empty.Stream.isEmpty_()
Returns a function that determines whether a given stream is empty.Option.isNone_()
A first-class version of the isNone method.List.isNotEmpty_()
Returns a function that determines whether a given list is not empty.Stream.isNotEmpty_()
Returns a function that determines whether a given stream is not empty.Option.isSome_()
A first-class version of the isSome method.Wraps a given function's return value in a Iterable.Stream.iterate()
A first-class version of the iterate function.Java.JavaList_List()
Array.join()
A first-class version of joinIterableW.join()
Returns a function that joins an Iterable of Iterables into a single Iterable.List.join()
A first-class version of joinOption.join()
First-class join function.Stream.join()
A first-class version of joinprivate static <A,
B, C> F <A, Trampoline<C>> DList.kleisliTrampCompose
(F<B, Trampoline<C>> bc, F<A, Trampoline<B>> ab) Either.left_()
A function that constructs a left value of either.Either3.left_()
static <A> F
<TreeZipper<A>, Option<TreeZipper<A>>> TreeZipper.left_()
A first-class version of the left() function.Either.leftMap_()
Return a function that maps a given function across this either's left projection.Either3.leftMap_()
List.length_()
First-class length.Promotes a function of arity-2 to a function on iterables.Promotes the given function of arity-2 to a function on lists.Promotes a function of arity-2 so that it operates over options.static <A> F
<BufferedReader, F<Iteratee.IterV<String, A>, IO<Iteratee.IterV<String, A>>>> IOFunctions.lineReader()
A function that feeds an iteratee with lines read from aBufferedReader
.static F
<LazyString, Stream<LazyString>> LazyString.lines_()
static <A> F
<LinkedBlockingQueue<A>, List<A>> Java.LinkedBlockingQueue_List()
A function that converts linked blocking queues to lists.static <A> F
<LinkedHashSet<A>, List<A>> Java.LinkedHashSet_List()
A function that converts linked hash sets to lists.static <A> F
<LinkedList<A>, List<A>> Java.LinkedList_List()
A function that converts linked lists to lists.Conversions.List_Array()
A function that converts lists to arrays.static <A> F
<List<A>, ArrayBlockingQueue<A>> Java.List_ArrayBlockingQueue
(boolean fair) A function that converts lists to array blocking queue.Java.List_ArrayList()
A function that converts lists to array lists.static <A> F
<List<A>, ConcurrentLinkedQueue<A>> Java.List_ConcurrentLinkedQueue()
A function that converts lists to concurrent linked queues.static <A> F
<List<A>, CopyOnWriteArrayList<A>> Java.List_CopyOnWriteArrayList()
A function that converts lists to copy on write array lists.static <A> F
<List<A>, CopyOnWriteArraySet<A>> Java.List_CopyOnWriteArraySet()
A function that converts lists to copy on write array sets.static <A extends Delayed>
F<List<A>, DelayQueue<A>> Java.List_DelayQueue()
A function that converts lists to delay queues.Conversions.List_Either()
A function that converts lists to eithers.Java.List_EnumSet()
A function that converts lists to array enum sets.Java.List_HashSet()
A function that converts lists to hash sets.static <A> F
<List<A>, LinkedBlockingQueue<A>> Java.List_LinkedBlockingQueue()
A function that converts lists to linked blocking queues.static <A> F
<List<A>, LinkedHashSet<A>> Java.List_LinkedHashSet()
A function that converts lists to linked hash sets.static <A> F
<List<A>, LinkedList<A>> Java.List_LinkedList()
A function that converts lists to linked lists.Conversions.List_Option()
A function that converts lists to options.static <A> F
<List<A>, PriorityBlockingQueue<A>> Java.List_PriorityBlockingQueue()
A function that converts lists to priority blocking queues.static <A> F
<List<A>, PriorityQueue<A>> Java.List_PriorityQueue()
A function that converts lists to priority queues.Java.List_Stack()
A function that converts lists to stacks.Conversions.List_Stream()
A function that converts lists to streams.static <A> F
<List<A>, SynchronousQueue<A>> Java.List_SynchronousQueue
(boolean fair) A function that converts lists to synchronous queues.Java.List_TreeSet()
A function that converts lists to stacks.Java.List_Vector()
A function that converts lists to vectors.Array.map()
First-class map function for Arrays.IterableW.map()
Returns a function that promotes any function so that it operates on Iterables.Option.map()
A first-class map function.List.map_()
Provides a first-class version of map()Stream.map_()
Provides a first-class version of the map function.Maps the given function of arity-2 across this list and returns a function that applies all the resulting functions to a given argument.Maps the given function of arity-2 across this stream and returns a function that applies all the resulting functions to a given argument.Set.member()
First-class membership check.Either3.middleMap_()
Set.minus()
A first class function forSet.minus(Set)
.Zipper.move()
A first-class version of the move function.static <A> F
<A, NonEmptyList<A>> NonEmptyList.nel()
Returns a function that puts an element into a non-empty list.Zipper.next_()
First-class version of the next() function.Tree.node()
First-class constructor of trees.Option.none_()
First-class catamorphism for Option: return a function that will performs a reduction on an optional value using the given arguments.Conversions.Option_Array()
A function that converts options to arrays.static <A> F
<Option<A>, ArrayBlockingQueue<A>> Java.Option_ArrayBlockingQueue
(boolean fair) A function that converts options to array blocking queues.Java.Option_ArrayList()
A function that converts options to array lists.static <A> F
<Option<A>, ConcurrentLinkedQueue<A>> Java.Option_ConcurrentLinkedQueue()
A function that converts options to concurrent linked queues.static <A> F
<Option<A>, CopyOnWriteArrayList<A>> Java.Option_CopyOnWriteArrayList()
A function that converts options to copy on write array lists.static <A> F
<Option<A>, CopyOnWriteArraySet<A>> Java.Option_CopyOnWriteArraySet()
A function that converts options to copy on write array sets.static <A extends Delayed>
F<Option<A>, DelayQueue<A>> Java.Option_DelayQueue()
A function that converts options to delay queues.Conversions.Option_Either()
A function that converts options to eithers.Java.Option_EnumSet()
A function that converts options to enum sets.Java.Option_HashSet()
A function that converts options to hash sets.static <A> F
<Option<A>, LinkedBlockingQueue<A>> Java.Option_LinkedBlockingQueue()
A function that converts options to linked blocking queues.static <A> F
<Option<A>, LinkedHashSet<A>> Java.Option_LinkedHashSet()
A function that converts options to linked hash sets.static <A> F
<Option<A>, LinkedList<A>> Java.Option_LinkedList()
A function that converts options to linked lists.Conversions.Option_List()
A function that converts options to lists.Java8.Option_Optional()
static <A> F
<Option<A>, PriorityBlockingQueue<A>> Java.Option_PriorityBlockingQueue()
A function that converts options to priority blocking queues.static <A> F
<Option<A>, PriorityQueue<A>> Java.Option_PriorityQueue()
A function that converts options to priority queues.static <A,
B> F <Either<A, B>, PriorityQueue<A>> Java.Option_PriorityQueueA()
A function that converts eithers to priority queues.static <A,
B> F <Either<A, B>, PriorityQueue<B>> Java.Option_PriorityQueueB()
A function that converts eithers to priority queues.Java.Option_Stack()
A function that converts options to stacks.Conversions.Option_Stream()
A function that converts options to streams.static <A> F
<Option<A>, SynchronousQueue<A>> Java.Option_SynchronousQueue
(boolean fair) A function that converts options to synchronous queues.Java.Option_TreeSet()
A function that converts options to tree sets.Java.Option_Vector()
A function that converts options to vectors.Java8.Optional_Option()
static <A> F
<TreeZipper<A>, P4<Tree<A>, Stream<Tree<A>>, Stream<Tree<A>>, Stream<P3<Stream<Tree<A>>, A, Stream<Tree<A>>>>>> TreeZipper.p_()
A first-class function that returns the product-4 representation of a given zipper.Zipper.p_()
A first-class function that yields the product-3 representation of a given Zipper.Java.P1_Callable()
Java8.P1_Supplier()
Enumerator.plus()
Returns a function that moves a value along the enumerator a given number of times.Enumerator.plus
(long l) Returns a function that moves a value along the enumerator a given number of times.Returns a function that moves a value along the enumerator a given number of times.Natural.pred_()
First-class predecessor function.Enumerator.predecessor()
Returns the potential predecessor of a value for this enumerator in curried form.Zipper.previous_()
First-class version of the previous() function.static <A> F
<PriorityBlockingQueue<A>, List<A>> Java.PriorityBlockingQueue_List()
A function that converts priority blocking queues to lists.static <A> F
<PriorityQueue<A>, List<A>> Java.PriorityQueue_List()
A function that converts priority queues to lists.Either.right_()
A function that constructs a right value of either.static <A> F
<TreeZipper<A>, Option<TreeZipper<A>>> TreeZipper.right_()
A first-class version of the right() function.Either.rightMap_()
Return a function that maps a given function across this either's right projection.Either3.rightMap_()
Tree.root_()
Provides a transformation from a tree to its root.static <A> F
<TreeZipper<A>, TreeZipper<A>> TreeZipper.root_()
A first-class version of the root function.Turn a list of functions into a function returning a list.Turn a stream of functions into a function returning a stream.Sequence the given list and collect the output as a function.Sequence the given option and collect the output as a function.Sequence the given seq and collect the output as a function.Sequence the given stream and collect the output as a function.static final <E,
C, B> F <C, Validation<E, B>> Validation.sequenceF
(Validation<E, F<C, B>> validation) Sequence the given validation and collect the output as a function.Stream.single()
Returns a function that yields a stream containing its argument.Option.some_()
Java.Stack_List()
A function that converts stacks to lists.static F
<LazyString, F<LazyString, Boolean>> LazyString.startsWith()
First-class prefix check.Conversions.Stream_Array()
A function that converts streams to arrays.static <A> F
<Stream<A>, ArrayBlockingQueue<A>> Java.Stream_ArrayBlockingQueue
(boolean fair) A function that converts streams to array blocking queues.Java.Stream_ArrayList()
A function that converts streams to array lists.static <A> F
<Stream<A>, ConcurrentLinkedQueue<A>> Java.Stream_ConcurrentLinkedQueue()
A function that converts streams to concurrent linked queues.static <A> F
<Stream<A>, CopyOnWriteArrayList<A>> Java.Stream_CopyOnWriteArrayList()
A function that converts streams to copy on write array lists.static <A> F
<Stream<A>, CopyOnWriteArraySet<A>> Java.Stream_CopyOnWriteArraySet()
A function that converts streams to copy on write array sets.static <A extends Delayed>
F<Stream<A>, DelayQueue<A>> Java.Stream_DelayQueue()
A function that converts streams to delay queues.Conversions.Stream_Either()
A function that converts streams to eithers.Java.Stream_EnumSet()
A function that converts streams to enum sets.Java.Stream_HashSet()
A function that converts streams to hash sets.Java.Stream_Iterable()
A function that converts streams to iterable.Java8.Stream_JavaStream()
static <A> F
<Stream<A>, LinkedBlockingQueue<A>> Java.Stream_LinkedBlockingQueue()
A function that converts streams to linked blocking queues.static <A> F
<Stream<A>, LinkedHashSet<A>> Java.Stream_LinkedHashSet()
A function that converts streams to linked hash sets.static <A> F
<Stream<A>, LinkedList<A>> Java.Stream_LinkedList()
A function that converts streams to linked lists.Conversions.Stream_List()
A function that converts streams to lists.Conversions.Stream_Option()
A function that converts streams to options.static <A> F
<Stream<A>, PriorityBlockingQueue<A>> Java.Stream_PriorityBlockingQueue()
A function that converts streams to priority blocking queues.static <A> F
<Stream<A>, PriorityQueue<A>> Java.Stream_PriorityQueue()
A function that converts streams to priority queues.Java.Stream_Stack()
A function that converts streams to stacks.static <A> F
<Stream<A>, SynchronousQueue<A>> Java.Stream_SynchronousQueue
(boolean fair) A function that converts streams to synchronous queues.Java.Stream_TreeSet()
A function that converts streams to tree sets.Java.Stream_Vector()
A function that converts streams to vectors.static F
<String, ArrayBlockingQueue<Character>> Java.String_ArrayBlockingQueue
(boolean fair) A function that converts strings to array blocking queues.Conversions.String_Either()
A function that converts string to eithers.static F
<String, SynchronousQueue<Character>> Java.String_SynchronousQueue
(boolean fair) A function that converts strings to synchronous queues.static F
<StringBuffer, ArrayBlockingQueue<Character>> Java.StringBuffer_ArrayBlockingQueue
(boolean fair) A function that converts string buffers to array blocking queues.Conversions.StringBuffer_Either()
A function that converts string buffers to eithers.static F
<StringBuffer, SynchronousQueue<Character>> Java.StringBuffer_SynchronousQueue
(boolean fair) A function that converts string buffers to synchronous queues.static F
<StringBuilder, ArrayBlockingQueue<Character>> Java.StringBuilder_ArrayBlockingQueue
(boolean fair) A function that converts string builders to array blocking queues.Conversions.StringBuilder_Either()
A function that converts string builders to eithers.static F
<StringBuilder, SynchronousQueue<Character>> Java.StringBuilder_SynchronousQueue
(boolean fair) A function that converts string builders to synchronous queues.Writer.stringLogger()
Tree.subForest_()
Provides a transformation from a tree to its subforest.Natural.succ_()
First-class successor function.Enumerator.successor()
Returns the potential successor of a value for this enumerator in curried form.Java8.Supplier_P1()
static <A> F
<SynchronousQueue<A>, List<A>> Java.SynchronousQueue_List()
A function that converts synchronous queues to lists.List.tail_()
First-class tail function.List.take()
Provides a first-class version of take.Option.toEither()
A first-class version of the toEither method.Stream.toFunction()
Converts this stream to a function of natural numbers.static <A> F
<NonEmptyList<A>, List<A>> NonEmptyList.toList_()
Returns a function that takes a non-empty list to a list.Traverse this list with the given function and collect the output as a function.Traverse this option with the given function and collect the output as a function.Traverse this seq with the given function and collect the output as a function.Traverse this stream with the given function and collect the output as a function.final <C,
B> F <C, Validation<E, B>> Traverse this validation with the given function and collect the output as a function.Java.TreeSet_List()
A function that converts tree sets to lists.static <A> F
<Tree<A>, F<Stream<Tree<A>>, F<Stream<Tree<A>>, F<Stream<P3<Stream<Tree<A>>, A, Stream<Tree<A>>>>, TreeZipper<A>>>>> TreeZipper.treeZipper()
First-class constructor for tree zippers.static <A,
B, Z extends IOException>
F<Try1<A, B, Z>, F<A, Validation<Z, B>>> Conversions.Try_F()
static <A,
B, Z extends IOException>
F<A, Validation<Z, B>> static <A,
B, Z extends IOException>
F<Try0<A, Z>, IO<A>> Conversions.Try_IO()
static <A,
B, Z extends Exception>
F<Try0<A, Z>, SafeIO<Validation<Z, A>>> Conversions.Try_SafeIO()
static <A,
E extends Exception>
F<Try0<A, E>, Supplier<Validation<E, A>>> Java8.TryCatch0_Supplier()
static <A,
B, E extends Exception>
F<Try1<A, B, E>, Function<A, Validation<E, B>>> Java8.TryCatch1_Function()
static <A,
B, C, E extends Exception>
F<Try2<A, B, C, E>, BiFunction<A, B, Validation<E, C>>> Java8.TryCatch2_BiFunction()
Tree.unfoldTree
(F<B, P2<A, P1<Stream<B>>>> f) Builds a tree from a seed value.Set.union()
A first class function forSet.union(Set)
.static F
<Stream<LazyString>, LazyString> LazyString.unlines_()
static <E,
T> F <Either<E, T>, Validation<E, T>> Validation.validation()
Returns a function that constructs a validation with an either.Java.Vector_List()
A function that converts vectors to lists.Array.wrap()
First-class wrapper function for arrays.IterableW.wrap()
Provides a function that wraps the given iterable.List.zip()
The first-class version of the zip function.List.zipWith()
Provides a first-class version of zipWithStream.zipWith()
A first-class version of the zipWith function.Partially-applied version of zipWith.Modifier and TypeMethodDescriptionConversions.Array_Either()
A function that converts arrays to eithers.IterableW.arrow()
Provides a transformation from a function to a Iterable-valued function that is equivalent to it.IterableW.arrow()
Provides a transformation from a function to a Iterable-valued function that is equivalent to it.IterableW.bind()
The first-class bind function over Iterable.IterableW.bind()
The first-class bind function over Iterable.Option.bind()
First-class bind function.Option.bind()
First-class bind function.List.bind_()
Provides a first-class version of bind()List.bind_()
Provides a first-class version of bind()Stream.bind_()
A first-class version of the bind function.Stream.bind_()
A first-class version of the bind function.static <A> F
<Reader, F<Iteratee.IterV<char[], A>, IO<Iteratee.IterV<char[], A>>>> IOFunctions.charChunkReader()
A function that feeds an iteratee with character chunks read from aReader
(char[] of sizeIOFunctions.DEFAULT_BUFFER_SIZE
).static <A> F
<Reader, F<Iteratee.IterV<Character, A>, IO<Iteratee.IterV<Character, A>>>> IOFunctions.charChunkReader2()
A function that feeds an iteratee with characters read from aReader
(chars are read in chunks of sizeIOFunctions.DEFAULT_BUFFER_SIZE
).List.cons()
Returns a function that prepends (cons) an element to a list to produce a new list.Stream.cons()
Returns a function that prepends (cons) an element to a stream to produce a new stream.Stream.cons_()
Returns a function that prepends (cons) an element to a stream to produce a new stream.Java8.Consumer_F()
Set.delete()
First-class deletion function.Conversions.Effect1_F()
Java8.F_Function()
Conversions.F_SafeIO()
Stream.filter()
Returns a first-class version of the filter function.Stream.filter()
Returns a first-class version of the filter function.static <A> F2
<F<Tree<A>, Boolean>, TreeZipper<A>, Option<TreeZipper<A>>> TreeZipper.findChild()
A first-class version of the findChild function.Tree.fmap_()
Provides a transformation to lift any function so that it maps over Trees.Tree.fmap_()
Provides a transformation to lift any function so that it maps over Trees.List.foldLeft()
Provides a first-class version of foldLeft.List.foldLeft()
Provides a first-class version of foldLeft.List.foldLeft()
Provides a first-class version of foldLeft.List.foldLeft()
Provides a first-class version of foldLeft.Stream.foldRight()
A first-class version of the foldRight function.Stream.foldRight()
A first-class version of the foldRight function.Stream.foldRight()
A first-class version of the foldRight function.Stream.foldRight()
A first-class version of the foldRight function.Java8.Function_F()
Option.iif()
First-class version of the iif function.Set.insert()
First-class insertion function.Set.intersect()
A first class function forSet.intersect(Set)
.Stream.iterate()
A first-class version of the iterate function.Stream.iterate()
A first-class version of the iterate function.Either.leftMap_()
Return a function that maps a given function across this either's left projection.Either.leftMap_()
Return a function that maps a given function across this either's left projection.Either3.leftMap_()
Promotes a function of arity-2 to a function on iterables.Promotes the given function of arity-2 to a function on lists.Promotes a function of arity-2 so that it operates over options.static <A> F
<BufferedReader, F<Iteratee.IterV<String, A>, IO<Iteratee.IterV<String, A>>>> IOFunctions.lineReader()
A function that feeds an iteratee with lines read from aBufferedReader
.Conversions.List_Either()
A function that converts lists to eithers.Array.map()
First-class map function for Arrays.Array.map()
First-class map function for Arrays.IterableW.map()
Returns a function that promotes any function so that it operates on Iterables.IterableW.map()
Returns a function that promotes any function so that it operates on Iterables.Option.map()
A first-class map function.Option.map()
A first-class map function.List.map_()
Provides a first-class version of map()List.map_()
Provides a first-class version of map()Stream.map_()
Provides a first-class version of the map function.Stream.map_()
Provides a first-class version of the map function.Set.member()
First-class membership check.Either3.middleMap_()
Set.minus()
A first class function forSet.minus(Set)
.Zipper.move()
A first-class version of the move function.Tree.node()
First-class constructor of trees.Conversions.Option_Either()
A function that converts options to eithers.Enumerator.plus()
Returns a function that moves a value along the enumerator a given number of times.Either.rightMap_()
Return a function that maps a given function across this either's right projection.Either.rightMap_()
Return a function that maps a given function across this either's right projection.Either3.rightMap_()
static F
<LazyString, F<LazyString, Boolean>> LazyString.startsWith()
First-class prefix check.Conversions.Stream_Either()
A function that converts streams to eithers.Conversions.String_Either()
A function that converts string to eithers.Conversions.StringBuffer_Either()
A function that converts string buffers to eithers.Conversions.StringBuilder_Either()
A function that converts string builders to eithers.List.take()
Provides a first-class version of take.Option.toEither()
A first-class version of the toEither method.Option.traverseSet()
static <A> F
<Tree<A>, F<Stream<Tree<A>>, F<Stream<Tree<A>>, F<Stream<P3<Stream<Tree<A>>, A, Stream<Tree<A>>>>, TreeZipper<A>>>>> TreeZipper.treeZipper()
First-class constructor for tree zippers.static <A> F
<Tree<A>, F<Stream<Tree<A>>, F<Stream<Tree<A>>, F<Stream<P3<Stream<Tree<A>>, A, Stream<Tree<A>>>>, TreeZipper<A>>>>> TreeZipper.treeZipper()
First-class constructor for tree zippers.static <A> F
<Tree<A>, F<Stream<Tree<A>>, F<Stream<Tree<A>>, F<Stream<P3<Stream<Tree<A>>, A, Stream<Tree<A>>>>, TreeZipper<A>>>>> TreeZipper.treeZipper()
First-class constructor for tree zippers.static <A,
B, Z extends IOException>
F<Try1<A, B, Z>, F<A, Validation<Z, B>>> Conversions.Try_F()
Set.union()
A first class function forSet.union(Set)
.List.zip()
The first-class version of the zip function.List.zipWith()
Provides a first-class version of zipWithList.zipWith()
Provides a first-class version of zipWithList.zipWith()
Provides a first-class version of zipWithList.zipWith()
Provides a first-class version of zipWithStream.zipWith()
A first-class version of the zipWith function.Stream.zipWith()
A first-class version of the zipWith function.Stream.zipWith()
A first-class version of the zipWith function.Stream.zipWith()
A first-class version of the zipWith function.Modifier and TypeMethodDescriptionfinal <B> Validation
<List<E>, B> Validation.accumulate
(F<T, B> f) final <A,
B, C, D, E$, F$, G, H>
Validation<E, H> Validation.accumulate
(Semigroup<E> s, Validation<E, A> va, Validation<E, B> vb, Validation<E, C> vc, Validation<E, D> vd, Validation<E, E$> ve, Validation<E, F$> vf, Validation<E, G> vg, F<T, F<A, F<B, F<C, F<D, F<E$, F<F$, F<G, H>>>>>>>> f) Accumulates errors on the failing side of this or any given validation if one or more are encountered, or applies the given function if all succeeded and returns that value on the successful side.final <A,
B, C, D, E$, F$, G>
Validation<E, G> Validation.accumulate
(Semigroup<E> s, Validation<E, A> va, Validation<E, B> vb, Validation<E, C> vc, Validation<E, D> vd, Validation<E, E$> ve, Validation<E, F$> vf, F<T, F<A, F<B, F<C, F<D, F<E$, F<F$, G>>>>>>> f) Accumulates errors on the failing side of this or any given validation if one or more are encountered, or applies the given function if all succeeded and returns that value on the successful side.final <A,
B, C, D, E$, F$>
Validation<E, F$> Validation.accumulate
(Semigroup<E> s, Validation<E, A> va, Validation<E, B> vb, Validation<E, C> vc, Validation<E, D> vd, Validation<E, E$> ve, F<T, F<A, F<B, F<C, F<D, F<E$, F$>>>>>> f) Accumulates errors on the failing side of this or any given validation if one or more are encountered, or applies the given function if all succeeded and returns that value on the successful side.final <A,
B, C, D, E$>
Validation<E, E$> Validation.accumulate
(Semigroup<E> s, Validation<E, A> va, Validation<E, B> vb, Validation<E, C> vc, Validation<E, D> vd, F<T, F<A, F<B, F<C, F<D, E$>>>>> f) Accumulates errors on the failing side of this or any given validation if one or more are encountered, or applies the given function if all succeeded and returns that value on the successful side.final <A,
B, C, D>
Validation<E, D> Validation.accumulate
(Semigroup<E> s, Validation<E, A> va, Validation<E, B> vb, Validation<E, C> vc, F<T, F<A, F<B, F<C, D>>>> f) Accumulates errors on the failing side of this or any given validation if one or more are encountered, or applies the given function if all succeeded and returns that value on the successful side.final <A,
B, C> Validation <E, C> Validation.accumulate
(Semigroup<E> s, Validation<E, A> va, Validation<E, B> vb, F<T, F<A, F<B, C>>> f) Accumulates errors on the failing side of this or any given validation if one or more are encountered, or applies the given function if all succeeded and returns that value on the successful side.final <A,
B> Validation <E, B> Validation.accumulate
(Semigroup<E> s, Validation<E, A> va, F<T, F<A, B>> f) Accumulates errors on the failing side of this or any given validation if one or more are encountered, or applies the given function if all succeeded and returns that value on the successful side.final <X,
Y> Either <X, Y> Map the given functions across the appropriate side.<B,
C> Array <C> Binds the given function across each element of this array and the given array with a final join.<B> Array
<B> Binds the given function across each element of this array with a final join.<B> Array
<B> Binds the given function across each element of this array with a final join.Binds the given function across this projection's value if it has one.Binds the given function across this projection's value if it has one.final <B> Eval
<B> default <B> IO
<B> static <A,
B> IO <B> Binds the given function across the wrapped Iterable with a final join.static <A,
B, C> IterableW <C> Binds the given function to the values in the given iterables with a final join.final <B> Iteratee.IterV
<E, B> Iteratee.IterV.bind
(F<A, Iteratee.IterV<E, B>> f) TODO more documentationLazyString.bind
(F<Character, LazyString> f) final <B,
C, D, E, F$, G, H, I>
List<I> List.bind
(List<B> lb, List<C> lc, List<D> ld, List<E> le, List<F$> lf, List<G> lg, List<H> lh, F<A, F<B, F<C, F<D, F<E, F<F$, F<G, F<H, I>>>>>>>> f) Binds the given function across each element of this list and the given lists with a final join.final <B,
C, D, E, F$, G, H>
List<H> List.bind
(List<B> lb, List<C> lc, List<D> ld, List<E> le, List<F$> lf, List<G> lg, F<A, F<B, F<C, F<D, F<E, F<F$, F<G, H>>>>>>> f) Binds the given function across each element of this list and the given lists with a final join.final <B,
C, D, E, F$, G>
List<G> List.bind
(List<B> lb, List<C> lc, List<D> ld, List<E> le, List<F$> lf, F<A, F<B, F<C, F<D, F<E, F<F$, G>>>>>> f) Binds the given function across each element of this list and the given lists with a final join.final <B,
C, D, E, F$>
List<F$> Binds the given function across each element of this list and the given lists with a final join.final <B,
C, D, E>
List<E> Binds the given function across each element of this list and the given lists with a final join.final <B,
C, D> List <D> Binds the given function across each element of this list and the given lists with a final join.final <B,
C> List <C> Binds the given function across each element of this list and the given list with a final join.final <B> List
<B> Binds the given function across each element of this list with a final join.<B> NonEmptyList
<B> NonEmptyList.bind
(F<A, NonEmptyList<B>> f) Binds the given function across each element of this list with a final join.final <B,
C, D, E, F$, G, H, I>
Option<I> Option.bind
(Option<B> ob, Option<C> oc, Option<D> od, Option<E> oe, Option<F$> of, Option<G> og, Option<H> oh, F<A, F<B, F<C, F<D, F<E, F<F$, F<G, F<H, I>>>>>>>> f) Binds the given function across the element of this optional value and the given optional value with a final join.final <B,
C, D, E, F$, G, H>
Option<H> Option.bind
(Option<B> ob, Option<C> oc, Option<D> od, Option<E> oe, Option<F$> of, Option<G> og, F<A, F<B, F<C, F<D, F<E, F<F$, F<G, H>>>>>>> f) Binds the given function across the element of this optional value and the given optional value with a final join.final <B,
C, D, E, F$, G>
Option<G> Option.bind
(Option<B> ob, Option<C> oc, Option<D> od, Option<E> oe, Option<F$> of, F<A, F<B, F<C, F<D, F<E, F<F$, G>>>>>> f) Binds the given function across the element of this optional value and the given optional value with a final join.final <B,
C, D, E, F$>
Option<F$> Binds the given function across the element of this optional value and the given optional value with a final join.final <B,
C, D, E>
Option<E> Binds the given function across the element of this optional value and the given optional value with a final join.final <B,
C, D> Option <D> Binds the given function across the element of this optional value and the given optional value with a final join.final <B,
C> Option <C> Binds the given function across the element of this optional value and the given optional value with a final join.final <B> Option
<B> Binds the given function across the element of this optional value with a final join.<B> Seq
<B> Bind the given function across this seq.final <B> Set
<B> Binds the given function across this set.Bind the given function across this state.final <B,
C, D, E, F$, G, H, I>
Stream<I> Stream.bind
(Stream<B> sb, Stream<C> sc, Stream<D> sd, Stream<E> se, Stream<F$> sf, Stream<G> sg, Stream<H> sh, F<A, F<B, F<C, F<D, F<E, F<F$, F<G, F<H, I>>>>>>>> f) Binds the given function across each element of this stream and the given streams with a final join.final <B,
C, D, E, F$, G, H>
Stream<H> Stream.bind
(Stream<B> sb, Stream<C> sc, Stream<D> sd, Stream<E> se, Stream<F$> sf, Stream<G> sg, F<A, F<B, F<C, F<D, F<E, F<F$, F<G, H>>>>>>> f) Binds the given function across each element of this stream and the given streams with a final join.final <B,
C, D, E, F$, G>
Stream<G> Stream.bind
(Stream<B> sb, Stream<C> sc, Stream<D> sd, Stream<E> se, Stream<F$> sf, F<A, F<B, F<C, F<D, F<E, F<F$, G>>>>>> f) Binds the given function across each element of this stream and the given streams with a final join.final <B,
C, D, E, F$>
Stream<F$> Binds the given function across each element of this stream and the given streams with a final join.final <B,
C, D, E>
Stream<E> Binds the given function across each element of this stream and the given streams with a final join.final <B,
C, D> Stream <D> Binds the given function across each element of this stream and the given streams with a final join.final <B,
C> Stream <C> Binds the given function across each element of this stream and the given stream with a final join.final <B> Stream
<B> Binds the given function across each element of this stream with a final join.final <A> Validation
<E, A> Validation.bind
(F<T, Validation<E, A>> f) Binds the given function across this validation's success value if it has one.<A> Validation
<A, T> Validation.FailProjection.bind
(F<E, Validation<A, T>> f) Binds the given function across this validation's failing value if it has one.static <A,
B> Tree <B> static <A,
B, C> IO <C> Returns a tuple where the first element is the longest prefix of this list that does not satisfy the given predicate and the second element is the remainder of the list.final <B> Stream
<B> Binds the given function across the stream of substreams of this stream.<B> Tree
<B> Applies the given function to all subtrees of this tree, returning a tree of the results (comonad pattern).<B> TreeZipper
<B> TreeZipper.cobind
(F<TreeZipper<A>, B> f) Maps the given function over the tree of all positions for this zipper (comonad pattern).<B> Zipper
<B> Maps over variations of this zipper, such that the given function is applied to each variation (comonad pattern).static <E,
A> Iteratee.IterV <E, A> Iteratee.IterV.cont
(F<Iteratee.Input<E>, Iteratee.IterV<E, A>> f) A computation that takes an element from an input to yield a new computationstatic <A> DList
<A> DList.dlist
(F<List<A>, Trampoline<List<A>>> f) Creates a DList from the function For alternatives functions to create a DList:Removes elements from the head of this list that do not match the given predicate function until an element is found that does match or the list is exhausted.Removes elements from the head of this stream that do not match the given predicate function until an element is found that does match or the stream is exhausted.abstract <X> X
The catamorphism for either.<X> X
<X> X
abstract <D> D
<D> D
<D> D
<D> D
First class catamorphism for either.static <A> Enumerator
<A> Enumerator.enumerator
(F<A, Option<A>> successor, F<A, Option<A>> predecessor, Option<A> max, Option<A> min, Ord<A> order) Construct an enumerator.static <A> Enumerator
<A> Enumerator.enumerator
(F<A, Option<A>> successor, F<A, Option<A>> predecessor, Option<A> max, Option<A> min, Ord<A> order, F<A, F<Long, Option<A>>> plus) Construct an enumerator.boolean
Returnstrue
if the predicate holds for at least one of the elements of this array,false
otherwise (false
for the empty array).boolean
Returnsfalse
if no value or returns the result of the application of the given function to the value.boolean
Returnsfalse
if no value or returns the result of the application of the given function to the value.boolean
boolean
boolean
final boolean
Returnstrue
if the predicate holds for at least one of the elements of this list,false
otherwise (false
for the empty list).final boolean
Returnstrue
is this optional value has a value and the given predicate function holds on that value,false
otherwise.final boolean
Returnstrue
if the predicate holds for at least one of the elements of this stream,false
otherwise (false
for the empty stream).final boolean
Returnsfalse
if this is a failure or returns the result of the application of the given function to the success value.boolean
Returnsfalse
if this is a success or returns the result of the application of the given function to the failing value.static <A,
B> Function <A, B> Java8.F_Function
(F<A, B> f) static <A> SafeIO
<A> Filters elements from this array by returning only elements which producetrue
when the given function is applied to them.Filters elements from this array by returning only elements which producetrue
when the given function is applied to them.ReturnsNone
if this projection has no value or if the given predicatep
does not hold for the value, otherwise, returns a right inSome
.ReturnsNone
if this projection has no value or if the given predicatep
does not hold for the value, otherwise, returns a left inSome
.Filters elements from this list by returning only elements which producetrue
when the given function is applied to them.Filters elements from this optional value by returning only elements which producetrue
when the given function is applied to them.Filters elements from this set by returning only elements which producetrue
when the given function is applied to them.Filters elements from this stream by returning only elements which producetrue
when the given function is applied to them.<A> Option
<Validation<E, A>> ReturnsNone
if this is a success or if the given predicatep
does not hold for the failing value, otherwise, returns a fail inSome
.final <A> Option
<Validation<A, T>> ReturnsNone
if this is a failure or if the given predicatep
does not hold for the success value, otherwise, returns a success inSome
.PriorityQueue.filterKeys
(F<K, Boolean> f) Filters the nodes based on the annotation of each node.PriorityQueue.filterValues
(F<A, Boolean> f) Filters nodes based on the value inside each node.Finds the first occurrence of an element that matches the given predicate or no value if no elements match.Finds the first occurrence of an element that matches the given predicate or no value if no elements match.Finds the first occurrence of an element that matches the given predicate or no value if no elements match.Moves the focus to the element matching the given predicate, if present.Navigates to the first child of the current location, that satisfies the given predicate.final <B> Eval
<B> Alias forEval.bind(F)
.static <A,
B> IO <B> static <S,
A, B> State <S, B> Bind the given function across this state.<B> Tree
<B> Maps the given function over this tree.abstract <Z> Z
Iteratee.IterV.fold
(F<P2<A, Iteratee.Input<E>>, Z> done, F<F<Iteratee.Input<E>, Iteratee.IterV<E, A>>, Z> cont) <B> B
Performs a left-fold reduction across this array.<B> B
Performs a left-fold reduction across this array.<B> B
The catamorphism for Iterables, implemented as a left fold.final <B> B
Performs a left-fold reduction across this list.final <B> B
Performs a left-fold reduction across this stream.Takes the first 2 elements of the iterable and applies the function to them, then applies the function to the result and the third element and so on.final A
Takes the first 2 elements of the list and applies the function to them, then applies the function to the result and the third element and so on.final A
Performs a left-fold reduction across this list.final A
Takes the first 2 elements of the stream and applies the function to them, then applies the function to the result and the third element and so on.final <B> B
Folds this Set using the given monoid.<B> B
Folds this tree using the given monoid.Provides a function that folds a tree with the given monoid.final <B> B
Set.foldMapRight
(F<A, B> f, Monoid<B> m) Folds this Set from the right using the given monoid.<B> B
Performs a right-fold reduction across this array.<B> B
Performs a right-fold reduction across this array.final <B> B
Performs a right-fold reduction across this list.final <B> B
Performs a right-fold reduction across this stream.<B> B
Performs a right-fold reduction across this zipper.final A
Performs a right-fold reduction across this list.final <B> B
Stream.foldRight1
(F<A, F<B, B>> f, B b) Performs a right-fold reduction across this stream.boolean
Returnstrue
if the predicate holds for all of the elements of this array,false
otherwise (true
for the empty array).boolean
Returnstrue
if no value or returns the result of the application of the given function to the value.boolean
Returnstrue
if no value or returns the result of the application of the given function to the value.boolean
boolean
boolean
final boolean
Returnstrue
if the predicate holds for all of the elements of this list,false
otherwise (true
for the empty list).final boolean
Returnstrue
if this optional value has no value, or the predicate holds for the given predicate function,false
otherwise.final boolean
Returnstrue
if the predicate holds for all of the elements of this stream,false
otherwise (true
for the empty stream).boolean
Returnstrue
if this is a success or returns the result of the application of the given function to the failing value.final boolean
Returnstrue
if this is a failure or returns the result of the application of the given function to the success value.Performs a side-effect for each element of this array.Performs a side-effect for each element of this array.Execute a side-effect on this projection's value if it has one.Execute a side-effect on this projection's value if it has one.void
final Unit
Performs a side-effect for each element of this list.final Unit
Performs a side-effect for the value of this optional value.final Unit
Performs a side-effect for each element of this stream.Executes a side-effect on the failing value if there is one.final Unit
Executes a side-effect on the success value if there is one.static <A,
B> Stream <A> Stream.fromFunction
(Enumerator<B> e, F<B, A> f, B i) Converts a function of an enumerable type to a stream of the results of that function, starting at the given index.static <A> Stream
<A> Stream.fromFunction
(F<Natural, A> f) Converts a function of natural numbers to a stream.static <S,
A> State <S, A> final <B,
C, D> TreeMap <B, D> List.groupBy
(F<A, B> keyFunction, F<A, C> valueFunction, D groupingIdentity, F2<C, D, D> groupingAcc, Ord<B> keyOrd) Groups the elements of this list by a given keyFunction, applies the valueFunction and accumulates the mapped values with the given grouping accumulator function on the grouping identity.final <B,
C> TreeMap <B, C> Groups the elements of this list by a given keyFunction into aTreeMap
and transforms the matching elements with the given valueFunction.Groups the elements of this list by a given keyFunction into aTreeMap
and transforms the matching elements with the given valueFunction.Groups the elements of this list by a given keyFunction into aTreeMap
.static <A> Option
<A> Returns an optional value that has a value of the given argument, if the given predicate holds on that argument, otherwise, returns no value.Returns the position of the first element matching the given predicate, if any.Inserts the given element before the first element that is greater than or equal to it according to the given ordering.IO.interact
(F<LazyString, LazyString> f) IOFunctions.interact
(F<LazyString, LazyString> f) Read lines from stdin until condition is not met, transforming each line and printing the result to stdout.Wraps a given function's return value in a Iterable.static <A> Stream
<A> Returns a stream constructed by applying the given iteration function starting at the given value.static <A> List
<A> List.iterateWhile
(F<A, A> f, F<A, Boolean> p, A a) Creates a list where the first item is calculated by applying the function on the third argument, the second item by applying the function on the previous result and so on.static <A> Stream
<A> Stream.iterateWhile
(F<A, A> f, F<A, Boolean> p, A a) Creates a stream where the first item is calculated by applying the function on the third argument, the second item by applying the function on the previous result and so on.private static <A,
B, C> F <A, Trampoline<C>> DList.kleisliTrampCompose
(F<B, Trampoline<C>> bc, F<A, Trampoline<B>> ab) static <A> IO
<A> static <A> SafeIO
<A> Map the given function across this either's left projection.Promotes a function of arity-2 to a function on iterables.Promotes the given function of arity-2 to a function on lists.Promotes a function of arity-2 so that it operates over options.<B> Array
<B> Maps the given function across this array.<B> Array
<B> Maps the given function across this array.Map the given function across this projection's value if it has one.Map the given function across this projection's value if it has one.final <B> Eval
<B> <A,
B> HashMap <A, B> <A,
B> HashMap <A, B> <A,
B> HashMap <A, B> <A,
B> HashMap <A, B> default <B> IO
<B> static <A,
B> IO <B> <B> IterableW
<B> Maps a given function across the wrapped Iterable.final <B> List
<B> Maps the given function across this list.<B> NonEmptyList
<B> Maps the given function across this list.final <B> Option
<B> Maps the given function across this optional value.<B> PriorityQueue
<K, B> Maps the values in each node with function f.<B> Seq
<B> final <B> Set
<B> Maps the given function across this set.final <B> Stream
<B> Maps the given function across this stream.Maps the given function across the values of this TreeMap.<B> TreeZipper
<B> Maps the given function across this zipper (covariant functor pattern).<A> Validation
<A, T> Maps the given function across the failing side of this validation.final <A> Validation
<E, A> Maps the given function across the success side of this validation.<B> Zipper
<B> Maps the given function across the elements of this zipper (covariant functor pattern).<X,
Y, Z> Either3 <X, Y, Z> Maps the given function of arity-2 across this list and returns a function that applies all the resulting functions to a given argument.Maps the given function of arity-2 across this stream and returns a function that applies all the resulting functions to a given argument.List.mapMOption
(F<A, Option<B>> f) Maps the given function across this list by binding through the Option monad.final <B> Trampoline
<List<B>> List.mapMTrampoline
(F<A, Trampoline<B>> f) Maps the given function across this list by binding through the Trampoline monad.<B> NonEmptyList
<B> NonEmptyList.mapTails
(F<NonEmptyList<A>, B> f) Maps the given function across the tails of this list (comonad pattern).TreeZipper.modifyLabel
(F<A, A> f) Modifies the label at the current node with the given function.Modifies the current node with the given function.The value of this projection or the result of the given function on the opposing projection's value.The value of this projection or the result of the given function on the opposing projection's value.The failing value or the application of the given function to the success value.final T
The success value or the application of the given function to the failing value.final <B> B
Performs a reduction on this optional value using the given arguments.final <B> B
Performs a reduction on this optional value using the given arguments.First-class catamorphism for Option: return a function that will performs a reduction on an optional value using the given arguments.Partitions the list into a tuple where the first element contains the items that satisfy the the predicate f and the second element contains the items that does not.Filters elements from this list by returning only elements which producefalse
when the given function is applied to them.Filters elements from this stream by returning only elements which producefalse
when the given function is applied to them.Returns a new stream resulting from replacing all elements that match the given predicate with the given element.Map the given function across this either's right.<B> Array
<B> Performs a fold left accummulating and returns an array of the intermediate results.Performs a left-fold accummulating using first array element as a starting value and returns an array of the intermediate results.<B> Array
<B> Performs a right-fold accummulating and returns an array of the intermediate results.Performs a right-fold accummulating using last array element as a starting value and returns an array of the intermediate results.IOFunctions.sequenceWhile
(Stream<IO<A>> stream, F<A, Boolean> f) IOFunctions.sequenceWhileEager
(Stream<IO<A>> stream, F<A, Boolean> f) Returns a tuple where the first element is the longest prefix of this list that satisfies the given predicate and the second element is the remainder of the list.Returns a tuple where the first element is the longest prefix of this stream that satisfies the given predicate and the second element is the remainder of the stream.Splits this lazy string by characters matching the given predicate.Returns a tuple where the first element is the longest prefix of this stream that does not satisfy the given predicate and the second element is the remainder of the stream.private static <S,
A> State <S, A> State.suspended
(F<S, Trampoline<P2<S, A>>> runF) Returns the first elements of the head of this list that match the given predicate function.Returns the first elements of the head of this stream that match the given predicate function.Map each element of a structure to an action, evaluate these actions from left to right and collect the results.List.traverseEither
(F<A, Either<E, B>> f) Traverse through the List with given function.Option.traverseEither
(F<A, Either<L, B>> f) Traverse this option with the given function and collect the output on the right side of an either.Seq.traverseEither
(F<A, Either<L, B>> f) Traverse this seq with the given function and collect the output on the right side of an either.Stream.traverseEither
(F<A, Either<L, B>> f) Traverse this stream with the given function and collect the output on the right side of an either.List.traverseEitherLeft
(F<A, Either<B, R>> f) Traverse this list with the given function and collect the output on the left side of an either.Option.traverseEitherLeft
(F<A, Either<B, R>> f) Traverse this option with the given function and collect the output on the left side of an either.Seq.traverseEitherLeft
(F<A, Either<B, R>> f) Traverse this seq with the given function and collect the output on the left side of an either.Stream.traverseEitherLeft
(F<A, Either<B, R>> f) Traverse this stream with the given function and collect the output on the left side of an either.final <R,
C> Either <Validation<E, C>, R> Validation.traverseEitherLeft
(F<T, Either<C, R>> f) Traverse this validation with the given function and collect the output on the left side of an either.List.traverseEitherRight
(F<A, Either<L, B>> f) Traverse this list with the given function and collect the output on the right side of an either.Option.traverseEitherRight
(F<A, Either<L, B>> f) Traverse this option with the given function and collect the output on the right side of an either.Seq.traverseEitherRight
(F<A, Either<L, B>> f) Traverse this seq with the given function and collect the output on the right side of an either.Stream.traverseEitherRight
(F<A, Either<L, B>> f) Traverse this stream with the given function and collect the output on the right side of an either.final <L,
C> Either <L, Validation<E, C>> Validation.traverseEitherRight
(F<T, Either<L, C>> f) Traverse this validation with the given function and collect the output on the right side of an either.Traverse this list with the given function and collect the output as a function.Traverse this option with the given function and collect the output as a function.Traverse this seq with the given function and collect the output as a function.Traverse this stream with the given function and collect the output as a function.final <C,
B> F <C, Validation<E, B>> Traverse this validation with the given function and collect the output as a function.Either.LeftProjection.traverseIO
(F<A, IO<C>> f) Anonymous bind through this projection.Either.RightProjection.traverseIO
(F<B, IO<C>> f) Traverse with a function that has IO effectEither3.LeftProjection.traverseIO
(F<A, IO<X>> f) Either3.MiddleProjection.traverseIO
(F<B, IO<X>> f) Either3.RightProjection.traverseIO
(F<C, IO<X>> f) List.traverseIO
(F<A, IO<B>> f) Traverse this list with the given function and collect the output as an IO.Option.traverseIO
(F<A, IO<B>> f) Traverse this option with the given function and collect the output as an IO.Seq.traverseIO
(F<A, IO<B>> f) Traverse this seq with the given function and collect the output as an IO.Stream.traverseIO
(F<A, IO<B>> f) Traverse this stream with the given function and collect the output as an IO.final <C> IO
<Validation<E, C>> Validation.traverseIO
(F<T, IO<C>> f) Traverse this validation with the given function and collect the output as an IO.Either.traverseIOLeft
(F<A, IO<C>> f) Traversable instance of LeftProjection of Either for IO.Either.traverseIORight
(F<B, IO<C>> f) Traversable instance of RightProjection of Either for IO.Either.LeftProjection.traverseList
(F<A, List<C>> f) Traverse with function that produces List (non-determinism).Either.RightProjection.traverseList
(F<B, List<C>> f) Traverse with function that produces List (non-determinism).List.traverseList
(F<A, List<B>> f) Traverse this list with the given function and collect the output as a list.Option.traverseList
(F<A, List<B>> f) Traverse this option with the given function and collect the output as a list.Seq.traverseList
(F<A, List<B>> f) Traverse this seq with the given function and collect the output as a list.Stream.traverseList
(F<A, List<B>> f) Traverse this stream with the given function and collect the output as a list.final <C> List
<Validation<E, C>> Validation.traverseList
(F<T, List<C>> f) Traverse this validation with the given function and collect the output as a list.Either3.LeftProjection.traverseList1
(F<A, List<X>> f) Either3.MiddleProjection.traverseList1
(F<B, List<X>> f) Either3.RightProjection.traverseList1
(F<C, List<X>> f) Either.traverseListLeft
(F<A, List<C>> f) Traversable instance of LeftProjection of Either for List.Either.traverseListRight
(F<B, List<C>> f) Traversable instance of RightProjection of Either for List.Either.LeftProjection.traverseOption
(F<A, Option<C>> f) Either.RightProjection.traverseOption
(F<B, Option<C>> f) Traverse this right with the given function and collect the output as an option.Either3.LeftProjection.traverseOption
(F<A, Option<X>> f) Either3.MiddleProjection.traverseOption
(F<B, Option<X>> f) Either3.RightProjection.traverseOption
(F<C, Option<X>> f) List.traverseOption
(F<A, Option<B>> f) Traverses through the List with the given functionOption.traverseOption
(F<A, Option<B>> f) Traverse this option with the given function and collect the output as an option.Seq.traverseOption
(F<A, Option<B>> f) Traverses through the Seq with the given functionStream.traverseOption
(F<A, Option<B>> f) Traverses through the Seq with the given functionfinal <C> Option
<Validation<E, C>> Validation.traverseOption
(F<T, Option<C>> f) Traverse this validation with the given function and collect the output as an option.Either.traverseOptionLeft
(F<A, Option<C>> f) Traversable instance of LeftProjection of Either for Option.Either.traverseOptionRight
(F<B, Option<C>> f) Traversable instance of RightProjection of Either for Option.Either.LeftProjection.traverseP1
(F<A, P1<C>> f) Traverse this left with the given function and collect the output as a p1.Either.RightProjection.traverseP1
(F<B, P1<C>> f) Traverse this right with the given function and collect the output as a p1.Either3.LeftProjection.traverseP1
(F<A, P1<X>> f) Either3.MiddleProjection.traverseP1
(F<B, P1<X>> f) Either3.RightProjection.traverseP1
(F<C, P1<X>> f) List.traverseP1
(F<A, P1<B>> f) Traverse this list with the given function and collect the output as a p1.Option.traverseP1
(F<A, P1<B>> f) Traverse this option with the given function and collect the output as a P1.Seq.traverseP1
(F<A, P1<B>> f) Traverse this seq with the given function and collect the output as a p1.Stream.traverseP1
(F<A, P1<B>> f) Traverse this stream with the given function and collect the output as a p1.final <C> P1
<Validation<E, C>> Validation.traverseP1
(F<T, P1<C>> f) Traverse this validation with the given function and collect the output as a P1.List.traversePromise
(F<A, Promise<B>> f) List.traverseSeq
(F<A, Seq<B>> f) Traverse this list with the given function and collect the output as a seq.Option.traverseSeq
(F<A, Seq<B>> f) Traverse this option with the given function and collect the output a seq.Seq.traverseSeq
(F<A, Seq<B>> f) Traverse this seq with the given function and collect the output as a seq.Stream.traverseSeq
(F<A, Seq<B>> f) Traverse this stream with the given function and collect the output as a seq.final <C> Seq
<Validation<E, C>> Validation.traverseSeq
(F<T, Seq<C>> f) Traverse this validation with the given function and collect the output as a seq.List.traverseSet
(Ord<B> ord, F<A, Set<B>> f) Traverse this list with the given function and collect the output as a set; use the given ord to order the set.Option.traverseSet
(Ord<B> ord, F<A, Set<B>> f) Traverse this option with the given function and collect the output as a set; use the given ord to order the set.Seq.traverseSet
(Ord<B> ord, F<A, Set<B>> f) Traverse this seq with the given function and collect the output as a set; use the given ord to order the set.Stream.traverseSet
(Ord<B> ord, F<A, Set<B>> f) Traverse this stream with the given function and collect the output as a set; use the given ord to order the set.final <C> Set
<Validation<E, C>> Traverse this validation with the given function and collect the output as a set; use the given success and failure value ords to order the set.Either.LeftProjection.traverseStream
(F<A, Stream<C>> f) Either.RightProjection.traverseStream
(F<B, Stream<C>> f) Either3.LeftProjection.traverseStream
(F<A, Stream<X>> f) Either3.MiddleProjection.traverseStream
(F<B, Stream<X>> f) Either3.RightProjection.traverseStream
(F<C, Stream<X>> f) List.traverseStream
(F<A, Stream<B>> f) Traverse this list with the given function and collect the output as a stream.Option.traverseStream
(F<A, Stream<B>> f) Traverse this option with the given function and collect the output as a stream.Seq.traverseStream
(F<A, Stream<B>> f) Traverse this seq with the given function and collect the output as a stream.Stream.traverseStream
(F<A, Stream<B>> f) Traverse this stream with the given function and collect the output as a stream.final <C> Stream
<Validation<E, C>> Validation.traverseStream
(F<T, Stream<C>> f) Traverse this validation with the given function and collect the output as a stream.Either.traverseStreamLeft
(F<A, Stream<C>> f) Traversable instance of LeftProjection of Either for Stream.Either.traverseStreamRight
(F<B, Stream<C>> f) Traversable instance of RightProjection of Either for Stream.final <B> Trampoline
<List<B>> List.traverseTrampoline
(F<A, Trampoline<B>> f) Traverse this list with the given function and collect the output as a trampoline.final <B> Trampoline
<Option<B>> Option.traverseTrampoline
(F<A, Trampoline<B>> f) Traverse this option with the given function and collect the output as a trampoline.<B> Trampoline
<Seq<B>> Seq.traverseTrampoline
(F<A, Trampoline<B>> f) Traverse this seq with the given function and collect the output as a trampoline.<B> Trampoline
<Stream<B>> Stream.traverseTrampoline
(F<A, Trampoline<B>> f) Traverse this stream with the given function and collect the output as a trampoline.final <C> Trampoline
<Validation<E, C>> Validation.traverseTrampoline
(F<T, Trampoline<C>> f) Traverse this validation with the given function and collect the output as a trampoline.List.traverseV2
(F<A, V2<B>> f) final <E,
B> Validation <E, List<B>> List.traverseValidation
(Semigroup<E> s, F<A, Validation<E, B>> f) Traverse this list with the given function and collect the output as a validation; use the given semigroup to reduce the errors.final <E,
B> Validation <E, Option<B>> Option.traverseValidation
(F<A, Validation<E, B>> f) Traverse this option with the given function and collect the output as a validation.<E,
B> Validation <E, Seq<B>> Seq.traverseValidation
(F<A, Validation<E, B>> f) Traverse this seq with the given function and collect the output as a validation.<E,
B> Validation <E, Seq<B>> Seq.traverseValidation
(Semigroup<E> semigroup, F<A, Validation<E, B>> f) Traverse this seq with the given function and collect the output as a validation; use the given semigroup to reduce the errors.final <E,
B> Validation <E, Stream<B>> Stream.traverseValidation
(F<A, Validation<E, B>> f) Traverse this stream with the given function and collect the output as a validation.final <E,
B> Validation <E, Stream<B>> Stream.traverseValidation
(Semigroup<E> semigroup, F<A, Validation<E, B>> f) Traverse this stream with the given function and collect the output as a validation; use the given semigroup to reduce the errors.final <E1,
C> Validation <E1, Validation<E, C>> Validation.traverseValidation
(F<T, Validation<E1, C>> f) Traverse this validation with the given function and collect the output as a validation.private Stream
<Tree<TreeZipper<A>>> TreeZipper.uf
(F<TreeZipper<A>, Option<TreeZipper<A>>> f) final <B> B
Performs a reduction on this stream using the given arguments.static <A,
B> List <A> Unfolds across the given function starting at the given value to produce a list.static <A,
B> Stream <A> Unfolds across the given function starting at the given value to produce a stream.Tree.unfoldTree
(F<B, P2<A, P1<Stream<B>>>> f) Builds a tree from a seed value.static <A,
B> Reader <A, B> static <S,
A> State <S, A> static <S> State
<S, S> Updates, with the given function, the first element in the set that is equal to the given element, according to the order.Modifies the value for the given key, if present, by applying the given function to it.Modifies the value for the given key, if present, by applying the given function to it, or inserts the given value if the key is not present.final <X> X
Validation.validation
(F<E, X> fail, F<T, X> success) The catamorphism for validation.<B> Enumerator
<B> Invariant functor map over this enumerator.<B,
C> Array <C> Zips this array with the given array using the given function to produce a new array.<B,
C> Iterable <C> Zips this iterable with the given iterable using the given function to produce a new iterable.final <B,
C> List <C> Zips this list with the given list using the given function to produce a new list.<B,
C> NonEmptyList <C> Zips this non empty list with the given non empty list using the given function to produce a new list.final <B,
C> Stream <C> Zips this stream with the given stream using the given function to produce a new stream.Partially-applied version of zipWith.<B,
C> Tree <C> Zips this tree with another, using the given function.<B,
C> TreeZipper <C> TreeZipper.zipWith
(TreeZipper<B> bs, F<A, F<B, C>> f) Zips this TreeZipper with another, applying the given function lock-step over both zippers in all directions.<B,
C> Zipper <C> Zips this Zipper with another, applying the given function lock-step over both zippers in both directions.Modifier and TypeMethodDescriptionfinal <A> Validation
<E, A> Validation.accumapply
(Semigroup<E> s, Validation<E, F<T, A>> v) Function application on the successful side of this validation, or accumulating the errors on the failing side using the given semigroup should one or more be encountered.final <A,
B, C, D, E$, F$, G, H>
Validation<E, H> Validation.accumulate
(Semigroup<E> s, Validation<E, A> va, Validation<E, B> vb, Validation<E, C> vc, Validation<E, D> vd, Validation<E, E$> ve, Validation<E, F$> vf, Validation<E, G> vg, F<T, F<A, F<B, F<C, F<D, F<E$, F<F$, F<G, H>>>>>>>> f) Accumulates errors on the failing side of this or any given validation if one or more are encountered, or applies the given function if all succeeded and returns that value on the successful side.final <A,
B, C, D, E$, F$, G, H>
Validation<E, H> Validation.accumulate
(Semigroup<E> s, Validation<E, A> va, Validation<E, B> vb, Validation<E, C> vc, Validation<E, D> vd, Validation<E, E$> ve, Validation<E, F$> vf, Validation<E, G> vg, F<T, F<A, F<B, F<C, F<D, F<E$, F<F$, F<G, H>>>>>>>> f) Accumulates errors on the failing side of this or any given validation if one or more are encountered, or applies the given function if all succeeded and returns that value on the successful side.final <A,
B, C, D, E$, F$, G, H>
Validation<E, H> Validation.accumulate
(Semigroup<E> s, Validation<E, A> va, Validation<E, B> vb, Validation<E, C> vc, Validation<E, D> vd, Validation<E, E$> ve, Validation<E, F$> vf, Validation<E, G> vg, F<T, F<A, F<B, F<C, F<D, F<E$, F<F$, F<G, H>>>>>>>> f) Accumulates errors on the failing side of this or any given validation if one or more are encountered, or applies the given function if all succeeded and returns that value on the successful side.final <A,
B, C, D, E$, F$, G, H>
Validation<E, H> Validation.accumulate
(Semigroup<E> s, Validation<E, A> va, Validation<E, B> vb, Validation<E, C> vc, Validation<E, D> vd, Validation<E, E$> ve, Validation<E, F$> vf, Validation<E, G> vg, F<T, F<A, F<B, F<C, F<D, F<E$, F<F$, F<G, H>>>>>>>> f) Accumulates errors on the failing side of this or any given validation if one or more are encountered, or applies the given function if all succeeded and returns that value on the successful side.final <A,
B, C, D, E$, F$, G, H>
Validation<E, H> Validation.accumulate
(Semigroup<E> s, Validation<E, A> va, Validation<E, B> vb, Validation<E, C> vc, Validation<E, D> vd, Validation<E, E$> ve, Validation<E, F$> vf, Validation<E, G> vg, F<T, F<A, F<B, F<C, F<D, F<E$, F<F$, F<G, H>>>>>>>> f) Accumulates errors on the failing side of this or any given validation if one or more are encountered, or applies the given function if all succeeded and returns that value on the successful side.final <A,
B, C, D, E$, F$, G, H>
Validation<E, H> Validation.accumulate
(Semigroup<E> s, Validation<E, A> va, Validation<E, B> vb, Validation<E, C> vc, Validation<E, D> vd, Validation<E, E$> ve, Validation<E, F$> vf, Validation<E, G> vg, F<T, F<A, F<B, F<C, F<D, F<E$, F<F$, F<G, H>>>>>>>> f) Accumulates errors on the failing side of this or any given validation if one or more are encountered, or applies the given function if all succeeded and returns that value on the successful side.final <A,
B, C, D, E$, F$, G, H>
Validation<E, H> Validation.accumulate
(Semigroup<E> s, Validation<E, A> va, Validation<E, B> vb, Validation<E, C> vc, Validation<E, D> vd, Validation<E, E$> ve, Validation<E, F$> vf, Validation<E, G> vg, F<T, F<A, F<B, F<C, F<D, F<E$, F<F$, F<G, H>>>>>>>> f) Accumulates errors on the failing side of this or any given validation if one or more are encountered, or applies the given function if all succeeded and returns that value on the successful side.final <A,
B, C, D, E$, F$, G>
Validation<E, G> Validation.accumulate
(Semigroup<E> s, Validation<E, A> va, Validation<E, B> vb, Validation<E, C> vc, Validation<E, D> vd, Validation<E, E$> ve, Validation<E, F$> vf, F<T, F<A, F<B, F<C, F<D, F<E$, F<F$, G>>>>>>> f) Accumulates errors on the failing side of this or any given validation if one or more are encountered, or applies the given function if all succeeded and returns that value on the successful side.final <A,
B, C, D, E$, F$, G>
Validation<E, G> Validation.accumulate
(Semigroup<E> s, Validation<E, A> va, Validation<E, B> vb, Validation<E, C> vc, Validation<E, D> vd, Validation<E, E$> ve, Validation<E, F$> vf, F<T, F<A, F<B, F<C, F<D, F<E$, F<F$, G>>>>>>> f) Accumulates errors on the failing side of this or any given validation if one or more are encountered, or applies the given function if all succeeded and returns that value on the successful side.final <A,
B, C, D, E$, F$, G>
Validation<E, G> Validation.accumulate
(Semigroup<E> s, Validation<E, A> va, Validation<E, B> vb, Validation<E, C> vc, Validation<E, D> vd, Validation<E, E$> ve, Validation<E, F$> vf, F<T, F<A, F<B, F<C, F<D, F<E$, F<F$, G>>>>>>> f) Accumulates errors on the failing side of this or any given validation if one or more are encountered, or applies the given function if all succeeded and returns that value on the successful side.final <A,
B, C, D, E$, F$, G>
Validation<E, G> Validation.accumulate
(Semigroup<E> s, Validation<E, A> va, Validation<E, B> vb, Validation<E, C> vc, Validation<E, D> vd, Validation<E, E$> ve, Validation<E, F$> vf, F<T, F<A, F<B, F<C, F<D, F<E$, F<F$, G>>>>>>> f) Accumulates errors on the failing side of this or any given validation if one or more are encountered, or applies the given function if all succeeded and returns that value on the successful side.final <A,
B, C, D, E$, F$, G>
Validation<E, G> Validation.accumulate
(Semigroup<E> s, Validation<E, A> va, Validation<E, B> vb, Validation<E, C> vc, Validation<E, D> vd, Validation<E, E$> ve, Validation<E, F$> vf, F<T, F<A, F<B, F<C, F<D, F<E$, F<F$, G>>>>>>> f) Accumulates errors on the failing side of this or any given validation if one or more are encountered, or applies the given function if all succeeded and returns that value on the successful side.final <A,
B, C, D, E$, F$, G>
Validation<E, G> Validation.accumulate
(Semigroup<E> s, Validation<E, A> va, Validation<E, B> vb, Validation<E, C> vc, Validation<E, D> vd, Validation<E, E$> ve, Validation<E, F$> vf, F<T, F<A, F<B, F<C, F<D, F<E$, F<F$, G>>>>>>> f) Accumulates errors on the failing side of this or any given validation if one or more are encountered, or applies the given function if all succeeded and returns that value on the successful side.final <A,
B, C, D, E$, F$>
Validation<E, F$> Validation.accumulate
(Semigroup<E> s, Validation<E, A> va, Validation<E, B> vb, Validation<E, C> vc, Validation<E, D> vd, Validation<E, E$> ve, F<T, F<A, F<B, F<C, F<D, F<E$, F$>>>>>> f) Accumulates errors on the failing side of this or any given validation if one or more are encountered, or applies the given function if all succeeded and returns that value on the successful side.final <A,
B, C, D, E$, F$>
Validation<E, F$> Validation.accumulate
(Semigroup<E> s, Validation<E, A> va, Validation<E, B> vb, Validation<E, C> vc, Validation<E, D> vd, Validation<E, E$> ve, F<T, F<A, F<B, F<C, F<D, F<E$, F$>>>>>> f) Accumulates errors on the failing side of this or any given validation if one or more are encountered, or applies the given function if all succeeded and returns that value on the successful side.final <A,
B, C, D, E$, F$>
Validation<E, F$> Validation.accumulate
(Semigroup<E> s, Validation<E, A> va, Validation<E, B> vb, Validation<E, C> vc, Validation<E, D> vd, Validation<E, E$> ve, F<T, F<A, F<B, F<C, F<D, F<E$, F$>>>>>> f) Accumulates errors on the failing side of this or any given validation if one or more are encountered, or applies the given function if all succeeded and returns that value on the successful side.final <A,
B, C, D, E$, F$>
Validation<E, F$> Validation.accumulate
(Semigroup<E> s, Validation<E, A> va, Validation<E, B> vb, Validation<E, C> vc, Validation<E, D> vd, Validation<E, E$> ve, F<T, F<A, F<B, F<C, F<D, F<E$, F$>>>>>> f) Accumulates errors on the failing side of this or any given validation if one or more are encountered, or applies the given function if all succeeded and returns that value on the successful side.final <A,
B, C, D, E$, F$>
Validation<E, F$> Validation.accumulate
(Semigroup<E> s, Validation<E, A> va, Validation<E, B> vb, Validation<E, C> vc, Validation<E, D> vd, Validation<E, E$> ve, F<T, F<A, F<B, F<C, F<D, F<E$, F$>>>>>> f) Accumulates errors on the failing side of this or any given validation if one or more are encountered, or applies the given function if all succeeded and returns that value on the successful side.final <A,
B, C, D, E$>
Validation<E, E$> Validation.accumulate
(Semigroup<E> s, Validation<E, A> va, Validation<E, B> vb, Validation<E, C> vc, Validation<E, D> vd, F<T, F<A, F<B, F<C, F<D, E$>>>>> f) Accumulates errors on the failing side of this or any given validation if one or more are encountered, or applies the given function if all succeeded and returns that value on the successful side.final <A,
B, C, D, E$>
Validation<E, E$> Validation.accumulate
(Semigroup<E> s, Validation<E, A> va, Validation<E, B> vb, Validation<E, C> vc, Validation<E, D> vd, F<T, F<A, F<B, F<C, F<D, E$>>>>> f) Accumulates errors on the failing side of this or any given validation if one or more are encountered, or applies the given function if all succeeded and returns that value on the successful side.final <A,
B, C, D, E$>
Validation<E, E$> Validation.accumulate
(Semigroup<E> s, Validation<E, A> va, Validation<E, B> vb, Validation<E, C> vc, Validation<E, D> vd, F<T, F<A, F<B, F<C, F<D, E$>>>>> f) Accumulates errors on the failing side of this or any given validation if one or more are encountered, or applies the given function if all succeeded and returns that value on the successful side.final <A,
B, C, D, E$>
Validation<E, E$> Validation.accumulate
(Semigroup<E> s, Validation<E, A> va, Validation<E, B> vb, Validation<E, C> vc, Validation<E, D> vd, F<T, F<A, F<B, F<C, F<D, E$>>>>> f) Accumulates errors on the failing side of this or any given validation if one or more are encountered, or applies the given function if all succeeded and returns that value on the successful side.final <A,
B, C, D>
Validation<E, D> Validation.accumulate
(Semigroup<E> s, Validation<E, A> va, Validation<E, B> vb, Validation<E, C> vc, F<T, F<A, F<B, F<C, D>>>> f) Accumulates errors on the failing side of this or any given validation if one or more are encountered, or applies the given function if all succeeded and returns that value on the successful side.final <A,
B, C, D>
Validation<E, D> Validation.accumulate
(Semigroup<E> s, Validation<E, A> va, Validation<E, B> vb, Validation<E, C> vc, F<T, F<A, F<B, F<C, D>>>> f) Accumulates errors on the failing side of this or any given validation if one or more are encountered, or applies the given function if all succeeded and returns that value on the successful side.final <A,
B, C, D>
Validation<E, D> Validation.accumulate
(Semigroup<E> s, Validation<E, A> va, Validation<E, B> vb, Validation<E, C> vc, F<T, F<A, F<B, F<C, D>>>> f) Accumulates errors on the failing side of this or any given validation if one or more are encountered, or applies the given function if all succeeded and returns that value on the successful side.final <A,
B, C> Validation <E, C> Validation.accumulate
(Semigroup<E> s, Validation<E, A> va, Validation<E, B> vb, F<T, F<A, F<B, C>>> f) Accumulates errors on the failing side of this or any given validation if one or more are encountered, or applies the given function if all succeeded and returns that value on the successful side.final <A,
B, C> Validation <E, C> Validation.accumulate
(Semigroup<E> s, Validation<E, A> va, Validation<E, B> vb, F<T, F<A, F<B, C>>> f) Accumulates errors on the failing side of this or any given validation if one or more are encountered, or applies the given function if all succeeded and returns that value on the successful side.final <A,
B> Validation <E, B> Validation.accumulate
(Semigroup<E> s, Validation<E, A> va, F<T, F<A, B>> f) Accumulates errors on the failing side of this or any given validation if one or more are encountered, or applies the given function if all succeeded and returns that value on the successful side.<B> Array
<B> Performs function application within an array (applicative functor pattern).<B> Array
<B> Performs function application within an array (applicative functor pattern).Function application on this projection's value.Function application on this projection's value.<B> IterableW
<B> Performs function application within an iterable (applicative functor pattern).final <B> List
<B> Performs function application within a list (applicative functor pattern).final <B> Option
<B> Performs function application within an optional value (applicative functor pattern).final <B> Stream
<B> Performs function application within a stream (applicative functor pattern).final <A> Validation
<E, A> Validation.apply
(Validation<E, F<T, A>> v) Function application on the success value.<A> Validation
<A, T> Validation.FailProjection.apply
(Validation<F<E, A>, T> v) Function application on the failing value.<B,
C> Array <C> Binds the given function across each element of this array and the given array with a final join.static <A,
B, C> IterableW <C> Binds the given function to the values in the given iterables with a final join.final <B,
C, D, E, F$, G, H, I>
List<I> List.bind
(List<B> lb, List<C> lc, List<D> ld, List<E> le, List<F$> lf, List<G> lg, List<H> lh, F<A, F<B, F<C, F<D, F<E, F<F$, F<G, F<H, I>>>>>>>> f) Binds the given function across each element of this list and the given lists with a final join.final <B,
C, D, E, F$, G, H, I>
List<I> List.bind
(List<B> lb, List<C> lc, List<D> ld, List<E> le, List<F$> lf, List<G> lg, List<H> lh, F<A, F<B, F<C, F<D, F<E, F<F$, F<G, F<H, I>>>>>>>> f) Binds the given function across each element of this list and the given lists with a final join.final <B,
C, D, E, F$, G, H, I>
List<I> List.bind
(List<B> lb, List<C> lc, List<D> ld, List<E> le, List<F$> lf, List<G> lg, List<H> lh, F<A, F<B, F<C, F<D, F<E, F<F$, F<G, F<H, I>>>>>>>> f) Binds the given function across each element of this list and the given lists with a final join.final <B,
C, D, E, F$, G, H, I>
List<I> List.bind
(List<B> lb, List<C> lc, List<D> ld, List<E> le, List<F$> lf, List<G> lg, List<H> lh, F<A, F<B, F<C, F<D, F<E, F<F$, F<G, F<H, I>>>>>>>> f) Binds the given function across each element of this list and the given lists with a final join.final <B,
C, D, E, F$, G, H, I>
List<I> List.bind
(List<B> lb, List<C> lc, List<D> ld, List<E> le, List<F$> lf, List<G> lg, List<H> lh, F<A, F<B, F<C, F<D, F<E, F<F$, F<G, F<H, I>>>>>>>> f) Binds the given function across each element of this list and the given lists with a final join.final <B,
C, D, E, F$, G, H, I>
List<I> List.bind
(List<B> lb, List<C> lc, List<D> ld, List<E> le, List<F$> lf, List<G> lg, List<H> lh, F<A, F<B, F<C, F<D, F<E, F<F$, F<G, F<H, I>>>>>>>> f) Binds the given function across each element of this list and the given lists with a final join.final <B,
C, D, E, F$, G, H, I>
List<I> List.bind
(List<B> lb, List<C> lc, List<D> ld, List<E> le, List<F$> lf, List<G> lg, List<H> lh, F<A, F<B, F<C, F<D, F<E, F<F$, F<G, F<H, I>>>>>>>> f) Binds the given function across each element of this list and the given lists with a final join.final <B,
C, D, E, F$, G, H>
List<H> List.bind
(List<B> lb, List<C> lc, List<D> ld, List<E> le, List<F$> lf, List<G> lg, F<A, F<B, F<C, F<D, F<E, F<F$, F<G, H>>>>>>> f) Binds the given function across each element of this list and the given lists with a final join.final <B,
C, D, E, F$, G, H>
List<H> List.bind
(List<B> lb, List<C> lc, List<D> ld, List<E> le, List<F$> lf, List<G> lg, F<A, F<B, F<C, F<D, F<E, F<F$, F<G, H>>>>>>> f) Binds the given function across each element of this list and the given lists with a final join.final <B,
C, D, E, F$, G, H>
List<H> List.bind
(List<B> lb, List<C> lc, List<D> ld, List<E> le, List<F$> lf, List<G> lg, F<A, F<B, F<C, F<D, F<E, F<F$, F<G, H>>>>>>> f) Binds the given function across each element of this list and the given lists with a final join.final <B,
C, D, E, F$, G, H>
List<H> List.bind
(List<B> lb, List<C> lc, List<D> ld, List<E> le, List<F$> lf, List<G> lg, F<A, F<B, F<C, F<D, F<E, F<F$, F<G, H>>>>>>> f) Binds the given function across each element of this list and the given lists with a final join.final <B,
C, D, E, F$, G, H>
List<H> List.bind
(List<B> lb, List<C> lc, List<D> ld, List<E> le, List<F$> lf, List<G> lg, F<A, F<B, F<C, F<D, F<E, F<F$, F<G, H>>>>>>> f) Binds the given function across each element of this list and the given lists with a final join.final <B,
C, D, E, F$, G, H>
List<H> List.bind
(List<B> lb, List<C> lc, List<D> ld, List<E> le, List<F$> lf, List<G> lg, F<A, F<B, F<C, F<D, F<E, F<F$, F<G, H>>>>>>> f) Binds the given function across each element of this list and the given lists with a final join.final <B,
C, D, E, F$, G>
List<G> List.bind
(List<B> lb, List<C> lc, List<D> ld, List<E> le, List<F$> lf, F<A, F<B, F<C, F<D, F<E, F<F$, G>>>>>> f) Binds the given function across each element of this list and the given lists with a final join.final <B,
C, D, E, F$, G>
List<G> List.bind
(List<B> lb, List<C> lc, List<D> ld, List<E> le, List<F$> lf, F<A, F<B, F<C, F<D, F<E, F<F$, G>>>>>> f) Binds the given function across each element of this list and the given lists with a final join.final <B,
C, D, E, F$, G>
List<G> List.bind
(List<B> lb, List<C> lc, List<D> ld, List<E> le, List<F$> lf, F<A, F<B, F<C, F<D, F<E, F<F$, G>>>>>> f) Binds the given function across each element of this list and the given lists with a final join.final <B,
C, D, E, F$, G>
List<G> List.bind
(List<B> lb, List<C> lc, List<D> ld, List<E> le, List<F$> lf, F<A, F<B, F<C, F<D, F<E, F<F$, G>>>>>> f) Binds the given function across each element of this list and the given lists with a final join.final <B,
C, D, E, F$, G>
List<G> List.bind
(List<B> lb, List<C> lc, List<D> ld, List<E> le, List<F$> lf, F<A, F<B, F<C, F<D, F<E, F<F$, G>>>>>> f) Binds the given function across each element of this list and the given lists with a final join.final <B,
C, D, E, F$>
List<F$> Binds the given function across each element of this list and the given lists with a final join.final <B,
C, D, E, F$>
List<F$> Binds the given function across each element of this list and the given lists with a final join.final <B,
C, D, E, F$>
List<F$> Binds the given function across each element of this list and the given lists with a final join.final <B,
C, D, E, F$>
List<F$> Binds the given function across each element of this list and the given lists with a final join.final <B,
C, D, E>
List<E> Binds the given function across each element of this list and the given lists with a final join.final <B,
C, D, E>
List<E> Binds the given function across each element of this list and the given lists with a final join.final <B,
C, D, E>
List<E> Binds the given function across each element of this list and the given lists with a final join.final <B,
C, D> List <D> Binds the given function across each element of this list and the given lists with a final join.final <B,
C, D> List <D> Binds the given function across each element of this list and the given lists with a final join.final <B,
C> List <C> Binds the given function across each element of this list and the given list with a final join.final <B,
C, D, E, F$, G, H, I>
Option<I> Option.bind
(Option<B> ob, Option<C> oc, Option<D> od, Option<E> oe, Option<F$> of, Option<G> og, Option<H> oh, F<A, F<B, F<C, F<D, F<E, F<F$, F<G, F<H, I>>>>>>>> f) Binds the given function across the element of this optional value and the given optional value with a final join.final <B,
C, D, E, F$, G, H, I>
Option<I> Option.bind
(Option<B> ob, Option<C> oc, Option<D> od, Option<E> oe, Option<F$> of, Option<G> og, Option<H> oh, F<A, F<B, F<C, F<D, F<E, F<F$, F<G, F<H, I>>>>>>>> f) Binds the given function across the element of this optional value and the given optional value with a final join.final <B,
C, D, E, F$, G, H, I>
Option<I> Option.bind
(Option<B> ob, Option<C> oc, Option<D> od, Option<E> oe, Option<F$> of, Option<G> og, Option<H> oh, F<A, F<B, F<C, F<D, F<E, F<F$, F<G, F<H, I>>>>>>>> f) Binds the given function across the element of this optional value and the given optional value with a final join.final <B,
C, D, E, F$, G, H, I>
Option<I> Option.bind
(Option<B> ob, Option<C> oc, Option<D> od, Option<E> oe, Option<F$> of, Option<G> og, Option<H> oh, F<A, F<B, F<C, F<D, F<E, F<F$, F<G, F<H, I>>>>>>>> f) Binds the given function across the element of this optional value and the given optional value with a final join.final <B,
C, D, E, F$, G, H, I>
Option<I> Option.bind
(Option<B> ob, Option<C> oc, Option<D> od, Option<E> oe, Option<F$> of, Option<G> og, Option<H> oh, F<A, F<B, F<C, F<D, F<E, F<F$, F<G, F<H, I>>>>>>>> f) Binds the given function across the element of this optional value and the given optional value with a final join.final <B,
C, D, E, F$, G, H, I>
Option<I> Option.bind
(Option<B> ob, Option<C> oc, Option<D> od, Option<E> oe, Option<F$> of, Option<G> og, Option<H> oh, F<A, F<B, F<C, F<D, F<E, F<F$, F<G, F<H, I>>>>>>>> f) Binds the given function across the element of this optional value and the given optional value with a final join.final <B,
C, D, E, F$, G, H, I>
Option<I> Option.bind
(Option<B> ob, Option<C> oc, Option<D> od, Option<E> oe, Option<F$> of, Option<G> og, Option<H> oh, F<A, F<B, F<C, F<D, F<E, F<F$, F<G, F<H, I>>>>>>>> f) Binds the given function across the element of this optional value and the given optional value with a final join.final <B,
C, D, E, F$, G, H>
Option<H> Option.bind
(Option<B> ob, Option<C> oc, Option<D> od, Option<E> oe, Option<F$> of, Option<G> og, F<A, F<B, F<C, F<D, F<E, F<F$, F<G, H>>>>>>> f) Binds the given function across the element of this optional value and the given optional value with a final join.final <B,
C, D, E, F$, G, H>
Option<H> Option.bind
(Option<B> ob, Option<C> oc, Option<D> od, Option<E> oe, Option<F$> of, Option<G> og, F<A, F<B, F<C, F<D, F<E, F<F$, F<G, H>>>>>>> f) Binds the given function across the element of this optional value and the given optional value with a final join.final <B,
C, D, E, F$, G, H>
Option<H> Option.bind
(Option<B> ob, Option<C> oc, Option<D> od, Option<E> oe, Option<F$> of, Option<G> og, F<A, F<B, F<C, F<D, F<E, F<F$, F<G, H>>>>>>> f) Binds the given function across the element of this optional value and the given optional value with a final join.final <B,
C, D, E, F$, G, H>
Option<H> Option.bind
(Option<B> ob, Option<C> oc, Option<D> od, Option<E> oe, Option<F$> of, Option<G> og, F<A, F<B, F<C, F<D, F<E, F<F$, F<G, H>>>>>>> f) Binds the given function across the element of this optional value and the given optional value with a final join.final <B,
C, D, E, F$, G, H>
Option<H> Option.bind
(Option<B> ob, Option<C> oc, Option<D> od, Option<E> oe, Option<F$> of, Option<G> og, F<A, F<B, F<C, F<D, F<E, F<F$, F<G, H>>>>>>> f) Binds the given function across the element of this optional value and the given optional value with a final join.final <B,
C, D, E, F$, G, H>
Option<H> Option.bind
(Option<B> ob, Option<C> oc, Option<D> od, Option<E> oe, Option<F$> of, Option<G> og, F<A, F<B, F<C, F<D, F<E, F<F$, F<G, H>>>>>>> f) Binds the given function across the element of this optional value and the given optional value with a final join.final <B,
C, D, E, F$, G>
Option<G> Option.bind
(Option<B> ob, Option<C> oc, Option<D> od, Option<E> oe, Option<F$> of, F<A, F<B, F<C, F<D, F<E, F<F$, G>>>>>> f) Binds the given function across the element of this optional value and the given optional value with a final join.final <B,
C, D, E, F$, G>
Option<G> Option.bind
(Option<B> ob, Option<C> oc, Option<D> od, Option<E> oe, Option<F$> of, F<A, F<B, F<C, F<D, F<E, F<F$, G>>>>>> f) Binds the given function across the element of this optional value and the given optional value with a final join.final <B,
C, D, E, F$, G>
Option<G> Option.bind
(Option<B> ob, Option<C> oc, Option<D> od, Option<E> oe, Option<F$> of, F<A, F<B, F<C, F<D, F<E, F<F$, G>>>>>> f) Binds the given function across the element of this optional value and the given optional value with a final join.final <B,
C, D, E, F$, G>
Option<G> Option.bind
(Option<B> ob, Option<C> oc, Option<D> od, Option<E> oe, Option<F$> of, F<A, F<B, F<C, F<D, F<E, F<F$, G>>>>>> f) Binds the given function across the element of this optional value and the given optional value with a final join.final <B,
C, D, E, F$, G>
Option<G> Option.bind
(Option<B> ob, Option<C> oc, Option<D> od, Option<E> oe, Option<F$> of, F<A, F<B, F<C, F<D, F<E, F<F$, G>>>>>> f) Binds the given function across the element of this optional value and the given optional value with a final join.final <B,
C, D, E, F$>
Option<F$> Binds the given function across the element of this optional value and the given optional value with a final join.final <B,
C, D, E, F$>
Option<F$> Binds the given function across the element of this optional value and the given optional value with a final join.final <B,
C, D, E, F$>
Option<F$> Binds the given function across the element of this optional value and the given optional value with a final join.final <B,
C, D, E, F$>
Option<F$> Binds the given function across the element of this optional value and the given optional value with a final join.final <B,
C, D, E>
Option<E> Binds the given function across the element of this optional value and the given optional value with a final join.final <B,
C, D, E>
Option<E> Binds the given function across the element of this optional value and the given optional value with a final join.final <B,
C, D, E>
Option<E> Binds the given function across the element of this optional value and the given optional value with a final join.final <B,
C, D> Option <D> Binds the given function across the element of this optional value and the given optional value with a final join.final <B,
C, D> Option <D> Binds the given function across the element of this optional value and the given optional value with a final join.final <B,
C> Option <C> Binds the given function across the element of this optional value and the given optional value with a final join.final <B,
C, D, E, F$, G, H, I>
Stream<I> Stream.bind
(Stream<B> sb, Stream<C> sc, Stream<D> sd, Stream<E> se, Stream<F$> sf, Stream<G> sg, Stream<H> sh, F<A, F<B, F<C, F<D, F<E, F<F$, F<G, F<H, I>>>>>>>> f) Binds the given function across each element of this stream and the given streams with a final join.final <B,
C, D, E, F$, G, H, I>
Stream<I> Stream.bind
(Stream<B> sb, Stream<C> sc, Stream<D> sd, Stream<E> se, Stream<F$> sf, Stream<G> sg, Stream<H> sh, F<A, F<B, F<C, F<D, F<E, F<F$, F<G, F<H, I>>>>>>>> f) Binds the given function across each element of this stream and the given streams with a final join.final <B,
C, D, E, F$, G, H, I>
Stream<I> Stream.bind
(Stream<B> sb, Stream<C> sc, Stream<D> sd, Stream<E> se, Stream<F$> sf, Stream<G> sg, Stream<H> sh, F<A, F<B, F<C, F<D, F<E, F<F$, F<G, F<H, I>>>>>>>> f) Binds the given function across each element of this stream and the given streams with a final join.final <B,
C, D, E, F$, G, H, I>
Stream<I> Stream.bind
(Stream<B> sb, Stream<C> sc, Stream<D> sd, Stream<E> se, Stream<F$> sf, Stream<G> sg, Stream<H> sh, F<A, F<B, F<C, F<D, F<E, F<F$, F<G, F<H, I>>>>>>>> f) Binds the given function across each element of this stream and the given streams with a final join.final <B,
C, D, E, F$, G, H, I>
Stream<I> Stream.bind
(Stream<B> sb, Stream<C> sc, Stream<D> sd, Stream<E> se, Stream<F$> sf, Stream<G> sg, Stream<H> sh, F<A, F<B, F<C, F<D, F<E, F<F$, F<G, F<H, I>>>>>>>> f) Binds the given function across each element of this stream and the given streams with a final join.final <B,
C, D, E, F$, G, H, I>
Stream<I> Stream.bind
(Stream<B> sb, Stream<C> sc, Stream<D> sd, Stream<E> se, Stream<F$> sf, Stream<G> sg, Stream<H> sh, F<A, F<B, F<C, F<D, F<E, F<F$, F<G, F<H, I>>>>>>>> f) Binds the given function across each element of this stream and the given streams with a final join.final <B,
C, D, E, F$, G, H, I>
Stream<I> Stream.bind
(Stream<B> sb, Stream<C> sc, Stream<D> sd, Stream<E> se, Stream<F$> sf, Stream<G> sg, Stream<H> sh, F<A, F<B, F<C, F<D, F<E, F<F$, F<G, F<H, I>>>>>>>> f) Binds the given function across each element of this stream and the given streams with a final join.final <B,
C, D, E, F$, G, H>
Stream<H> Stream.bind
(Stream<B> sb, Stream<C> sc, Stream<D> sd, Stream<E> se, Stream<F$> sf, Stream<G> sg, F<A, F<B, F<C, F<D, F<E, F<F$, F<G, H>>>>>>> f) Binds the given function across each element of this stream and the given streams with a final join.final <B,
C, D, E, F$, G, H>
Stream<H> Stream.bind
(Stream<B> sb, Stream<C> sc, Stream<D> sd, Stream<E> se, Stream<F$> sf, Stream<G> sg, F<A, F<B, F<C, F<D, F<E, F<F$, F<G, H>>>>>>> f) Binds the given function across each element of this stream and the given streams with a final join.final <B,
C, D, E, F$, G, H>
Stream<H> Stream.bind
(Stream<B> sb, Stream<C> sc, Stream<D> sd, Stream<E> se, Stream<F$> sf, Stream<G> sg, F<A, F<B, F<C, F<D, F<E, F<F$, F<G, H>>>>>>> f) Binds the given function across each element of this stream and the given streams with a final join.final <B,
C, D, E, F$, G, H>
Stream<H> Stream.bind
(Stream<B> sb, Stream<C> sc, Stream<D> sd, Stream<E> se, Stream<F$> sf, Stream<G> sg, F<A, F<B, F<C, F<D, F<E, F<F$, F<G, H>>>>>>> f) Binds the given function across each element of this stream and the given streams with a final join.final <B,
C, D, E, F$, G, H>
Stream<H> Stream.bind
(Stream<B> sb, Stream<C> sc, Stream<D> sd, Stream<E> se, Stream<F$> sf, Stream<G> sg, F<A, F<B, F<C, F<D, F<E, F<F$, F<G, H>>>>>>> f) Binds the given function across each element of this stream and the given streams with a final join.final <B,
C, D, E, F$, G, H>
Stream<H> Stream.bind
(Stream<B> sb, Stream<C> sc, Stream<D> sd, Stream<E> se, Stream<F$> sf, Stream<G> sg, F<A, F<B, F<C, F<D, F<E, F<F$, F<G, H>>>>>>> f) Binds the given function across each element of this stream and the given streams with a final join.final <B,
C, D, E, F$, G>
Stream<G> Stream.bind
(Stream<B> sb, Stream<C> sc, Stream<D> sd, Stream<E> se, Stream<F$> sf, F<A, F<B, F<C, F<D, F<E, F<F$, G>>>>>> f) Binds the given function across each element of this stream and the given streams with a final join.final <B,
C, D, E, F$, G>
Stream<G> Stream.bind
(Stream<B> sb, Stream<C> sc, Stream<D> sd, Stream<E> se, Stream<F$> sf, F<A, F<B, F<C, F<D, F<E, F<F$, G>>>>>> f) Binds the given function across each element of this stream and the given streams with a final join.final <B,
C, D, E, F$, G>
Stream<G> Stream.bind
(Stream<B> sb, Stream<C> sc, Stream<D> sd, Stream<E> se, Stream<F$> sf, F<A, F<B, F<C, F<D, F<E, F<F$, G>>>>>> f) Binds the given function across each element of this stream and the given streams with a final join.final <B,
C, D, E, F$, G>
Stream<G> Stream.bind
(Stream<B> sb, Stream<C> sc, Stream<D> sd, Stream<E> se, Stream<F$> sf, F<A, F<B, F<C, F<D, F<E, F<F$, G>>>>>> f) Binds the given function across each element of this stream and the given streams with a final join.final <B,
C, D, E, F$, G>
Stream<G> Stream.bind
(Stream<B> sb, Stream<C> sc, Stream<D> sd, Stream<E> se, Stream<F$> sf, F<A, F<B, F<C, F<D, F<E, F<F$, G>>>>>> f) Binds the given function across each element of this stream and the given streams with a final join.final <B,
C, D, E, F$>
Stream<F$> Binds the given function across each element of this stream and the given streams with a final join.final <B,
C, D, E, F$>
Stream<F$> Binds the given function across each element of this stream and the given streams with a final join.final <B,
C, D, E, F$>
Stream<F$> Binds the given function across each element of this stream and the given streams with a final join.final <B,
C, D, E, F$>
Stream<F$> Binds the given function across each element of this stream and the given streams with a final join.final <B,
C, D, E>
Stream<E> Binds the given function across each element of this stream and the given streams with a final join.final <B,
C, D, E>
Stream<E> Binds the given function across each element of this stream and the given streams with a final join.final <B,
C, D, E>
Stream<E> Binds the given function across each element of this stream and the given streams with a final join.final <B,
C, D> Stream <D> Binds the given function across each element of this stream and the given streams with a final join.final <B,
C, D> Stream <D> Binds the given function across each element of this stream and the given streams with a final join.final <B,
C> Stream <C> Binds the given function across each element of this stream and the given stream with a final join.<B> B
Performs a left-fold reduction across this array.<B> B
Performs a left-fold reduction across this array.<B> B
The catamorphism for Iterables, implemented as a left fold.final <B> B
Performs a left-fold reduction across this list.final <B> B
Performs a left-fold reduction across this stream.Takes the first 2 elements of the iterable and applies the function to them, then applies the function to the result and the third element and so on.final A
Takes the first 2 elements of the list and applies the function to them, then applies the function to the result and the third element and so on.final A
Performs a left-fold reduction across this list.final A
Takes the first 2 elements of the stream and applies the function to them, then applies the function to the result and the third element and so on.<B> B
Performs a right-fold reduction across this array.<B> B
Performs a right-fold reduction across this array.final <B> B
Performs a right-fold reduction across this list.final <B> B
Performs a right-fold reduction across this stream.<B> B
Performs a right-fold reduction across this zipper.final A
Performs a right-fold reduction across this list.final <B> B
Stream.foldRight1
(F<A, F<B, B>> f, B b) Performs a right-fold reduction across this stream.Inserts the given element before the first element that is greater than or equal to it according to the given ordering.Promotes a function of arity-2 to a function on iterables.Promotes the given function of arity-2 to a function on lists.Promotes a function of arity-2 so that it operates over options.Maps the given function of arity-2 across this list and returns a function that applies all the resulting functions to a given argument.Maps the given function of arity-2 across this stream and returns a function that applies all the resulting functions to a given argument.<B> Array
<B> Performs a fold left accummulating and returns an array of the intermediate results.Performs a left-fold accummulating using first array element as a starting value and returns an array of the intermediate results.<B> Array
<B> Performs a right-fold accummulating and returns an array of the intermediate results.Performs a right-fold accummulating using last array element as a starting value and returns an array of the intermediate results.Turn a list of functions into a function returning a list.Turn a stream of functions into a function returning a stream.Sequence the given list and collect the output as a function.Sequence the given option and collect the output as a function.Sequence the given seq and collect the output as a function.Sequence the given stream and collect the output as a function.static final <E,
C, B> F <C, Validation<E, B>> Validation.sequenceF
(Validation<E, F<C, B>> validation) Sequence the given validation and collect the output as a function.final <B> Stream
<B> Applies a stream of comonadic functions to this stream, returning a stream of values.Traverse this list with the given function and collect the output as a function.Traverse this option with the given function and collect the output as a function.Traverse this seq with the given function and collect the output as a function.Traverse this stream with the given function and collect the output as a function.final <C,
B> F <C, Validation<E, B>> Traverse this validation with the given function and collect the output as a function.final <B> B
Performs a reduction on this stream using the given arguments.<B> IterableW
<B> Zips this iterable with the given iterable of functions, applying each function in turn to the corresponding element in this iterable to produce a new iterable.final <B> Stream
<B> Zips this stream with the given stream of functions, applying each function in turn to the corresponding element in this stream to produce a new stream.<B,
C> Array <C> Zips this array with the given array using the given function to produce a new array.<B,
C> Iterable <C> Zips this iterable with the given iterable using the given function to produce a new iterable.final <B,
C> List <C> Zips this list with the given list using the given function to produce a new list.<B,
C> NonEmptyList <C> Zips this non empty list with the given non empty list using the given function to produce a new list.final <B,
C> Stream <C> Zips this stream with the given stream using the given function to produce a new stream.Partially-applied version of zipWith.<B,
C> Tree <C> Zips this tree with another, using the given function.<B,
C> TreeZipper <C> TreeZipper.zipWith
(TreeZipper<B> bs, F<A, F<B, C>> f) Zips this TreeZipper with another, applying the given function lock-step over both zippers in all directions.<B,
C> Zipper <C> Zips this Zipper with another, applying the given function lock-step over both zippers in both directions. -
Uses of F in fj.data.fingertrees
Fields in fj.data.fingertrees declared as FMethods in fj.data.fingertrees that return FModifier and TypeMethodDescriptionNode.foldRight_
(F<A, F<B, B>> aff) Measured.measure()
Returns the measuring function.Methods in fj.data.fingertrees that return types with arguments of type FMethods in fj.data.fingertrees with parameters of type FModifier and TypeMethodDescriptionstatic <V,
A> FingerTree <V, A> Creates an empty finger tree with elements of type A and node annotations of type V.final <B> FingerTree
<V, A> <B> B
abstract <B> B
Folds this digit to the left using the given function and the given initial value.<B> B
abstract <B> B
Folds the tree to the left with the given function and the given initial element.<B> B
abstract <B> B
<B> B
<B> B
<B> B
<B> B
<B> B
<B> B
<B> B
abstract <B> B
Folds this digit to the right using the given function and the given initial value.<B> B
abstract <B> B
Folds the tree to the right with the given function and the given initial element.<B> B
abstract <B> B
<B> B
<B> B
<B> B
<B> B
<B> B
<B> B
Node.foldRight_
(F<A, F<B, B>> aff) <B> FingerTree
<V, B> Maps a function across the elements of this digit, measuring with the given measurement.<B> FingerTree
<V, B> abstract <B> FingerTree
<V, B> Maps the given function across this tree, measuring with the given Measured instance.<B> FingerTree
<V, B> <B> B
Pattern matching on the tree.abstract <B> B
Structural pattern matching on digits.<B> B
Pattern matching on the structure of this tree.abstract <B> B
Provides pattern matching on trees.<B> B
abstract <B> B
<B> B
<B> B
<B> B
<B> B
Pattern matching on the structure of this tree.<B> B
<B> B
static <V,
A> Measured <V, A> Constructs a Measured instance for the element type, given a monoid and a measuring function.static <V,
A> Measured <V, A> final A
Folds this digit to the right using the given function.abstract A
Folds the tree to the left with the given function.final A
Folds this digit to the right using the given function.abstract A
Folds the tree to the right with the given function.final P2
<FingerTree<V, A>, FingerTree<V, A>> Splits this tree into a pair of subtrees at the point where the given predicate, based on the measure, changes fromfalse
totrue
.(package private) P3
<FingerTree<V, A>, A, FingerTree<V, A>> (package private) P3
<FingerTree<V, A>, A, FingerTree<V, A>> final P3
<FingerTree<V, A>, A, FingerTree<V, A>> Likesplit
, but returns the element wherepred
first holds separately.(package private) abstract P3
<FingerTree<V, A>, A, FingerTree<V, A>> (package private) P3
<FingerTree<V, A>, A, FingerTree<V, A>> Method parameters in fj.data.fingertrees with type arguments of type FModifier and TypeMethodDescription<B> B
abstract <B> B
Folds this digit to the left using the given function and the given initial value.<B> B
abstract <B> B
Folds the tree to the left with the given function and the given initial element.<B> B
abstract <B> B
<B> B
<B> B
<B> B
<B> B
<B> B
<B> B
<B> B
abstract <B> B
Folds this digit to the right using the given function and the given initial value.<B> B
abstract <B> B
Folds the tree to the right with the given function and the given initial element.<B> B
abstract <B> B
<B> B
<B> B
<B> B
<B> B
<B> B
<B> B
Node.foldRight_
(F<A, F<B, B>> aff) final A
Folds this digit to the right using the given function.abstract A
Folds the tree to the left with the given function.final A
Folds this digit to the right using the given function.abstract A
Folds the tree to the right with the given function.Constructors in fj.data.fingertrees with parameters of type F -
Uses of F in fj.data.hamt
Methods in fj.data.hamt with parameters of type F -
Uses of F in fj.data.hlist
Methods in fj.data.hlist that return types with arguments of type FModifier and TypeMethodDescriptionHList.Apply.comp()
A function application operator for function composition.HList.Apply.comp()
A function application operator for function composition.HList.Apply.comp()
A function application operator for function composition.static <X,
Y> HList.Apply <F<X, Y>, X, Y> HList.Apply.f()
Function application operator. -
Uses of F in fj.data.optic
Methods in fj.data.optic that return FModifier and TypeMethodDescriptioncheck if all targets satisfy the predicatecheck if all targets satisfy the predicatecheck if at least one target satisfies the predicatecheck if at least one target satisfies the predicatefind the first target of aFold
matching the predicatefind the first target of aPTraversal
matching the predicatecombine all targets using a target'sMonoid
combine all targets using a target'sMonoid
map each target to aMonoid
and combine the resultsmodify polymorphically the target of aPIso
with a functionmodify polymorphically the target of aPLens
using a functionmodify polymorphically the target of aPOptional
with a functionmodify polymorphically the target of aPPrism
with a functionmodify polymorphically the target of aPSetter
with a functionmodify polymorphically the target of aPTraversal
with a functionLens.modifyEitherF
(F<A, Either<L, A>> f) Optional.modifyEitherF
(F<A, Either<L, A>> f) PIso.modifyEitherF
(F<A, Either<L, B>> f) modify polymorphically the target of aPIso
with an Applicative functionPLens.modifyEitherF
(F<A, Either<L, B>> f) modify polymorphically the target of aPLens
with an Applicative functionPOptional.modifyEitherF
(F<A, Either<L, B>> f) modify polymorphically the target of aPOptional
with an Applicative functionPPrism.modifyEitherF
(F<A, Either<L, B>> f) modify polymorphically the target of aPPrism
with an Applicative functionPTraversal.modifyEitherF
(F<A, Either<L, B>> f) modify polymorphically the target of aPTraversal
with an Applicative functionTraversal.modifyEitherF
(F<A, Either<L, A>> f) Lens.modifyFunctionF
(F<A, F<C, A>> f) Optional.modifyFunctionF
(F<A, F<C, A>> f) PIso.modifyFunctionF
(F<A, F<C, B>> f) modify polymorphically the target of aPIso
with an Applicative functionPLens.modifyFunctionF
(F<A, F<C, B>> f) modify polymorphically the target of aPLens
with an Applicative functionPOptional.modifyFunctionF
(F<A, F<C, B>> f) modify polymorphically the target of aPOptional
with an Applicative functionPPrism.modifyFunctionF
(F<A, F<C, B>> f) modify polymorphically the target of aPPrism
with an Applicative functionPTraversal.modifyFunctionF
(F<A, F<C, B>> f) modify polymorphically the target of aPTraversal
with an Applicative functionTraversal.modifyFunctionF
(F<A, F<C, A>> f) modify polymorphically the target of aPIso
with an Applicative functionmodify polymorphically the target of aPLens
with an Applicative functionmodify polymorphically the target of aPOptional
with an Applicative functionmodify polymorphically the target of aPPrism
with an Applicative functionmodify polymorphically the target of aPTraversal
with an Applicative functionLens.modifyListF
(F<A, List<A>> f) Optional.modifyListF
(F<A, List<A>> f) PIso.modifyListF
(F<A, List<B>> f) modify polymorphically the target of aPIso
with an Applicative functionPLens.modifyListF
(F<A, List<B>> f) modify polymorphically the target of aPLens
with an Applicative functionPOptional.modifyListF
(F<A, List<B>> f) modify polymorphically the target of aPOptional
with an Applicative functionPPrism.modifyListF
(F<A, List<B>> f) modify polymorphically the target of aPPrism
with an Applicative functionPTraversal.modifyListF
(F<A, List<B>> f) modify polymorphically the target of aPTraversal
with an Applicative functionTraversal.modifyListF
(F<A, List<A>> f) POptional.modifyOption
(F<A, B> f) modify polymorphically the target of aPOptional
with a function.PPrism.modifyOption
(F<A, B> f) modify polymorphically the target of aPPrism
with a function.Lens.modifyOptionF
(F<A, Option<A>> f) Optional.modifyOptionF
(F<A, Option<A>> f) PIso.modifyOptionF
(F<A, Option<B>> f) modify polymorphically the target of aPIso
with an Applicative functionPLens.modifyOptionF
(F<A, Option<B>> f) modify polymorphically the target of aPLens
with an Applicative functionPOptional.modifyOptionF
(F<A, Option<B>> f) modify polymorphically the target of aPOptional
with an Applicative functionPPrism.modifyOptionF
(F<A, Option<B>> f) modify polymorphically the target of aPPrism
with an Applicative functionPTraversal.modifyOptionF
(F<A, Option<B>> f) modify polymorphically the target of aPTraversal
with an Applicative functionTraversal.modifyOptionF
(F<A, Option<A>> f) modify polymorphically the target of aPIso
with an Applicative functionmodify polymorphically the target of aPLens
with an Applicative functionmodify polymorphically the target of aPOptional
with an Applicative functionmodify polymorphically the target of aPPrism
with an Applicative functionmodify polymorphically the target of aPTraversal
with an Applicative functionLens.modifyPromiseF
(F<A, Promise<A>> f) Optional.modifyPromiseF
(F<A, Promise<A>> f) PIso.modifyPromiseF
(F<A, Promise<B>> f) modify polymorphically the target of aPIso
with an Applicative functionPLens.modifyPromiseF
(F<A, Promise<B>> f) modify polymorphically the target of aPLens
with an Applicative functionPOptional.modifyPromiseF
(F<A, Promise<B>> f) modify polymorphically the target of aPOptional
with an Applicative functionPPrism.modifyPromiseF
(F<A, Promise<B>> f) modify polymorphically the target of aPPrism
with an Applicative functionPTraversal.modifyPromiseF
(F<A, Promise<B>> f) modify polymorphically the target of aPTraversal
with an Applicative functionTraversal.modifyPromiseF
(F<A, Promise<A>> f) Lens.modifyStreamF
(F<A, Stream<A>> f) Optional.modifyStreamF
(F<A, Stream<A>> f) PIso.modifyStreamF
(F<A, Stream<B>> f) modify polymorphically the target of aPIso
with an Applicative functionPLens.modifyStreamF
(F<A, Stream<B>> f) modify polymorphically the target of aPLens
with an Applicative functionPOptional.modifyStreamF
(F<A, Stream<B>> f) modify polymorphically the target of aPOptional
with an Applicative functionPPrism.modifyStreamF
(F<A, Stream<B>> f) modify polymorphically the target of aPPrism
with an Applicative functionPTraversal.modifyStreamF
(F<A, Stream<B>> f) modify polymorphically the target of aPTraversal
with an Applicative functionTraversal.modifyStreamF
(F<A, Stream<A>> f) F
<S, Trampoline<S>> Lens.modifyTrampolineF
(F<A, Trampoline<A>> f) F
<S, Trampoline<S>> Optional.modifyTrampolineF
(F<A, Trampoline<A>> f) final F
<S, Trampoline<T>> PIso.modifyTrampolineF
(F<A, Trampoline<B>> f) modify polymorphically the target of aPIso
with an Applicative functionabstract F
<S, Trampoline<T>> PLens.modifyTrampolineF
(F<A, Trampoline<B>> f) modify polymorphically the target of aPLens
with an Applicative functionabstract F
<S, Trampoline<T>> POptional.modifyTrampolineF
(F<A, Trampoline<B>> f) modify polymorphically the target of aPOptional
with an Applicative functionfinal F
<S, Trampoline<T>> PPrism.modifyTrampolineF
(F<A, Trampoline<B>> f) modify polymorphically the target of aPPrism
with an Applicative functionabstract F
<S, Trampoline<T>> PTraversal.modifyTrampolineF
(F<A, Trampoline<B>> f) modify polymorphically the target of aPTraversal
with an Applicative functionF
<S, Trampoline<S>> Traversal.modifyTrampolineF
(F<A, Trampoline<A>> f) modify polymorphically the target of aPIso
with an Applicative functionmodify polymorphically the target of aPLens
with an Applicative functionmodify polymorphically the target of aPOptional
with an Applicative functionmodify polymorphically the target of aPPrism
with an Applicative functionmodify polymorphically the target of aPTraversal
with an Applicative function<E> F
<S, Validation<E, S>> Lens.modifyValidationF
(F<A, Validation<E, A>> f) <E> F
<S, Validation<E, S>> Optional.modifyValidationF
(F<A, Validation<E, A>> f) final <E> F
<S, Validation<E, T>> PIso.modifyValidationF
(F<A, Validation<E, B>> f) modify polymorphically the target of aPIso
with an Applicative functionabstract <E> F
<S, Validation<E, T>> PLens.modifyValidationF
(F<A, Validation<E, B>> f) modify polymorphically the target of aPLens
with an Applicative functionabstract <E> F
<S, Validation<E, T>> POptional.modifyValidationF
(F<A, Validation<E, B>> f) modify polymorphically the target of aPOptional
with an Applicative functionfinal <E> F
<S, Validation<E, T>> PPrism.modifyValidationF
(F<A, Validation<E, B>> f) modify polymorphically the target of aPPrism
with an Applicative functionabstract <E> F
<S, Validation<E, T>> PTraversal.modifyValidationF
(Semigroup<E> s, F<A, Validation<E, B>> f) modify polymorphically the target of aPTraversal
with an Applicative function<E> F
<S, Validation<E, S>> Traversal.modifyValidationF
(Semigroup<E> s, F<A, Validation<E, A>> f) set polymorphically the target of aPIso
with a valueset polymorphically the target of aPLens
using a functionget the modified source of aPOptional
set polymorphically the target of aPPrism
with a valueset polymorphically the target of aPSetter
with a valueset polymorphically the target of aPTraversal
with a valueset polymorphically the target of aPOptional
with a value.set polymorphically the target of aPPrism
with a value.Methods in fj.data.optic that return types with arguments of type FModifier and TypeMethodDescriptionLens.modifyFunctionF
(F<A, F<C, A>> f) Optional.modifyFunctionF
(F<A, F<C, A>> f) PIso.modifyFunctionF
(F<A, F<C, B>> f) modify polymorphically the target of aPIso
with an Applicative functionPLens.modifyFunctionF
(F<A, F<C, B>> f) modify polymorphically the target of aPLens
with an Applicative functionPOptional.modifyFunctionF
(F<A, F<C, B>> f) modify polymorphically the target of aPOptional
with an Applicative functionPPrism.modifyFunctionF
(F<A, F<C, B>> f) modify polymorphically the target of aPPrism
with an Applicative functionPTraversal.modifyFunctionF
(F<A, F<C, B>> f) modify polymorphically the target of aPTraversal
with an Applicative functionTraversal.modifyFunctionF
(F<A, F<C, A>> f) Methods in fj.data.optic with parameters of type FModifier and TypeMethodDescriptioncheck if all targets satisfy the predicatecheck if all targets satisfy the predicatecheck if at least one target satisfies the predicatecheck if at least one target satisfies the predicatefind the first target of aFold
matching the predicatefind the first target of aPTraversal
matching the predicatemap each target to aMonoid
and combine the resultsprivate static <S,
T, A, B>
PTraversal<S, T, A, B> PTraversal.fromCurried
(PTraversal<S, F<B, T>, A, B> curriedTraversal, F<S, A> lastGet) static <S,
A> Getter <S, A> static <S,
A> Iso <S, A> create anIso
using a pair of functions: one to get the target and one to get the source.static <S,
A> Lens <S, A> create aLens
using a pair of functions: one to get the target, one to set the target.modify polymorphically the target of aPIso
with a functionmodify polymorphically the target of aPLens
using a functionmodify polymorphically the target of aPOptional
with a functionmodify polymorphically the target of aPPrism
with a functionmodify polymorphically the target of aPSetter
with a functionmodify polymorphically the target of aPTraversal
with a functionLens.modifyEitherF
(F<A, Either<L, A>> f) Optional.modifyEitherF
(F<A, Either<L, A>> f) PIso.modifyEitherF
(F<A, Either<L, B>> f) modify polymorphically the target of aPIso
with an Applicative functionPLens.modifyEitherF
(F<A, Either<L, B>> f) modify polymorphically the target of aPLens
with an Applicative functionPOptional.modifyEitherF
(F<A, Either<L, B>> f) modify polymorphically the target of aPOptional
with an Applicative functionPPrism.modifyEitherF
(F<A, Either<L, B>> f) modify polymorphically the target of aPPrism
with an Applicative functionPTraversal.modifyEitherF
(F<A, Either<L, B>> f) modify polymorphically the target of aPTraversal
with an Applicative functionTraversal.modifyEitherF
(F<A, Either<L, A>> f) Lens.modifyFunctionF
(F<A, F<C, A>> f) Optional.modifyFunctionF
(F<A, F<C, A>> f) PIso.modifyFunctionF
(F<A, F<C, B>> f) modify polymorphically the target of aPIso
with an Applicative functionPLens.modifyFunctionF
(F<A, F<C, B>> f) modify polymorphically the target of aPLens
with an Applicative functionPOptional.modifyFunctionF
(F<A, F<C, B>> f) modify polymorphically the target of aPOptional
with an Applicative functionPPrism.modifyFunctionF
(F<A, F<C, B>> f) modify polymorphically the target of aPPrism
with an Applicative functionPTraversal.modifyFunctionF
(F<A, F<C, B>> f) modify polymorphically the target of aPTraversal
with an Applicative functionTraversal.modifyFunctionF
(F<A, F<C, A>> f) modify polymorphically the target of aPIso
with an Applicative functionmodify polymorphically the target of aPLens
with an Applicative functionmodify polymorphically the target of aPOptional
with an Applicative functionmodify polymorphically the target of aPPrism
with an Applicative functionmodify polymorphically the target of aPTraversal
with an Applicative functionLens.modifyListF
(F<A, List<A>> f) Optional.modifyListF
(F<A, List<A>> f) PIso.modifyListF
(F<A, List<B>> f) modify polymorphically the target of aPIso
with an Applicative functionPLens.modifyListF
(F<A, List<B>> f) modify polymorphically the target of aPLens
with an Applicative functionPOptional.modifyListF
(F<A, List<B>> f) modify polymorphically the target of aPOptional
with an Applicative functionPPrism.modifyListF
(F<A, List<B>> f) modify polymorphically the target of aPPrism
with an Applicative functionPTraversal.modifyListF
(F<A, List<B>> f) modify polymorphically the target of aPTraversal
with an Applicative functionTraversal.modifyListF
(F<A, List<A>> f) POptional.modifyOption
(F<A, B> f) modify polymorphically the target of aPOptional
with a function.PPrism.modifyOption
(F<A, B> f) modify polymorphically the target of aPPrism
with a function.Lens.modifyOptionF
(F<A, Option<A>> f) Optional.modifyOptionF
(F<A, Option<A>> f) PIso.modifyOptionF
(F<A, Option<B>> f) modify polymorphically the target of aPIso
with an Applicative functionPLens.modifyOptionF
(F<A, Option<B>> f) modify polymorphically the target of aPLens
with an Applicative functionPOptional.modifyOptionF
(F<A, Option<B>> f) modify polymorphically the target of aPOptional
with an Applicative functionPPrism.modifyOptionF
(F<A, Option<B>> f) modify polymorphically the target of aPPrism
with an Applicative functionPTraversal.modifyOptionF
(F<A, Option<B>> f) modify polymorphically the target of aPTraversal
with an Applicative functionTraversal.modifyOptionF
(F<A, Option<A>> f) modify polymorphically the target of aPIso
with an Applicative functionmodify polymorphically the target of aPLens
with an Applicative functionmodify polymorphically the target of aPOptional
with an Applicative functionmodify polymorphically the target of aPPrism
with an Applicative functionmodify polymorphically the target of aPTraversal
with an Applicative functionLens.modifyPromiseF
(F<A, Promise<A>> f) Optional.modifyPromiseF
(F<A, Promise<A>> f) PIso.modifyPromiseF
(F<A, Promise<B>> f) modify polymorphically the target of aPIso
with an Applicative functionPLens.modifyPromiseF
(F<A, Promise<B>> f) modify polymorphically the target of aPLens
with an Applicative functionPOptional.modifyPromiseF
(F<A, Promise<B>> f) modify polymorphically the target of aPOptional
with an Applicative functionPPrism.modifyPromiseF
(F<A, Promise<B>> f) modify polymorphically the target of aPPrism
with an Applicative functionPTraversal.modifyPromiseF
(F<A, Promise<B>> f) modify polymorphically the target of aPTraversal
with an Applicative functionTraversal.modifyPromiseF
(F<A, Promise<A>> f) Lens.modifyStreamF
(F<A, Stream<A>> f) Optional.modifyStreamF
(F<A, Stream<A>> f) PIso.modifyStreamF
(F<A, Stream<B>> f) modify polymorphically the target of aPIso
with an Applicative functionPLens.modifyStreamF
(F<A, Stream<B>> f) modify polymorphically the target of aPLens
with an Applicative functionPOptional.modifyStreamF
(F<A, Stream<B>> f) modify polymorphically the target of aPOptional
with an Applicative functionPPrism.modifyStreamF
(F<A, Stream<B>> f) modify polymorphically the target of aPPrism
with an Applicative functionPTraversal.modifyStreamF
(F<A, Stream<B>> f) modify polymorphically the target of aPTraversal
with an Applicative functionTraversal.modifyStreamF
(F<A, Stream<A>> f) F
<S, Trampoline<S>> Lens.modifyTrampolineF
(F<A, Trampoline<A>> f) F
<S, Trampoline<S>> Optional.modifyTrampolineF
(F<A, Trampoline<A>> f) final F
<S, Trampoline<T>> PIso.modifyTrampolineF
(F<A, Trampoline<B>> f) modify polymorphically the target of aPIso
with an Applicative functionabstract F
<S, Trampoline<T>> PLens.modifyTrampolineF
(F<A, Trampoline<B>> f) modify polymorphically the target of aPLens
with an Applicative functionabstract F
<S, Trampoline<T>> POptional.modifyTrampolineF
(F<A, Trampoline<B>> f) modify polymorphically the target of aPOptional
with an Applicative functionfinal F
<S, Trampoline<T>> PPrism.modifyTrampolineF
(F<A, Trampoline<B>> f) modify polymorphically the target of aPPrism
with an Applicative functionabstract F
<S, Trampoline<T>> PTraversal.modifyTrampolineF
(F<A, Trampoline<B>> f) modify polymorphically the target of aPTraversal
with an Applicative functionF
<S, Trampoline<S>> Traversal.modifyTrampolineF
(F<A, Trampoline<A>> f) modify polymorphically the target of aPIso
with an Applicative functionmodify polymorphically the target of aPLens
with an Applicative functionmodify polymorphically the target of aPOptional
with an Applicative functionmodify polymorphically the target of aPPrism
with an Applicative functionmodify polymorphically the target of aPTraversal
with an Applicative function<E> F
<S, Validation<E, S>> Lens.modifyValidationF
(F<A, Validation<E, A>> f) <E> F
<S, Validation<E, S>> Optional.modifyValidationF
(F<A, Validation<E, A>> f) final <E> F
<S, Validation<E, T>> PIso.modifyValidationF
(F<A, Validation<E, B>> f) modify polymorphically the target of aPIso
with an Applicative functionabstract <E> F
<S, Validation<E, T>> PLens.modifyValidationF
(F<A, Validation<E, B>> f) modify polymorphically the target of aPLens
with an Applicative functionabstract <E> F
<S, Validation<E, T>> POptional.modifyValidationF
(F<A, Validation<E, B>> f) modify polymorphically the target of aPOptional
with an Applicative functionfinal <E> F
<S, Validation<E, T>> PPrism.modifyValidationF
(F<A, Validation<E, B>> f) modify polymorphically the target of aPPrism
with an Applicative functionabstract <E> F
<S, Validation<E, T>> PTraversal.modifyValidationF
(Semigroup<E> s, F<A, Validation<E, B>> f) modify polymorphically the target of aPTraversal
with an Applicative function<E> F
<S, Validation<E, S>> Traversal.modifyValidationF
(Semigroup<E> s, F<A, Validation<E, A>> f) static final <S,
A> Optional <S, A> static <S,
T, A, B>
PIso<S, T, A, B> create aPIso
using a pair of functions: one to get the target and one to get the source.static <S,
T, A, B>
PLens<S, T, A, B> create aPLens
using a pair of functions: one to get the target, one to set the target.static <S,
T, A, B>
POptional<S, T, A, B> create aPOptional
using the canonical functions: getOrModify and setstatic <S,
T, A, B>
PPrism<S, T, A, B> create aPPrism
using the canonical functions: getOrModify and reverseGetstatic <S,
A> Prism <S, A> static <S,
T, A, B>
PSetter<S, T, A, B> static <S,
T, A, B>
PTraversal<S, T, A, B> PTraversal.pTraversal
(F<S, A> get1, F<S, A> get2, F<S, A> get3, F<S, A> get4, F<S, A> get5, F<S, A> get6, F7<B, B, B, B, B, B, S, T> set) static <S,
T, A, B>
PTraversal<S, T, A, B> PTraversal.pTraversal
(F<S, A> get1, F<S, A> get2, F<S, A> get3, F<S, A> get4, F<S, A> get5, F6<B, B, B, B, B, S, T> set) static <S,
T, A, B>
PTraversal<S, T, A, B> static <S,
T, A, B>
PTraversal<S, T, A, B> PTraversal.pTraversal
(F<S, A> get1, F<S, A> get2, F<S, A> get3, F4<B, B, B, S, T> set) static <S,
T, A, B>
PTraversal<S, T, A, B> PTraversal.pTraversal
(F<S, A> get1, F<S, A> get2, F3<B, B, S, T> set) static <S,
A> Setter <S, A> alias forPSetter
constructor with a monomorphic modify functionstatic <S,
A> Traversal <S, A> Traversal.traversal
(F<S, A> get1, F<S, A> get2, F<S, A> get3, F<S, A> get4, F<S, A> get5, F<S, A> get6, F7<A, A, A, A, A, A, S, S> set) static <S,
A> Traversal <S, A> Traversal.traversal
(F<S, A> get1, F<S, A> get2, F<S, A> get3, F<S, A> get4, F<S, A> get5, F6<A, A, A, A, A, S, S> set) static <S,
A> Traversal <S, A> static <S,
A> Traversal <S, A> static <S,
A> Traversal <S, A> Method parameters in fj.data.optic with type arguments of type FModifier and TypeMethodDescriptionprivate static <S,
T, A, B>
PTraversal<S, T, A, B> PTraversal.fromCurried
(PTraversal<S, F<B, T>, A, B> curriedTraversal, F<S, A> lastGet) Lens.modifyFunctionF
(F<A, F<C, A>> f) Optional.modifyFunctionF
(F<A, F<C, A>> f) PIso.modifyFunctionF
(F<A, F<C, B>> f) modify polymorphically the target of aPIso
with an Applicative functionPLens.modifyFunctionF
(F<A, F<C, B>> f) modify polymorphically the target of aPLens
with an Applicative functionPOptional.modifyFunctionF
(F<A, F<C, B>> f) modify polymorphically the target of aPOptional
with an Applicative functionPPrism.modifyFunctionF
(F<A, F<C, B>> f) modify polymorphically the target of aPPrism
with an Applicative functionPTraversal.modifyFunctionF
(F<A, F<C, B>> f) modify polymorphically the target of aPTraversal
with an Applicative functionTraversal.modifyFunctionF
(F<A, F<C, A>> f) static <S,
T, A, B>
PSetter<S, T, A, B> static <S,
T, A, B>
PSetter<S, T, A, B> static <S,
A> Setter <S, A> alias forPSetter
constructor with a monomorphic modify functionstatic <S,
A> Setter <S, A> alias forPSetter
constructor with a monomorphic modify function -
Uses of F in fj.data.vector
Methods in fj.data.vector that return FModifier and TypeMethodDescriptionV2.__1()
A first-class function to get the first element of a vector.V3.__1()
A first-class function to get the first element of a vector.V4.__1()
A first-class function to get the first element of a vector.V5.__1()
A first-class function to get the first element of a vector.V6.__1()
A first-class function to get the first element of a vector.V7.__1()
A first-class function to get the first element of a vector.V8.__1()
A first-class function to get the first element of a vector.V2.__2()
A first-class function to get the second element of a vector.V3.__2()
A first-class function to get the second element of a vector.V4.__2()
A first-class function to get the second element of a vector.V5.__2()
A first-class function to get the second element of a vector.V6.__2()
A first-class function to get the second element of a vector.V7.__2()
A first-class function to get the second element of a vector.V8.__2()
A first-class function to get the second element of a vector.V3.__3()
A first-class function to get the third element of a vector.V4.__3()
A first-class function to get the third element of a vector.V5.__3()
A first-class function to get the third element of a vector.V6.__3()
A first-class function to get the third element of a vector.V7.__3()
A first-class function to get the third element of a vector.V8.__3()
A first-class function to get the third element of a vector.V4.__4()
A first-class function to get the fourth element of a vector.V5.__4()
A first-class function to get the fourth element of a vector.V6.__4()
A first-class function to get the fourth element of a vector.V7.__4()
A first-class function to get the fourth element of a vector.V8.__4()
A first-class function to get the fourth element of a vector.V5.__5()
A first-class function to get the fifth element of a vector.V6.__5()
A first-class function to get the fifth element of a vector.V7.__5()
A first-class function to get the fifth element of a vector.V8.__5()
A first-class function to get the fifth element of a vector.V6.__6()
A first-class function to get the sixth element of a vector.V7.__6()
A first-class function to get the sixth element of a vector.V8.__6()
A first-class function to get the sixth element of a vector.V7.__7()
A first-class function to get the seventh element of a vector.V8.__7()
A first-class function to get the seventh element of a vector.V8.__8()
A first-class function to get the eighth element of a vector.V2.p_()
Returns a function that transforms a vector-2 to the equivalent product-2.V3.p_()
Returns a function that transforms a vector-3 to the equivalent product-3.V4.p_()
Returns a function that transforms a vector-4 to the equivalent product-4.V5.p_()
Returns a function that transforms a vector-5 to the equivalent product-5.V6.p_()
Returns a function that transforms a vector-6 to the equivalent product-6.V7.p_()
Returns a function that transforms a vector-7 to the equivalent product-7.V8.p_()
Returns a function that transforms a vector-8 to the equivalent product-8.V2.toStream_()
Returns a function that transforms a vector-2 to a stream of its elements.V3.toStream_()
Returns a function that transforms a vector-3 to a stream of its elements.V4.toStream_()
Returns a function that transforms a vector-4 to a stream of its elements.V5.toStream_()
Returns a function that transforms a vector-5 to a stream of its elements.V6.toStream_()
Returns a function that transforms a vector-6 to a stream of its elements.V7.toStream_()
Returns a function that transforms a vector-7 to a stream of its elements.V8.toStream_()
Returns a function that transforms a vector-8 to a stream of its elements.Methods in fj.data.vector with parameters of type FModifier and TypeMethodDescription<B> V2
<B> Maps the given function across this vector.<B> V3
<B> Maps the given function across this vector.<B> V4
<B> Maps the given function across this vector.<B> V5
<B> Maps the given function across this vector.<B> V6
<B> Maps the given function across this vector.<B> V7
<B> Maps the given function across this vector.<B> V8
<B> Maps the given function across this vector.<B,
C> V2 <C> Zips this vector with the given vector using the given function to produce a new vector.<B,
C> V3 <C> Zips this vector with the given vector using the given function to produce a new vector.<B,
C> V4 <C> Zips this vector with the given vector using the given function to produce a new vector.<B,
C> V5 <C> Zips this vector with the given vector using the given function to produce a new vector.<B,
C> V6 <C> Zips this vector with the given vector using the given function to produce a new vector.<B,
C> V7 <C> Zips this vector with the given vector using the given function to produce a new vector.<B,
C> V8 <C> Zips this vector with the given vector using the given function to produce a new vector.Method parameters in fj.data.vector with type arguments of type FModifier and TypeMethodDescription<B> V2
<B> Performs function application within a vector (applicative functor pattern).<B> V3
<B> Performs function application within a vector (applicative functor pattern).<B> V4
<B> Performs function application within a vector (applicative functor pattern).<B> V5
<B> Performs function application within a vector (applicative functor pattern).<B> V6
<B> Performs function application within a vector (applicative functor pattern).<B> V7
<B> Performs function application within a vector (applicative functor pattern).<B> V8
<B> Performs function application within a vector (applicative functor pattern).<B,
C> V2 <C> Zips this vector with the given vector using the given function to produce a new vector.<B,
C> V3 <C> Zips this vector with the given vector using the given function to produce a new vector.<B,
C> V4 <C> Zips this vector with the given vector using the given function to produce a new vector.<B,
C> V5 <C> Zips this vector with the given vector using the given function to produce a new vector.<B,
C> V6 <C> Zips this vector with the given vector using the given function to produce a new vector.<B,
C> V7 <C> Zips this vector with the given vector using the given function to produce a new vector.<B,
C> V8 <C> Zips this vector with the given vector using the given function to produce a new vector. -
Uses of F in fj.function
Fields in fj.function declared as FModifier and TypeFieldDescriptionstatic final F
<BigInteger, BigInteger> BigIntegers.abs
Absolute value.Doubles.abs
Absolute value.Integers.abs
Absolute value.Longs.abs
Absolute value.static final F
<BigInteger, F<BigInteger, BigInteger>> BigIntegers.add
Curried Integer addition.Doubles.add
Curried Double addition.Integers.add
Curried Integer addition.Longs.add
Curried Long addition.Booleans.and
Curried form of logical "and" (conjunction).Strings.contains
A curried version ofString.contains(CharSequence)
.Characters.digit
Doubles.even
Evenness.Integers.even
Evenness.Characters.getDirectionality
Characters.getNumericValue
Characters.getType
Doubles.gteZero
A function that returns true if the given double is greater than or equal to zero.Integers.gteZero
A function that returns true if the given integer is greater than or equal to zero.Doubles.gtZero
A function that returns true if the given double is greater than zero.Integers.gtZero
A function that returns true if the given integer is greater than zero.Booleans.if_
Curried form of logical "if" (reverse material implication).Booleans.iff
Curried form of logical "if and only if" (biconditional, equivalence).Booleans.implies
Curried form of logical "only if" (material implication).Characters.isDefined
Characters.isDigit
Strings.isEmpty
A curried version ofString.isEmpty()
.Characters.isIdentifierIgnorable
Characters.isISOControl
Characters.isJavaIdentifierPart
Characters.isJavaIdentifierStart
Characters.isLetter
Characters.isLetterOrDigit
Characters.isLowerCase
Characters.isMirrored
Characters.isNewLine
Strings.isNotNullOrBlank
This function checks if a given String contains any non-whitespace character (according toCharacter.isWhitespace(char)
) and if it's also notnull
and not empty ("").Strings.isNotNullOrEmpty
This function checks if a given String is neithernull
nor empty.Strings.isNullOrBlank
This function checks if a given String is whitespace (according toCharacter.isWhitespace(char)
), empty ("") ornull
.Strings.isNullOrEmpty
This function checks if a given String isnull
or empty (String.isEmpty()
).Characters.isSpaceChar
Characters.isTitleCase
Characters.isUnicodeIdentifierPart
Characters.isUnicodeIdentifierStart
Characters.isUpperCase
Characters.isWhitespace
Strings.length
A curried version ofString.length()
.Doubles.lteZero
A function that returns true if the given double is less than or equal to zero.Integers.lteZero
A function that returns true if the given integer is less than or equal to zero.Doubles.ltZero
A function that returns true if the given double is less than zero.Integers.ltZero
A function that returns true if the given integer is less than zero.Strings.matches
A curried version ofString.matches(String)
.static final F
<BigInteger, F<BigInteger, BigInteger>> BigIntegers.multiply
Curried Integer multiplication.Doubles.multiply
Curried Double multiplication.Integers.multiply
Curried Integer multiplication.Longs.multiply
Curried Long multiplication.static final F
<BigInteger, BigInteger> BigIntegers.negate
Negation.Doubles.negate
Negation.Integers.negate
Negation.Longs.negate
Negation.Booleans.nif
Curried form of logical "not if" (reverse nonimplication).Booleans.nimp
Curried form of logical "not implies" (nonimplication).Booleans.nor
Curried form of logical "not or".Booleans.not
Logical negation.Booleans.or
Curried form of logical "inclusive or" (disjunction).static final F
<BigInteger, F<Integer, BigInteger>> BigIntegers.power
Power.Doubles.power
Power.Integers.power
Power.static final F
<BigInteger, F<BigInteger, BigInteger>> BigIntegers.remainder
Remainder.Doubles.remainder
Remainder.Integers.remainder
Remainder.Longs.remainder
Remainder.Characters.reverseBytes
static final F
<BigInteger, F<BigInteger, BigInteger>> BigIntegers.subtract
Curried Integer subtraction.Doubles.subtract
Curried Double subtraction.Integers.subtract
Curried Integer subtraction.Longs.subtract
Curried Long subtraction.Characters.toLowerCase
Characters.toString
Characters.toTitleCase
Characters.toUpperCase
Booleans.xor
Curried form of logical xor (nonequivalence).Fields in fj.function with type parameters of type FModifier and TypeFieldDescriptionstatic final F
<BigInteger, F<BigInteger, BigInteger>> BigIntegers.add
Curried Integer addition.Doubles.add
Curried Double addition.Integers.add
Curried Integer addition.Longs.add
Curried Long addition.Booleans.and
Curried form of logical "and" (conjunction).Strings.contains
A curried version ofString.contains(CharSequence)
.Characters.digit
Booleans.if_
Curried form of logical "if" (reverse material implication).Booleans.iff
Curried form of logical "if and only if" (biconditional, equivalence).Booleans.implies
Curried form of logical "only if" (material implication).Strings.matches
A curried version ofString.matches(String)
.static final F
<BigInteger, F<BigInteger, BigInteger>> BigIntegers.multiply
Curried Integer multiplication.Doubles.multiply
Curried Double multiplication.Integers.multiply
Curried Integer multiplication.Longs.multiply
Curried Long multiplication.Booleans.nif
Curried form of logical "not if" (reverse nonimplication).Booleans.nimp
Curried form of logical "not implies" (nonimplication).Booleans.nor
Curried form of logical "not or".Booleans.or
Curried form of logical "inclusive or" (disjunction).static final F
<BigInteger, F<Integer, BigInteger>> BigIntegers.power
Power.Doubles.power
Power.Integers.power
Power.static final F
<BigInteger, F<BigInteger, BigInteger>> BigIntegers.remainder
Remainder.Doubles.remainder
Remainder.Integers.remainder
Remainder.Longs.remainder
Remainder.static final F
<BigInteger, F<BigInteger, BigInteger>> BigIntegers.subtract
Curried Integer subtraction.Doubles.subtract
Curried Double subtraction.Integers.subtract
Curried Integer subtraction.Longs.subtract
Curried Long subtraction.Booleans.xor
Curried form of logical xor (nonequivalence).Methods in fj.function that return FModifier and TypeMethodDescriptioncomposes the given predicate using conjunctionReturns a composed predicate of given List of predicatesReturns composed predicateVisitor.association
(List<P2<A, B>> x, Equal<A> eq) Uses an association list to perform a lookup with equality and returns a function that can be applied to a default, followed by the associated key to return a value.Visitor.associationLazy
(List<P2<A, B>> x, Equal<A> eq) Uses an association list to perform a lookup with equality and returns a function that can be applied to a default, followed by the associated key to return a value.Booleans.cond()
Curried form of conditional.maps given function to the predicate functiondefault <C,
D> F <C, D> Doubles.fromString()
A function that converts strings to doubles.Integers.fromString()
A function that converts strings to integers.Longs.fromString()
A function that converts strings to integers.alias for contramapreturns inverse of contramapStrings.lines()
Negates the given predicate.returns composed predicate using disjunctionReturns a composed predicate of given List of predicatesReturns a composed predicate of given Stream of predicatesEffect1.toF()
Strings.unlines()
composes the given predicate using exclusive disjunctionMethods in fj.function that return types with arguments of type FModifier and TypeMethodDescriptionVisitor.association
(List<P2<A, B>> x, Equal<A> eq) Uses an association list to perform a lookup with equality and returns a function that can be applied to a default, followed by the associated key to return a value.Visitor.associationLazy
(List<P2<A, B>> x, Equal<A> eq) Uses an association list to perform a lookup with equality and returns a function that can be applied to a default, followed by the associated key to return a value.Booleans.cond()
Curried form of conditional.Booleans.cond()
Curried form of conditional.Methods in fj.function with parameters of type FModifier and TypeMethodDescriptioncomposes the given predicate using conjunctionmaps given function to the predicate functiondefault <C> Effect1
<C> default <C,
D> F <C, D> static <A> Effect1
<A> alias for contramapreturns inverse of contramapNegates the given predicate.default <C> Effect1
<C> returns composed predicate using disjunctioncomposes the given predicate using exclusive disjunctionMethod parameters in fj.function with type arguments of type FModifier and TypeMethodDescriptionReturns a composed predicate of given List of predicatesReturns composed predicatestatic <A,
B> B Visitor.nullableVisitor
(List<F<A, B>> visitors, F0<B> def, A value) Returns the first non-null
value found in the list of visitors after application of the given value, otherwise returns the given default.Returns a composed predicate of given List of predicatesReturns a composed predicate of given Stream of predicatesstatic <A,
B> B Returns the first value found in the list of visitors after application of the given value, otherwise returns the given default. -
Uses of F in fj.java.util
Methods in fj.java.util with parameters of type F -
Uses of F in fj.parser
Modifier and TypeMethodDescriptionResult.bimap()
First-class bifunctor map.Result.mapRest()
First-class function mapping across the remainder of the parse input.Result.mapValue()
First-class function mapping across the parse value.Result.result()
First-class construction of a result.Modifier and TypeMethodDescriptionResult.bimap()
First-class bifunctor map.Result.bimap()
First-class bifunctor map.Result.bimap()
First-class bifunctor map.Result.mapRest()
First-class function mapping across the remainder of the parse input.Result.mapValue()
First-class function mapping across the parse value.Result.result()
First-class construction of a result.Modifier and TypeMethodDescriptionReturns a parser that produces an alpha character.Returns a parser that produces an alpha character.Returns a parser that produces an alpha-numeric character.Returns a parser that produces an alpha-numeric character.<B,
J> Result <J, B> A bifunctor map across both the remainder of the parse input and the parse value.Binds the given function across the parser with a final join.Binds the given function across the parsers with a final join.Binds the given function across the parsers with a final join.Binds the given function across the parsers with a final join.Parser.bind
(Parser<I, B, E> pb, Parser<I, C, E> pc, Parser<I, D, E> pd, Parser<I, E$, E> pe, F<A, F<B, F<C, F<D, F<E$, F$>>>>> f) Binds the given function across the parsers with a final join.Parser.bind
(Parser<I, B, E> pb, Parser<I, C, E> pc, Parser<I, D, E> pd, Parser<I, E$, E> pe, Parser<I, F$, E> pf, F<A, F<B, F<C, F<D, F<E$, F<F$, G>>>>>> f) Binds the given function across the parsers with a final join.Parser.bind
(Parser<I, B, E> pb, Parser<I, C, E> pc, Parser<I, D, E> pd, Parser<I, E$, E> pe, Parser<I, F$, E> pf, Parser<I, G, E> pg, F<A, F<B, F<C, F<D, F<E$, F<F$, F<G, H>>>>>>> f) Binds the given function across the parsers with a final join.Parser.bind
(Parser<I, B, E> pb, Parser<I, C, E> pc, Parser<I, D, E> pd, Parser<I, E$, E> pe, Parser<I, F$, E> pf, Parser<I, G, E> pg, Parser<I, H, E> ph, F<A, F<B, F<C, F<D, F<E$, F<F$, F<G, F<H, I$>>>>>>>> f) Binds the given function across the parsers with a final join.Returns a parser that produces the given character or fails otherwise.Returns a parser that produces the given character or fails otherwise.Parser.CharsParser.characters
(E missing, F<Character, E> sat, Stream<Character> cs) Returns a parser that produces the given stream of characters or fails otherwise.Returns a parser that produces the given stream of characters or fails otherwise.Returns a parser that produces a defined character.Returns a parser that produces a defined character.Returns a parser that produces a digit (0 to 9).Returns a parser that produces a digit (0 to 9).Returns a parser that fails with the given error if the result value does not meet the given predicate.Parser.CharsParser.highSurrogate
(E missing, F<Character, E> sat) Returns a parser that produces a high-surrogate character.Parser.CharsParser.highSurrogate
(F0<E> missing, F<Character, E> sat) Returns a parser that produces a high-surrogate character.Parser.CharsParser.identifierIgnorable
(E missing, F<Character, E> sat) Returns a parser that produces an identifier-ignorable character.Parser.CharsParser.identifierIgnorable
(F0<E> missing, F<Character, E> sat) Returns a parser that produces an identifier-ignorable character.Parser.CharsParser.isoControl
(E missing, F<Character, E> sat) Returns a parser that produces an ISO control character.Parser.CharsParser.isoControl
(F0<E> missing, F<Character, E> sat) Returns a parser that produces an ISO control character.Parser.CharsParser.javaIdentifierPart
(E missing, F<Character, E> sat) Returns a parser that produces a Java identifier part character.Parser.CharsParser.javaIdentifierPart
(F0<E> missing, F<Character, E> sat) Returns a parser that produces a Java identifier part character.Parser.CharsParser.javaIdentifierStart
(E missing, F<Character, E> sat) Returns a parser that produces a Java identifier start character.Parser.CharsParser.javaIdentifierStart
(F0<E> missing, F<Character, E> sat) Returns a parser that produces a Java identifier start character.Returns a parser that produces a lower-case character.Returns a parser that produces a lower-case character.Parser.CharsParser.lowSurrogate
(E missing, F<Character, E> sat) Returns a parser that produces a low-surrogate character.Parser.CharsParser.lowSurrogate
(F0<E> missing, F<Character, E> sat) Returns a parser that produces a low-surrogate character.Maps the given result type across this parser.Maps the given function across this parser's error.Maps the given function across the remainder of the parse input.Maps the given function across the parse value.Returns a parser that produces a mirrored character.Returns a parser that produces a mirrored character.static <I,
A, E> Parser <I, A, E> Parser.parser
(F<I, Validation<E, Result<I, A>>> f) Returns a parser that computes using the given function.Returns a parser that produces an element from the stream that satisfies the given predicate, or fails.Returns a parser that produces an element from the stream that satisfies the given predicate, or fails.Returns a parser that produces a space character.Returns a parser that produces a space character.Returns a parser that produces the given string or fails otherwise.Returns a parser that produces the given string or fails otherwise.Returns a parser that produces a title-case character.Returns a parser that produces a title-case character.Parser.CharsParser.unicodeIdentiferPart
(E missing, F<Character, E> sat) Returns a parser that produces a unicode identifier part character.Parser.CharsParser.unicodeIdentiferPart
(F0<E> missing, F<Character, E> sat) Returns a parser that produces a unicode identifier part character.Parser.CharsParser.unicodeIdentiferStart
(E missing, F<Character, E> sat) Returns a parser that produces a unicode identifier start character.Parser.CharsParser.unicodeIdentiferStart
(F0<E> missing, F<Character, E> sat) Returns a parser that produces a unicode identifier start character.Returns a parser that produces a upper-case character.Returns a parser that produces a upper-case character.Parser.CharsParser.whitespace
(E missing, F<Character, E> sat) Returns a parser that produces a white-space character.Parser.CharsParser.whitespace
(F0<E> missing, F<Character, E> sat) Returns a parser that produces a white-space character.Maps the parse input type through an invariant functor.Modifier and TypeMethodDescriptionPerforms function application within a parser.Binds the given function across the parsers with a final join.Binds the given function across the parsers with a final join.Binds the given function across the parsers with a final join.Binds the given function across the parsers with a final join.Binds the given function across the parsers with a final join.Binds the given function across the parsers with a final join.Parser.bind
(Parser<I, B, E> pb, Parser<I, C, E> pc, Parser<I, D, E> pd, Parser<I, E$, E> pe, F<A, F<B, F<C, F<D, F<E$, F$>>>>> f) Binds the given function across the parsers with a final join.Parser.bind
(Parser<I, B, E> pb, Parser<I, C, E> pc, Parser<I, D, E> pd, Parser<I, E$, E> pe, F<A, F<B, F<C, F<D, F<E$, F$>>>>> f) Binds the given function across the parsers with a final join.Parser.bind
(Parser<I, B, E> pb, Parser<I, C, E> pc, Parser<I, D, E> pd, Parser<I, E$, E> pe, F<A, F<B, F<C, F<D, F<E$, F$>>>>> f) Binds the given function across the parsers with a final join.Parser.bind
(Parser<I, B, E> pb, Parser<I, C, E> pc, Parser<I, D, E> pd, Parser<I, E$, E> pe, F<A, F<B, F<C, F<D, F<E$, F$>>>>> f) Binds the given function across the parsers with a final join.Parser.bind
(Parser<I, B, E> pb, Parser<I, C, E> pc, Parser<I, D, E> pd, Parser<I, E$, E> pe, Parser<I, F$, E> pf, F<A, F<B, F<C, F<D, F<E$, F<F$, G>>>>>> f) Binds the given function across the parsers with a final join.Parser.bind
(Parser<I, B, E> pb, Parser<I, C, E> pc, Parser<I, D, E> pd, Parser<I, E$, E> pe, Parser<I, F$, E> pf, F<A, F<B, F<C, F<D, F<E$, F<F$, G>>>>>> f) Binds the given function across the parsers with a final join.Parser.bind
(Parser<I, B, E> pb, Parser<I, C, E> pc, Parser<I, D, E> pd, Parser<I, E$, E> pe, Parser<I, F$, E> pf, F<A, F<B, F<C, F<D, F<E$, F<F$, G>>>>>> f) Binds the given function across the parsers with a final join.Parser.bind
(Parser<I, B, E> pb, Parser<I, C, E> pc, Parser<I, D, E> pd, Parser<I, E$, E> pe, Parser<I, F$, E> pf, F<A, F<B, F<C, F<D, F<E$, F<F$, G>>>>>> f) Binds the given function across the parsers with a final join.Parser.bind
(Parser<I, B, E> pb, Parser<I, C, E> pc, Parser<I, D, E> pd, Parser<I, E$, E> pe, Parser<I, F$, E> pf, F<A, F<B, F<C, F<D, F<E$, F<F$, G>>>>>> f) Binds the given function across the parsers with a final join.Parser.bind
(Parser<I, B, E> pb, Parser<I, C, E> pc, Parser<I, D, E> pd, Parser<I, E$, E> pe, Parser<I, F$, E> pf, Parser<I, G, E> pg, F<A, F<B, F<C, F<D, F<E$, F<F$, F<G, H>>>>>>> f) Binds the given function across the parsers with a final join.Parser.bind
(Parser<I, B, E> pb, Parser<I, C, E> pc, Parser<I, D, E> pd, Parser<I, E$, E> pe, Parser<I, F$, E> pf, Parser<I, G, E> pg, F<A, F<B, F<C, F<D, F<E$, F<F$, F<G, H>>>>>>> f) Binds the given function across the parsers with a final join.Parser.bind
(Parser<I, B, E> pb, Parser<I, C, E> pc, Parser<I, D, E> pd, Parser<I, E$, E> pe, Parser<I, F$, E> pf, Parser<I, G, E> pg, F<A, F<B, F<C, F<D, F<E$, F<F$, F<G, H>>>>>>> f) Binds the given function across the parsers with a final join.Parser.bind
(Parser<I, B, E> pb, Parser<I, C, E> pc, Parser<I, D, E> pd, Parser<I, E$, E> pe, Parser<I, F$, E> pf, Parser<I, G, E> pg, F<A, F<B, F<C, F<D, F<E$, F<F$, F<G, H>>>>>>> f) Binds the given function across the parsers with a final join.Parser.bind
(Parser<I, B, E> pb, Parser<I, C, E> pc, Parser<I, D, E> pd, Parser<I, E$, E> pe, Parser<I, F$, E> pf, Parser<I, G, E> pg, F<A, F<B, F<C, F<D, F<E$, F<F$, F<G, H>>>>>>> f) Binds the given function across the parsers with a final join.Parser.bind
(Parser<I, B, E> pb, Parser<I, C, E> pc, Parser<I, D, E> pd, Parser<I, E$, E> pe, Parser<I, F$, E> pf, Parser<I, G, E> pg, F<A, F<B, F<C, F<D, F<E$, F<F$, F<G, H>>>>>>> f) Binds the given function across the parsers with a final join.Parser.bind
(Parser<I, B, E> pb, Parser<I, C, E> pc, Parser<I, D, E> pd, Parser<I, E$, E> pe, Parser<I, F$, E> pf, Parser<I, G, E> pg, Parser<I, H, E> ph, F<A, F<B, F<C, F<D, F<E$, F<F$, F<G, F<H, I$>>>>>>>> f) Binds the given function across the parsers with a final join.Parser.bind
(Parser<I, B, E> pb, Parser<I, C, E> pc, Parser<I, D, E> pd, Parser<I, E$, E> pe, Parser<I, F$, E> pf, Parser<I, G, E> pg, Parser<I, H, E> ph, F<A, F<B, F<C, F<D, F<E$, F<F$, F<G, F<H, I$>>>>>>>> f) Binds the given function across the parsers with a final join.Parser.bind
(Parser<I, B, E> pb, Parser<I, C, E> pc, Parser<I, D, E> pd, Parser<I, E$, E> pe, Parser<I, F$, E> pf, Parser<I, G, E> pg, Parser<I, H, E> ph, F<A, F<B, F<C, F<D, F<E$, F<F$, F<G, F<H, I$>>>>>>>> f) Binds the given function across the parsers with a final join.Parser.bind
(Parser<I, B, E> pb, Parser<I, C, E> pc, Parser<I, D, E> pd, Parser<I, E$, E> pe, Parser<I, F$, E> pf, Parser<I, G, E> pg, Parser<I, H, E> ph, F<A, F<B, F<C, F<D, F<E$, F<F$, F<G, F<H, I$>>>>>>>> f) Binds the given function across the parsers with a final join.Parser.bind
(Parser<I, B, E> pb, Parser<I, C, E> pc, Parser<I, D, E> pd, Parser<I, E$, E> pe, Parser<I, F$, E> pf, Parser<I, G, E> pg, Parser<I, H, E> ph, F<A, F<B, F<C, F<D, F<E$, F<F$, F<G, F<H, I$>>>>>>>> f) Binds the given function across the parsers with a final join.Parser.bind
(Parser<I, B, E> pb, Parser<I, C, E> pc, Parser<I, D, E> pd, Parser<I, E$, E> pe, Parser<I, F$, E> pf, Parser<I, G, E> pg, Parser<I, H, E> ph, F<A, F<B, F<C, F<D, F<E$, F<F$, F<G, F<H, I$>>>>>>>> f) Binds the given function across the parsers with a final join.Parser.bind
(Parser<I, B, E> pb, Parser<I, C, E> pc, Parser<I, D, E> pd, Parser<I, E$, E> pe, Parser<I, F$, E> pf, Parser<I, G, E> pg, Parser<I, H, E> ph, F<A, F<B, F<C, F<D, F<E$, F<F$, F<G, F<H, I$>>>>>>>> f) Binds the given function across the parsers with a final join.