Uses of Class
fj.P2
-
Packages that use P2 Package Description fj Types that set the premise for the existence of Functional Java.fj.control.parallel Parallelization strategies.fj.data Common algebraic data types.fj.data.fingertrees Provides 2-3 finger trees, a functional representation of persistent sequences supporting access to the ends in amortized O(1) time.fj.data.hamt fj.data.hlist Type-safe, extensible, heterogeneous listsfj.data.optic Optic data types adapted from the Scala Monocle library and inspired by the Haskell Lens library.fj.data.vector Fixed-length vectorsfj.function A prelude of commonly used first-class functions -
-
Uses of P2 in fj
Methods in fj that return P2 Modifier and Type Method Description <C> P2<C,B>
P2. cobind(F<P2<A,B>,C> k)
Duplicates this product on the first element, and maps the given function across the duplicate (Comonad pattern).P2<P2<A,B>,B>
P2. duplicate()
Duplicates this product into the first element (Comonad pattern).static <B,C,D>
P2<C,D>P2. fanout(F<B,C> f, F<B,D> g, B b)
Sends the given input value to both argument functions and combines their output.<C> P2<C,B>
P2. inject(C c)
Replaces the first element of this product with the given value.static <A,B>
P2<A,B>P. lazy(F<Unit,A> fa, F<Unit,B> fb)
static <A,B>
P2<A,B>P. lazy(F0<A> pa, F0<B> pb)
static <A,B>
P2<A,B>P. lazyProduct(F0<P2<A,B>> f)
static <A,B>
P2<B,B>P2. map(F<A,B> f, P2<A,A> p)
Maps the given function across both the elements of the given product.<X> P2<X,B>
P2. map1(F<A,X> f)
Map the first element of the product.<X> P2<A,X>
P2. map2(F<B,X> f)
Map the second element of the product.P2<A,B>
P2. memo()
Provides a memoising P2 that remembers its values.P2<Rng,java.lang.Integer>
LcgRng. nextInt()
abstract P2<Rng,java.lang.Integer>
Rng. nextInt()
P2<Rng,java.lang.Long>
LcgRng. nextLong()
(package private) static P2<java.lang.Long,java.lang.Long>
LcgRng. nextLong(long seed)
abstract P2<Rng,java.lang.Long>
Rng. nextLong()
P2<Rng,java.lang.Integer>
Rng. nextNatural()
static <A,B>
P2<A,B>P. p(A a, B b)
A function that puts elements in a product-2.P2<Rng,java.lang.Integer>
Rng. range(int low, int high)
<C,D>
P2<C,D>P2. split(F<A,C> f, F<B,D> g)
Split this product between two argument functions and combine their output.P2<B,A>
P2. swap()
Swaps the elements around in this product.Methods in fj that return types with arguments of type P2 Modifier and Type Method Description static <A,B>
F<P2<A,B>,A>P2. __1()
Returns a function that returns the first element of a product.static <A,B>
F<P2<A,B>,B>P2. __2()
Returns a function that returns the second element of a product.static <A,B>
Lens<P2<A,B>,A>P2.Optic. _1()
Monomorphic lens targeted on _1.static <A,B,C>
PLens<P2<A,B>,P2<C,B>,A,C>P2.Optic. _1p()
Polyomorphic lens targeted on _1.static <A,B,C>
PLens<P2<A,B>,P2<C,B>,A,C>P2.Optic. _1p()
Polyomorphic lens targeted on _1.static <A,B>
Lens<P2<A,B>,B>P2.Optic. _2()
Monomorphic lens targeted on _1.static <A,B,C>
PLens<P2<A,B>,P2<A,C>,B,C>P2.Optic. _2p()
Polyomorphic lens targeted on _2.static <A,B,C>
PLens<P2<A,B>,P2<A,C>,B,C>P2.Optic. _2p()
Polyomorphic lens targeted on _2.<B> Monoid<P2<A,B>>
Monoid. compose(Monoid<B> m)
Composes this monoid with another.P2<P2<A,B>,B>
P2. duplicate()
Duplicates this product into the first element (Comonad pattern).static <A,B,X>
F<P2<A,B>,P2<X,B>>P2. map1_(F<A,X> f)
Promotes a function so that it maps the first element of a product.static <A,B,X>
F<P2<A,B>,P2<X,B>>P2. map1_(F<A,X> f)
Promotes a function so that it maps the first element of a product.static <A,B,X>
F<P2<A,B>,P2<A,X>>P2. map2_(F<B,X> f)
Promotes a function so that it maps the second element of a product.static <A,B,X>
F<P2<A,B>,P2<A,X>>P2. map2_(F<B,X> f)
Promotes a function so that it maps the second element of a product.default F<P2<A,A>,P2<B,B>>
F. mapBoth()
Promotes this function to map over both elements of a pair.default F<P2<A,A>,P2<B,B>>
F. mapBoth()
Promotes this function to map over both elements of a pair.default <C> F<P2<A,C>,P2<B,C>>
F. mapFst()
Promotes this function to map over the first element of a pair.default <C> F<P2<A,C>,P2<B,C>>
F. mapFst()
Promotes this function to map over the first element of a pair.default <C> F<P2<C,A>,P2<C,B>>
F. mapSnd()
Promotes this function to map over the second element of a pair.default <C> F<P2<C,A>,P2<C,B>>
F. mapSnd()
Promotes this function to map over the second element of a pair.static <A,B>
F<A,F<B,P2<A,B>>>P. p2()
A function that puts an element in a product-2.static <A,B>
Equal<P2<A,B>>Equal. p2Equal(Equal<A> ea, Equal<B> eb)
An equal instance for a product-2.static <A,B>
Hash<P2<A,B>>Hash. p2Hash(Hash<A> ha, Hash<B> hb)
A hash instance for a product-2.static <A,B>
Show<P2<A,B>>Show. p2MapShow(Show<A> sa, Show<B> sb)
A show instance for thetuple-2
type in the style of a mapping from A to B.static <A,B>
Ord<P2<A,B>>Ord. p2Ord(Ord<A> oa, Ord<B> ob)
An order instance for a product-2, with the first factor considered most significant.static <A,B>
Ord<P2<A,B>>Ord. p2Ord1(Ord<A> oa)
static <A,B>
Ord<P2<A,B>>Ord. p2Ord2(Ord<B> ob)
static <A,B>
Semigroup<P2<A,B>>Semigroup. p2Semigroup(Semigroup<A> sa, Semigroup<B> sb)
A lazy semigroup for binary products.static <A,B>
Show<P2<A,B>>Show. p2Show(Show<A> sa, Show<B> sb)
A show instance for thetuple-2
type.static <A,B>
Show<P2<A,B>>Show. p2Show(Show<A> sa, Show<B> sb, java.lang.String start, java.lang.String sep, java.lang.String end)
A show instance for thetuple-2
type.static <A,B,C,D>
F<P2<A,B>,P2<C,D>>P2. split_(F<A,C> f, F<B,D> g)
A first-class version of the split function.static <A,B,C,D>
F<P2<A,B>,P2<C,D>>P2. split_(F<A,C> f, F<B,D> g)
A first-class version of the split function.static <A,B>
F<P2<A,B>,P2<B,A>>P2. swap_()
Returns a curried form ofswap()
.static <A,B>
F<P2<A,B>,P2<B,A>>P2. swap_()
Returns a curried form ofswap()
.<C,X>
Either<X,P2<A,C>>P2. traverseEither(F<B,Either<X,C>> f)
<C> IO<P2<A,C>>
P2. traverseIO(F<B,IO<C>> f)
<C> List<P2<A,C>>
P2. traverseList(F<B,List<C>> f)
<C> Option<P2<A,C>>
P2. traverseOption(F<B,Option<C>> f)
<C> Stream<P2<A,C>>
P2. traverseStream(F<B,Stream<C>> f)
default F<P2<A,B>,C>
F2. tuple()
Uncurries this function to a function on tuples.static <A,B,C>
F<P2<A,B>,C>P2. tuple(F<A,F<B,C>> f)
Transforms a curried function of arity-2 to a function of a product-2static <A,B,C>
F<P2<A,B>,C>P2. tuple(F2<A,B,C> f)
Transforms an uncurried function of arity-2 to a function of a product-2Methods in fj with parameters of type P2 Modifier and Type Method Description <C,D>
P4<A,B,C,D>P2. append(P2<C,D> el)
<D,E>
P5<A,B,C,D,E>P3. append(P2<D,E> el)
<E,F>
P6<A,B,C,D,E,F>P4. append(P2<E,F> el)
<F,G>
P7<A,B,C,D,E,F,G>P5. append(P2<F,G> el)
<G,H>
P8<A,B,C,D,E,F,G,H>P6. append(P2<G,H> el)
static <A,B>
P2<B,B>P2. map(F<A,B> f, P2<A,A> p)
Maps the given function across both the elements of the given product.Method parameters in fj with type arguments of type P2 Modifier and Type Method Description <C> P2<C,B>
P2. cobind(F<P2<A,B>,C> k)
Duplicates this product on the first element, and maps the given function across the duplicate (Comonad pattern).static <A,B>
P2<A,B>P. lazyProduct(F0<P2<A,B>> f)
<C> List<C>
P2. sequenceW(List<F<P2<A,B>,C>> fs)
Applies a list of comonadic functions to this product, returning a list of values.<C> Stream<C>
P2. sequenceW(Stream<F<P2<A,B>,C>> fs)
Applies a stream of comonadic functions to this product, returning a stream of values.static <A,B,C>
F2<A,B,C>P2. untuple(F<P2<A,B>,C> f)
Transforms a function of a product-2 to an uncurried function or arity-2. -
Uses of P2 in fj.control.parallel
Fields in fj.control.parallel with type parameters of type P2 Modifier and Type Field Description private Actor<P2<Either<P1<A>,Actor<A>>,Promise<A>>>
Promise. actor
Constructor parameters in fj.control.parallel with type arguments of type P2 Constructor Description Promise(Strategy<Unit> s, Actor<P2<Either<P1<A>,Actor<A>>,Promise<A>>> qa)
-
Uses of P2 in fj.data
Fields in fj.data with type parameters of type P2 Modifier and Type Field Description private F<P2<A,Iteratee.Input<char[]>>,P1<Iteratee.IterV<char[],A>>>
IOFunctions.CharChunkReader. done
private F<P2<A,Iteratee.Input<java.lang.Character>>,Iteratee.IterV<java.lang.Character,A>>
IOFunctions.CharChunkReader2. done
private F<P2<A,Iteratee.Input<java.lang.String>>,P1<Iteratee.IterV<java.lang.String,A>>>
IOFunctions.LineReader. done
private FingerTree<K,P2<K,A>>
PriorityQueue. ftree
private F<S,Trampoline<P2<S,A>>>
State. runF
private Set<P2<K,Option<V>>>
TreeMap. tree
Methods in fj.data that return P2 Modifier and Type Method Description P2<List<A>,List<A>>
List. breakk(F<A,java.lang.Boolean> p)
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.private static <S> P2<S,S>
State. dup(S s)
P2<List<A>,List<A>>
List. partition(F<A,java.lang.Boolean> f)
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.static <A,B>
P2<List<A>,List<B>>Validation. partition(List<Validation<A,B>> list)
Partitions the list into the list of fails and the list of successesP2<S,A>
State. run(S s)
P2<W,A>
Writer. run()
P2<List<A>,List<A>>
List. span(F<A,java.lang.Boolean> p)
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.P2<Stream<A>,Stream<A>>
Stream. span(F<A,java.lang.Boolean> p)
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.P2<Seq<A>,Seq<A>>
Seq. split(int i)
Splits this sequence into a pair of sequences at the given position.P2<Stream<A>,Stream<A>>
Stream. split(F<A,java.lang.Boolean> p)
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.P2<List<A>,List<A>>
List. splitAt(int i)
Splits this list into two lists at the given index.P2<Option<P2<K,A>>,PriorityQueue<K,A>>
PriorityQueue. topDequeue()
Returns a tuple of the node with the highest priority and the rest of the priority queue.static <A,B>
P2<Array<A>,Array<B>>Array. unzip(Array<P2<A,B>> xs)
Transforms an array of pairs into an array of first components and an array of second components.static <A,B>
P2<List<A>,List<B>>List. unzip(List<P2<A,B>> xs)
Transforms a list of pairs into a list of first components and a list of second components.static <A,B>
P2<NonEmptyList<A>,NonEmptyList<B>>NonEmptyList. unzip(NonEmptyList<P2<A,B>> xs)
Transforms a non empty list of pairs into a non empty list of first components and a non empty list of second components.static <A,B>
P2<Stream<A>,Stream<B>>Stream. unzip(Stream<P2<A,B>> xs)
Transforms a stream of pairs into a stream of first components and a stream of second components.P2<java.lang.Boolean,Set<A>>
Set. update(A a, F<A,A> f)
Updates, with the given function, the first element in the set that is equal to the given element, according to the order.P2<java.lang.Boolean,TreeMap<K,V>>
TreeMap. update(K k, F<V,V> f)
Modifies the value for the given key, if present, by applying the given function to it.Methods in fj.data that return types with arguments of type P2 Modifier and Type Method Description <B> Option<P2<A,B>>
Option. bindProduct(Option<B> ob)
static <A> Prism<List<A>,P2<A,List<A>>>
List.Optic. cons()
Cons prismprivate static <A> F<TreeZipper<A>,P2<TreeZipper<A>,P1<Stream<TreeZipper<A>>>>>
TreeZipper. dwn()
java.util.Iterator<P2<K,V>>
TreeMap. iterator()
Returns an iterator for this map's key-value pairs.static <A,B>
F2<List<P2<A,B>>,A,Option<B>>List. lookup(Equal<A> e)
Returns a partially applied version ofList.lookup(Equal, List, Object)
.Option<P2<K,V>>
TreeMap. max()
Returns the maximum (key, value) pair in the tree if the tree is not empty.Option<P2<K,V>>
TreeMap. min()
Returns the minimum (key, value) pair in the tree if the tree is not empty.private static <K,V>
Ord<P2<K,V>>TreeMap. ord(Ord<K> keyOrd)
private static <A> Option<P2<Stream<A>,Stream<A>>>
TreeZipper. splitChildren(Stream<A> acc, Stream<A> xs, int n)
Array<P2<K,V>>
HashMap. toArray()
java.util.Collection<P2<K,V>>
HashMap. toCollection()
Projects an immutable collection of this hash map.List<P2<K,V>>
HashMap. toList()
List<P2<K,A>>
PriorityQueue. toList()
Returns a list of products with priority k and value a.List<P2<K,V>>
TreeMap. toList()
List<P2<K,V>>
TreeMap. toListReverse()
Option<P2<K,V>>
HashMap. toOption()
Option<P2<K,A>>
PriorityQueue. top()
If the tree is not empty, returns the node with highest priority otherwise returns nothing.P2<Option<P2<K,A>>,PriorityQueue<K,A>>
PriorityQueue. topDequeue()
Returns a tuple of the node with the highest priority and the rest of the priority queue.List<P2<K,A>>
PriorityQueue. topN()
Returns all the elements of the queue with the highest (same) priority.Stream<P2<K,V>>
HashMap. toStream()
Stream<P2<K,A>>
PriorityQueue. toStream()
Returns a stream of products with priority k and value a.Stream<P2<K,V>>
TreeMap. toStream()
Stream<P2<K,V>>
TreeMap. toStreamReverse()
private Either<A,P2<java.lang.Boolean,Set<A>>>
Set. tryUpdate(A a, F<A,A> f)
<B> Array<P2<A,B>>
Array. zip(Array<B> bs)
Zips this array with the given array to produce an array of pairs.<B> java.lang.Iterable<P2<A,B>>
IterableW. zip(java.lang.Iterable<B> bs)
Zips this iterable with the given iterable to produce a iterable of pairs.static <A,B>
F<List<A>,F<List<B>,List<P2<A,B>>>>List. zip()
The first-class version of the zip function.<B> List<P2<A,B>>
List. zip(List<B> bs)
Zips this list with the given list to produce a list of pairs.<B> NonEmptyList<P2<A,B>>
NonEmptyList. zip(NonEmptyList<B> bs)
Zips this non empty list with the given non empty list to produce a list of pairs.<B> Stream<P2<A,B>>
Stream. zip(Stream<B> bs)
Zips this stream with the given stream to produce a stream of pairs.Array<P2<A,java.lang.Integer>>
Array. zipIndex()
Zips this array with the index of its element as a pair.java.lang.Iterable<P2<A,java.lang.Integer>>
IterableW. zipIndex()
Zips this iterable with the index of its element as a pair.List<P2<A,java.lang.Integer>>
List. zipIndex()
Zips this list with the index of its element as a pair.NonEmptyList<P2<A,java.lang.Integer>>
NonEmptyList. zipIndex()
Zips this non empty list with the index of its element as a pair.Stream<P2<A,java.lang.Integer>>
Stream. zipIndex()
Zips this stream with the index of its element as a pair.TreeZipper<P2<A,java.lang.Boolean>>
TreeZipper. zipWithFocus()
Zips the nodes in this zipper with a boolean that indicates whether that node has focus.Zipper<P2<A,java.lang.Boolean>>
Zipper. zipWithFocus()
Zips the elements of this zipper with a boolean that indicates whether that element has focus.Methods in fj.data with parameters of type P2 Modifier and Type Method Description static <K,V>
HashMap<K,V>HashMap. arrayHashMap(Equal<K> equal, Hash<K> hash, P2<K,V>... entries)
Converts the array to a HashMapstatic <K,V>
HashMap<K,V>HashMap. arrayHashMap(P2<K,V>... entries)
Converts the array to a HashMapstatic <K,V>
TreeMap<K,V>TreeMap. arrayTreeMap(Ord<K> keyOrd, P2<K,V>... ps)
Constructs a tree map from the given elements.PriorityQueue<K,A>
PriorityQueue. enqueue(P2<K,A> p)
Adds a node with priority k and value a.static <K,V>
TreeMap<K,V>TreeMap. treeMap(Ord<K> keyOrd, P2<K,V>... p2s)
Constructs a tree map from the given elements.Method parameters in fj.data with type arguments of type P2 Modifier and Type Method Description static <A,B>
Tree<B>Tree. bottomUp(Tree<A> t, F<P2<A,Stream<B>>,B> f)
PriorityQueue<K,A>
PriorityQueue. enqueue(List<P2<K,A>> list)
Adds nodes using the list of products with priority k and value a.PriorityQueue<K,A>
PriorityQueue. enqueue(java.lang.Iterable<P2<K,A>> it)
Adds nodes using the iterable of products with priority k and value a.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)
void
HashMap. foreach(F<P2<K,V>,Unit> function)
void
HashMap. foreachDoEffect(Effect1<P2<K,V>> effect)
static <K,V>
HashMap<K,V>HashMap. iterableHashMap(Equal<K> equal, Hash<K> hash, java.lang.Iterable<P2<K,V>> entries)
Converts the Iterable to a HashMapstatic <K,V>
HashMap<K,V>HashMap. iterableHashMap(java.lang.Iterable<P2<K,V>> entries)
Converts the Iterable to a HashMapstatic <K,V>
TreeMap<K,V>TreeMap. iterableTreeMap(Ord<K> keyOrd, java.lang.Iterable<P2<K,V>> it)
Constructs a tree map from the given elements.static <K,V>
HashMap<K,V>HashMap. iteratorHashMap(Equal<K> equal, Hash<K> hash, java.util.Iterator<P2<K,V>> entries)
Converts the Iterator to a HashMapstatic <K,V>
HashMap<K,V>HashMap. iteratorHashMap(java.util.Iterator<P2<K,V>> entries)
Converts the Iterator to a HashMapstatic <K,V>
TreeMap<K,V>TreeMap. iteratorTreeMap(Ord<K> keyOrd, java.util.Iterator<P2<K,V>> it)
Constructs a tree map from the given elements.static <A,B>
Option<B>List. lookup(Equal<A> e, List<P2<A,B>> x, A a)
Returns an associated value with the given key in the list of pairs.<A,B>
HashMap<A,B>HashMap. map(F<P2<K,V>,P2<A,B>> function)
<A,B>
HashMap<A,B>HashMap. map(F<P2<K,V>,P2<A,B>> function)
<A,B>
HashMap<A,B>HashMap. map(F<P2<K,V>,P2<A,B>> function, Equal<A> equal, Hash<A> hash)
<A,B>
HashMap<A,B>HashMap. map(F<P2<K,V>,P2<A,B>> function, Equal<A> equal, Hash<A> hash)
<B> State<S,B>
State. mapState(F<P2<S,A>,P2<S,B>> f)
<B> State<S,B>
State. mapState(F<P2<S,A>,P2<S,B>> f)
static <K,A>
PriorityQueue<K,A>PriorityQueue. priorityQueue(Equal<K> e, FingerTree<K,P2<K,A>> ft)
Creates a priority queue from a finger tree.static <K,V>
TreeMap<K,V>TreeMap. setTreeMap(Ord<K> ord, Set<P2<K,Option<V>>> s)
Constructs a TreeMap from the given set.private static <S,A>
State<S,A>State. suspended(F<S,Trampoline<P2<S,A>>> runF)
static <A,B>
List<A>List. unfold(F<B,Option<P2<A,B>>> f, B b)
Unfolds across the given function starting at the given value to produce a list.static <A,B>
Stream<A>Stream. unfold(F<B,Option<P2<A,B>>> f, B b)
Unfolds across the given function starting at the given value to produce a stream.static <A,B>
F<B,Tree<A>>Tree. unfoldTree(F<B,P2<A,P1<Stream<B>>>> f)
Builds a tree from a seed value.TreeMap<K,V>
TreeMap. union(java.lang.Iterable<P2<K,V>> t2)
The expressiont1.union(t2)
takes the left-biased union oft1
andt2
.static <S,A>
State<S,A>State. unit(F<S,P2<S,A>> runF)
<B> B
PriorityQueue. unqueue(B empty, F2<P2<K,A>,PriorityQueue<K,A>,B> topDequeue)
Performs a reduction on this priority queue using the given arguments.static <A,B>
P2<Array<A>,Array<B>>Array. unzip(Array<P2<A,B>> xs)
Transforms an array of pairs into an array of first components and an array of second components.static <A,B>
P2<List<A>,List<B>>List. unzip(List<P2<A,B>> xs)
Transforms a list of pairs into a list of first components and a list of second components.static <A,B>
P2<NonEmptyList<A>,NonEmptyList<B>>NonEmptyList. unzip(NonEmptyList<P2<A,B>> xs)
Transforms a non empty list of pairs into a non empty list of first components and a non empty list of second components.static <A,B>
P2<Stream<A>,Stream<B>>Stream. unzip(Stream<P2<A,B>> xs)
Transforms a stream of pairs into a stream of first components and a stream of second components.Constructor parameters in fj.data with type arguments of type P2 Constructor Description PriorityQueue(Equal<K> e, FingerTree<K,P2<K,A>> ft)
State(F<S,Trampoline<P2<S,A>>> runF)
TreeMap(Set<P2<K,Option<V>>> tree)
-
Uses of P2 in fj.data.fingertrees
Methods in fj.data.fingertrees that return P2 Modifier and Type Method Description P2<java.lang.Integer,A>
Deep. lookup(F<V,java.lang.Integer> o, int i)
abstract P2<java.lang.Integer,A>
Digit. lookup(F<V,java.lang.Integer> o, int i)
P2<java.lang.Integer,A>
Empty. lookup(F<V,java.lang.Integer> o, int i)
abstract P2<java.lang.Integer,A>
FingerTree. lookup(F<V,java.lang.Integer> o, int i)
P2<java.lang.Integer,A>
Four. lookup(F<V,java.lang.Integer> o, int i)
abstract P2<java.lang.Integer,A>
Node. lookup(F<V,java.lang.Integer> o, int i)
P2<java.lang.Integer,A>
Node2. lookup(F<V,java.lang.Integer> o, int i)
P2<java.lang.Integer,A>
Node3. lookup(F<V,java.lang.Integer> o, int i)
P2<java.lang.Integer,A>
One. lookup(F<V,java.lang.Integer> o, int i)
P2<java.lang.Integer,A>
Single. lookup(F<V,java.lang.Integer> o, int i)
P2<java.lang.Integer,A>
Three. lookup(F<V,java.lang.Integer> o, int i)
P2<java.lang.Integer,A>
Two. lookup(F<V,java.lang.Integer> o, int i)
P2<FingerTree<V,A>,FingerTree<V,A>>
FingerTree. split(F<V,java.lang.Boolean> predicate)
Splits this tree into a pair of subtrees at the point where the given predicate, based on the measure, changes fromfalse
totrue
.Methods in fj.data.fingertrees that return types with arguments of type P2 Modifier and Type Method Description static <A> FingerTree<java.lang.Integer,P2<java.lang.Integer,A>>
FingerTree. emptyIntMax()
Returns a finger tree which combines the integer node annotations with the maximum function. -
Uses of P2 in fj.data.hamt
Fields in fj.data.hamt with type parameters of type P2 Modifier and Type Field Description private Either<P2<K,V>,HashArrayMappedTrie<K,V>>
Node. either
Methods in fj.data.hamt that return types with arguments of type P2 Modifier and Type Method Description List<P2<K,V>>
HashArrayMappedTrie. toList()
Returns a list of key-value pairs.List<P2<K,V>>
HashArrayMappedTrie. toList(Ord<K> o)
Returns the list of key-value pairs, ordered by key.Stream<P2<K,V>>
HashArrayMappedTrie. toStream()
Returns a stream of key-value pairs.Stream<P2<K,V>>
Node. toStream()
Methods in fj.data.hamt with parameters of type P2 Modifier and Type Method Description static <K,V>
Node<K,V>Node. p2Node(P2<K,V> p)
Method parameters in fj.data.hamt with type arguments of type P2 Modifier and Type Method Description <B> B
HashArrayMappedTrie. foldLeft(F2<B,P2<K,V>,B> f, B b)
Performs a left-fold reduction across this trie.<B> B
HashArrayMappedTrie. foldLeft(F2<B,P2<K,V>,B> f, F2<B,HashArrayMappedTrie<K,V>,B> g, B b)
Performs a left-fold reduction across this trie.<B> B
Node. match(F<P2<K,V>,B> f, F<HashArrayMappedTrie<K,V>,B> g)
Performs a reduction on this Node using the given arguments.HashArrayMappedTrie<K,V>
HashArrayMappedTrie. set(List<P2<K,V>> list)
Adds the product of key-value (k, v) pairs to the trie.Constructors in fj.data.hamt with parameters of type P2 Constructor Description Node(P2<K,V> simpleNode)
Constructor parameters in fj.data.hamt with type arguments of type P2 Constructor Description Node(Either<P2<K,V>,HashArrayMappedTrie<K,V>> e)
-
Uses of P2 in fj.data.hlist
Methods in fj.data.hlist with type parameters of type P2 Modifier and Type Method Description static <E,G,V,L extends HList<L>,R,RR,H extends HList.HFoldr<G,V,L,R>,PP extends HList.Apply<G,P2<E,R>,RR>>
HList.HFoldr<G,V,HList.HCons<E,L>,RR>HList.HFoldr. hFoldr(PP p, H h)
A fold instance for a non-empty heterogeneous listMethods in fj.data.hlist that return types with arguments of type P2 Modifier and Type Method Description static <A,B,C>
HList.Apply<HList.HAppend<A,B,C>,P2<A,B>,C>HList.Apply. append()
A function application operator for concatenating heterogeneous lists.static <X,Y,Z>
HList.Apply<Unit,P2<F<X,Y>,F<Y,Z>>,F<X,Z>>HList.Apply. comp()
A function application operator for function composition.static <E,L extends HList<L>>
HList.Apply<Unit,P2<E,L>,HList.HCons<E,L>>HList.Apply. cons()
An operator for the construction of heterogeneous lists.abstract <E> HList.Apply<Unit,P2<E,A>,HList.HCons<E,A>>
HList. extender()
<X> HList.Apply<Unit,P2<X,HList.HCons<E,L>>,HList.HCons<X,HList.HCons<E,L>>>
HList.HCons. extender()
<E> HList.Apply<Unit,P2<E,HList.HNil>,HList.HCons<E,HList.HNil>>
HList.HNil. extender()
-
Uses of P2 in fj.data.optic
Methods in fj.data.optic that return types with arguments of type P2 Modifier and Type Method Description <B> Getter<P2<S,B>,P2<A,B>>
Getter. first()
<B> Getter<P2<S,B>,P2<A,B>>
Getter. first()
<C> Iso<P2<S,C>,P2<A,C>>
Iso. first()
<C> Iso<P2<S,C>,P2<A,C>>
Iso. first()
<C> Optional<P2<S,C>,P2<A,C>>
Optional. first()
<C> Optional<P2<S,C>,P2<A,C>>
Optional. first()
<C> PIso<P2<S,C>,P2<T,C>,P2<A,C>,P2<B,C>>
PIso. first()
<C> PIso<P2<S,C>,P2<T,C>,P2<A,C>,P2<B,C>>
PIso. first()
<C> PIso<P2<S,C>,P2<T,C>,P2<A,C>,P2<B,C>>
PIso. first()
<C> PIso<P2<S,C>,P2<T,C>,P2<A,C>,P2<B,C>>
PIso. first()
<C> POptional<P2<S,C>,P2<T,C>,P2<A,C>,P2<B,C>>
POptional. first()
<C> POptional<P2<S,C>,P2<T,C>,P2<A,C>,P2<B,C>>
POptional. first()
<C> POptional<P2<S,C>,P2<T,C>,P2<A,C>,P2<B,C>>
POptional. first()
<C> POptional<P2<S,C>,P2<T,C>,P2<A,C>,P2<B,C>>
POptional. first()
<S1,A1>
Getter<P2<S,S1>,P2<A,A1>>Getter. product(Getter<S1,A1> other)
pair two disjointGetter
<S1,A1>
Getter<P2<S,S1>,P2<A,A1>>Getter. product(Getter<S1,A1> other)
pair two disjointGetter
<S1,A1>
Iso<P2<S,S1>,P2<A,A1>>Iso. product(Iso<S1,A1> other)
pair two disjointIso
<S1,A1>
Iso<P2<S,S1>,P2<A,A1>>Iso. product(Iso<S1,A1> other)
pair two disjointIso
<S1,T1,A1,B1>
PIso<P2<S,S1>,P2<T,T1>,P2<A,A1>,P2<B,B1>>PIso. product(PIso<S1,T1,A1,B1> other)
pair two disjointPIso
<S1,T1,A1,B1>
PIso<P2<S,S1>,P2<T,T1>,P2<A,A1>,P2<B,B1>>PIso. product(PIso<S1,T1,A1,B1> other)
pair two disjointPIso
<S1,T1,A1,B1>
PIso<P2<S,S1>,P2<T,T1>,P2<A,A1>,P2<B,B1>>PIso. product(PIso<S1,T1,A1,B1> other)
pair two disjointPIso
<S1,T1,A1,B1>
PIso<P2<S,S1>,P2<T,T1>,P2<A,A1>,P2<B,B1>>PIso. product(PIso<S1,T1,A1,B1> other)
pair two disjointPIso
<B> Getter<P2<B,S>,P2<B,A>>
Getter. second()
<B> Getter<P2<B,S>,P2<B,A>>
Getter. second()
<C> Iso<P2<C,S>,P2<C,A>>
Iso. second()
<C> Iso<P2<C,S>,P2<C,A>>
Iso. second()
<C> Optional<P2<C,S>,P2<C,A>>
Optional. second()
<C> Optional<P2<C,S>,P2<C,A>>
Optional. second()
<C> PIso<P2<C,S>,P2<C,T>,P2<C,A>,P2<C,B>>
PIso. second()
<C> PIso<P2<C,S>,P2<C,T>,P2<C,A>,P2<C,B>>
PIso. second()
<C> PIso<P2<C,S>,P2<C,T>,P2<C,A>,P2<C,B>>
PIso. second()
<C> PIso<P2<C,S>,P2<C,T>,P2<C,A>,P2<C,B>>
PIso. second()
<C> POptional<P2<C,S>,P2<C,T>,P2<C,A>,P2<C,B>>
POptional. second()
<C> POptional<P2<C,S>,P2<C,T>,P2<C,A>,P2<C,B>>
POptional. second()
<C> POptional<P2<C,S>,P2<C,T>,P2<C,A>,P2<C,B>>
POptional. second()
<C> POptional<P2<C,S>,P2<C,T>,P2<C,A>,P2<C,B>>
POptional. second()
-
Uses of P2 in fj.data.vector
Fields in fj.data.vector declared as P2 Modifier and Type Field Description private P2<A,A>
V2. inner
Methods in fj.data.vector that return P2 Modifier and Type Method Description P2<A,A>
V2. p()
Returns a homogeneous product-2 equivalent to this vector.Methods in fj.data.vector that return types with arguments of type P2 Modifier and Type Method Description static <A> F<V2<A>,P2<A,A>>
V2. p_()
Returns a function that transforms a vector-2 to the equivalent product-2.<B> V2<P2<A,B>>
V2. zip(V2<B> bs)
Zips this vector with the given vector to produce a vector of pairs.<B> V3<P2<A,B>>
V3. zip(V3<B> bs)
Zips this vector with the given vector to produce a vector of pairs.<B> V4<P2<A,B>>
V4. zip(V4<B> bs)
Zips this vector with the given vector to produce a vector of pairs.<B> V5<P2<A,B>>
V5. zip(V5<B> bs)
Zips this vector with the given vector to produce a vector of pairs.<B> V6<P2<A,B>>
V6. zip(V6<B> bs)
Zips this vector with the given vector to produce a vector of pairs.<B> V7<P2<A,B>>
V7. zip(V7<B> bs)
Zips this vector with the given vector to produce a vector of pairs.<B> V8<P2<A,B>>
V8. zip(V8<B> bs)
Zips this vector with the given vector to produce a vector of pairs.Methods in fj.data.vector with parameters of type P2 Modifier and Type Method Description static <A> V2<A>
V2. p(P2<A,A> p)
Creates a vector-2 from a homogeneous product-2.Constructors in fj.data.vector with parameters of type P2 Constructor Description V2(P2<A,A> inner)
-
Uses of P2 in fj.function
Method parameters in fj.function with type arguments of type P2 Modifier and Type Method Description static <A,B>
F<B,F<A,B>>Visitor. 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.static <A,B>
F<P1<B>,F<A,B>>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.
-