Uses of Class
io.vavr.Tuple2
-
Packages that use Tuple2 Package Description io.vavr BesideAPIthe io.vavr package contains core types like (Checked)Functions and Tuples.io.vavr.collection Purely functional collections based on Traversable.io.vavr.concurrent This package contains basic building blocks for creating fast, asynchronous, non-blocking parallel code.io.vavr.test A property check framework built around Property which integrates well with unit test frameworks like junit. -
-
Uses of Tuple2 in io.vavr
Methods in io.vavr with type parameters of type Tuple2 Modifier and Type Method Description static <T,K,V,E extends Tuple2<? extends K,? extends V>,R extends Map<K,V>>
RValueModule. toMap(Value<T> value, R empty, java.util.function.Function<E,R> ofElement, java.util.function.Function<java.lang.Iterable<E>,R> ofAll, java.util.function.Function<? super T,? extends E> f)Methods in io.vavr that return Tuple2 Modifier and Type Method Description <T2> Tuple2<T1,T2>Tuple1. append(T2 t2)Append a value to this tuple.<T1,T2>
Tuple2<T1,T2>Tuple0. concat(Tuple2<T1,T2> tuple)Concat a tuple's values to this tuple.<T2> Tuple2<T1,T2>Tuple1. concat(Tuple1<T2> tuple)Concat a tuple's values to this tuple.(package private) static <T> Tuple2<T,List<T>>$. Cons(List.Cons<T> cons)static <T1,T2>
Tuple2<T1,T2>Tuple. fromEntry(java.util.Map.Entry<? extends T1,? extends T2> entry)Creates aTuple2from aMap.Entry.<U1,U2>
Tuple2<U1,U2>Tuple2. map(java.util.function.BiFunction<? super T1,? super T2,Tuple2<U1,U2>> mapper)Maps the components of this tuple using a mapper function.<U1,U2>
Tuple2<U1,U2>Tuple2. map(java.util.function.Function<? super T1,? extends U1> f1, java.util.function.Function<? super T2,? extends U2> f2)Maps the components of this tuple using a mapper function for each component.<U> Tuple2<U,T2>Tuple2. map1(java.util.function.Function<? super T1,? extends U> mapper)Maps the 1st component of this tuple to a new value.<U> Tuple2<T1,U>Tuple2. map2(java.util.function.Function<? super T2,? extends U> mapper)Maps the 2nd component of this tuple to a new value.static <T1,T2>
Tuple2<T1,T2>Tuple. narrow(Tuple2<? extends T1,? extends T2> t)Narrows a widenedTuple2<? extends T1, ? extends T2>toTuple2<T1, T2>.static <T1,T2>
Tuple2<T1,T2>Tuple. of(T1 t1, T2 t2)Creates a tuple of two elements.static <T1,T2>
Tuple2<Seq<T1>,Seq<T2>>Tuple. sequence2(java.lang.Iterable<? extends Tuple2<? extends T1,? extends T2>> tuples)Turns a sequence ofTuple2into a Tuple2 ofSeqs.Tuple2<T2,T1>Tuple2. swap()Swaps the elements of thisTuple.static <T1,T2>
Tuple2<T1,T2>API. Tuple(T1 t1, T2 t2)Alias forTuple.of(Object, Object)Creates a tuple of two elements.(package private) static <T1,T2>
Tuple2<T1,T2>$. Tuple2(Tuple2<T1,T2> tuple2)Tuple2<T1,T2>Tuple2. update1(T1 value)Sets the 1st element of this tuple to the givenvalue.Tuple2<T1,T2>Tuple2. update2(T2 value)Sets the 2nd element of this tuple to the givenvalue.Methods in io.vavr that return types with arguments of type Tuple2 Modifier and Type Method Description static <T1,T2,_1 extends T1,_2 extends T2>
API.Match.Pattern2<Tuple2<T1,T2>,_1,_2>Patterns. $Tuple2(API.Match.Pattern<_1,?> p1, API.Match.Pattern<_2,?> p2)static <T1,T2>
java.util.Comparator<Tuple2<T1,T2>>Tuple2. comparator(java.util.Comparator<? super T1> t1Comp, java.util.Comparator<? super T2> t2Comp)default CheckedFunction1<Tuple2<T1,T2>,R>CheckedFunction2. tupled()Returns a tupled version of this function.default Function1<Tuple2<T1,T2>,R>Function2. tupled()Returns a tupled version of this function.Methods in io.vavr with parameters of type Tuple2 Modifier and Type Method Description private static <U1 extends java.lang.Comparable<? super U1>,U2 extends java.lang.Comparable<? super U2>>
intTuple2. compareTo(Tuple2<?,?> o1, Tuple2<?,?> o2)intTuple2. compareTo(Tuple2<T1,T2> that)<T1,T2>
Tuple2<T1,T2>Tuple0. concat(Tuple2<T1,T2> tuple)Concat a tuple's values to this tuple.<T2,T3>
Tuple3<T1,T2,T3>Tuple1. concat(Tuple2<T2,T3> tuple)Concat a tuple's values to this tuple.<T3,T4>
Tuple4<T1,T2,T3,T4>Tuple2. concat(Tuple2<T3,T4> tuple)Concat a tuple's values to this tuple.<T4,T5>
Tuple5<T1,T2,T3,T4,T5>Tuple3. concat(Tuple2<T4,T5> tuple)Concat a tuple's values to this tuple.<T5,T6>
Tuple6<T1,T2,T3,T4,T5,T6>Tuple4. concat(Tuple2<T5,T6> tuple)Concat a tuple's values to this tuple.<T6,T7>
Tuple7<T1,T2,T3,T4,T5,T6,T7>Tuple5. concat(Tuple2<T6,T7> tuple)Concat a tuple's values to this tuple.<T7,T8>
Tuple8<T1,T2,T3,T4,T5,T6,T7,T8>Tuple6. concat(Tuple2<T7,T8> tuple)Concat a tuple's values to this tuple.static <K,V>
Map<K,V>API. LinkedMap(Tuple2<? extends K,? extends V>... entries)Deprecated.Will be removed in a future version.static <K,V>
Map<K,V>API. Map(Tuple2<? extends K,? extends V>... entries)Deprecated.Will be removed in a future version.static <T1,T2>
Tuple2<T1,T2>Tuple. narrow(Tuple2<? extends T1,? extends T2> t)Narrows a widenedTuple2<? extends T1, ? extends T2>toTuple2<T1, T2>.static <K extends java.lang.Comparable<? super K>,V>
SortedMap<K,V>API. SortedMap(Tuple2<? extends K,? extends V>... entries)Deprecated.Will be removed in a future version.static <K,V>
SortedMap<K,V>API. SortedMap(java.util.Comparator<? super K> keyComparator, Tuple2<? extends K,? extends V>... entries)Deprecated.Will be removed in a future version.(package private) static <T1,T2>
Tuple2<T1,T2>$. Tuple2(Tuple2<T1,T2> tuple2)Method parameters in io.vavr with type arguments of type Tuple2 Modifier and Type Method Description <U1,U2>
Tuple2<U1,U2>Tuple2. map(java.util.function.BiFunction<? super T1,? super T2,Tuple2<U1,U2>> mapper)Maps the components of this tuple using a mapper function.static <T,T1 extends U1,U1,T2 extends U2,U2>
API.Match.Pattern2<T,T1,T2>API.Match.Pattern2. of(java.lang.Class<? super T> type, API.Match.Pattern<T1,?> p1, API.Match.Pattern<T2,?> p2, java.util.function.Function<T,Tuple2<U1,U2>> unapply)static <T1,T2>
Tuple2<Seq<T1>,Seq<T2>>Tuple. sequence2(java.lang.Iterable<? extends Tuple2<? extends T1,? extends T2>> tuples)Turns a sequence ofTuple2into a Tuple2 ofSeqs.default <K,V>
java.util.Map<K,V>Value. toJavaMap(java.util.function.Function<? super T,? extends Tuple2<? extends K,? extends V>> f)Converts this to a mutableMap.default <K,V,MAP extends java.util.Map<K,V>>
MAPValue. toJavaMap(java.util.function.Supplier<MAP> factory, java.util.function.Function<? super T,? extends Tuple2<? extends K,? extends V>> f)Converts this to a specific mutableMap.default <K,V>
Map<K,V>Value. toLinkedMap(java.util.function.Function<? super T,? extends Tuple2<? extends K,? extends V>> f)Converts this to aMap.default <K,V>
Map<K,V>Value. toMap(java.util.function.Function<? super T,? extends Tuple2<? extends K,? extends V>> f)Converts this to aMap.default <K,V>
SortedMap<K,V>Value. toSortedMap(java.util.Comparator<? super K> comparator, java.util.function.Function<? super T,? extends Tuple2<? extends K,? extends V>> f)Converts this to aMap.default <K extends java.lang.Comparable<? super K>,V>
SortedMap<K,V>Value. toSortedMap(java.util.function.Function<? super T,? extends Tuple2<? extends K,? extends V>> f)Converts this to aMap. -
Uses of Tuple2 in io.vavr.collection
Fields in io.vavr.collection with type parameters of type Tuple2 Modifier and Type Field Description private RedBlackTree<Tuple2<K,V>>TreeMap. entriesprivate Queue<Tuple2<K,V>>LinkedHashMap. listMethods in io.vavr.collection that return Tuple2 Modifier and Type Method Description private static <T> Tuple2<? extends RedBlackTree<T>,java.lang.Boolean>RedBlackTreeModule.Node. blackify(RedBlackTree<T> tree)Tuple2<V,HashMap<K,V>>HashMap. computeIfAbsent(K key, java.util.function.Function<? super K,? extends V> mappingFunction)Tuple2<V,LinkedHashMap<K,V>>LinkedHashMap. computeIfAbsent(K key, java.util.function.Function<? super K,? extends V> mappingFunction)Tuple2<V,? extends Map<K,V>>Map. computeIfAbsent(K key, java.util.function.Function<? super K,? extends V> mappingFunction)If the specified key is not already associated with a value, attempts to compute its value using the given mapping function and enters it into this map.(package private) static <K,V,M extends Map<K,V>>
Tuple2<V,M>Maps. computeIfAbsent(M map, K key, java.util.function.Function<? super K,? extends V> mappingFunction)Tuple2<V,? extends SortedMap<K,V>>SortedMap. computeIfAbsent(K key, java.util.function.Function<? super K,? extends V> mappingFunction)Tuple2<V,TreeMap<K,V>>TreeMap. computeIfAbsent(K key, java.util.function.Function<? super K,? extends V> mappingFunction)Tuple2<Option<V>,HashMap<K,V>>HashMap. computeIfPresent(K key, java.util.function.BiFunction<? super K,? super V,? extends V> remappingFunction)Tuple2<Option<V>,LinkedHashMap<K,V>>LinkedHashMap. computeIfPresent(K key, java.util.function.BiFunction<? super K,? super V,? extends V> remappingFunction)Tuple2<Option<V>,? extends Map<K,V>>Map. computeIfPresent(K key, java.util.function.BiFunction<? super K,? super V,? extends V> remappingFunction)If the value for the specified key is present, attempts to compute a new mapping given the key and its current mapped value.(package private) static <K,V,M extends Map<K,V>>
Tuple2<Option<V>,M>Maps. computeIfPresent(M map, K key, java.util.function.BiFunction<? super K,? super V,? extends V> remappingFunction)Tuple2<Option<V>,? extends SortedMap<K,V>>SortedMap. computeIfPresent(K key, java.util.function.BiFunction<? super K,? super V,? extends V> remappingFunction)Tuple2<Option<V>,TreeMap<K,V>>TreeMap. computeIfPresent(K key, java.util.function.BiFunction<? super K,? super V,? extends V> remappingFunction)(package private) static <T> Tuple2<? extends RedBlackTree<T>,java.lang.Boolean>RedBlackTreeModule.Node. delete(RedBlackTree<T> tree, T value)(package private) static <T> Tuple2<T,Seq<PriorityQueueBase.Node<T>>>PriorityQueueBase. deleteMin(java.util.Comparator<? super T> comparator, Seq<PriorityQueueBase.Node<T>> forest)fun deleteMin [] = raise EMPTY * | deleteMin ts = * val (Node (x,r,c), ts) = getMin ts * val (ts',xs') = split ([],[],c) * in fold insert xs' (meld (ts, ts')) endTuple2<T,Q>AbstractQueue. dequeue()Removes an element from this Queue.Tuple2<T,PriorityQueue<T>>PriorityQueue. dequeue()static <T> Tuple2<Iterator<T>,Iterator<T>>IteratorModule. duplicate(Iterator<T> iterator)Creates two new iterators that both iterates over the same elements as this iterator and in the same order.static <K,V>
Tuple2<K,V>Map. entry(K key, V value)Convenience factory method to create a key/value pair.private static <T> Tuple2<LinearSeq<T>,java.lang.Integer>LinearSeqModule.Slice. findNextSlice(LinearSeq<T> source, LinearSeq<T> slice)Tuple2<K,V>AbstractMultimap. head()Tuple2<K,V>HashMap. head()Tuple2<K,V>LinkedHashMap. head()Tuple2<K,V>TreeMap. head()Tuple2<K,V>AbstractMultimap. last()Tuple2<K,V>HashMap. last()Tuple2<K,V>LinkedHashMap. last()default Tuple2<K,V>SortedMap. last()Tuple2<K,V>TreeMap. last()Tuple2<M,M>AbstractMultimap. partition(java.util.function.Predicate<? super Tuple2<K,V>> predicate)Tuple2<Array<T>,Array<T>>Array. partition(java.util.function.Predicate<? super T> predicate)Tuple2<BitSet<T>,BitSet<T>>BitSet. partition(java.util.function.Predicate<? super T> predicate)Tuple2<BitSet<T>,BitSet<T>>BitSetModule.AbstractBitSet. partition(java.util.function.Predicate<? super T> predicate)Tuple2<CharSeq,CharSeq>CharSeq. partition(java.util.function.Predicate<? super java.lang.Character> predicate)(package private) static <C extends Traversable<T>,T>
Tuple2<C,C>Collections. partition(C collection, java.util.function.Function<java.lang.Iterable<T>,C> creator, java.util.function.Predicate<? super T> predicate)Tuple2<HashMap<K,V>,HashMap<K,V>>HashMap. partition(java.util.function.Predicate<? super Tuple2<K,V>> predicate)Tuple2<HashSet<T>,HashSet<T>>HashSet. partition(java.util.function.Predicate<? super T> predicate)Tuple2<? extends IndexedSeq<T>,? extends IndexedSeq<T>>IndexedSeq. partition(java.util.function.Predicate<? super T> predicate)default Tuple2<Iterator<T>,Iterator<T>>Iterator. partition(java.util.function.Predicate<? super T> predicate)Tuple2<? extends LinearSeq<T>,? extends LinearSeq<T>>LinearSeq. partition(java.util.function.Predicate<? super T> predicate)Tuple2<LinkedHashMap<K,V>,LinkedHashMap<K,V>>LinkedHashMap. partition(java.util.function.Predicate<? super Tuple2<K,V>> predicate)Tuple2<LinkedHashSet<T>,LinkedHashSet<T>>LinkedHashSet. partition(java.util.function.Predicate<? super T> predicate)default Tuple2<List<T>,List<T>>List. partition(java.util.function.Predicate<? super T> predicate)Tuple2<? extends Map<K,V>,? extends Map<K,V>>Map. partition(java.util.function.Predicate<? super Tuple2<K,V>> predicate)(package private) static <K,V,M extends Map<K,V>>
Tuple2<M,M>Maps. partition(M map, Maps.OfEntries<K,V,M> ofEntries, java.util.function.Predicate<? super Tuple2<K,V>> predicate)Tuple2<? extends Multimap<K,V>,? extends Multimap<K,V>>Multimap. partition(java.util.function.Predicate<? super Tuple2<K,V>> predicate)Tuple2<? extends PriorityQueue<T>,? extends PriorityQueue<T>>PriorityQueue. partition(java.util.function.Predicate<? super T> predicate)Tuple2<Queue<T>,Queue<T>>Queue. partition(java.util.function.Predicate<? super T> predicate)Tuple2<? extends Seq<T>,? extends Seq<T>>Seq. partition(java.util.function.Predicate<? super T> predicate)Tuple2<? extends Set<T>,? extends Set<T>>Set. partition(java.util.function.Predicate<? super T> predicate)Tuple2<? extends SortedMap<K,V>,? extends SortedMap<K,V>>SortedMap. partition(java.util.function.Predicate<? super Tuple2<K,V>> predicate)Tuple2<? extends SortedMultimap<K,V>,? extends SortedMultimap<K,V>>SortedMultimap. partition(java.util.function.Predicate<? super Tuple2<K,V>> predicate)Tuple2<? extends SortedSet<T>,? extends SortedSet<T>>SortedSet. partition(java.util.function.Predicate<? super T> predicate)default Tuple2<Stream<T>,Stream<T>>Stream. partition(java.util.function.Predicate<? super T> predicate)Tuple2<? extends Traversable<T>,? extends Traversable<T>>Traversable. partition(java.util.function.Predicate<? super T> predicate)Creates a partition of thisTraversableby splitting this elements in two in distinct traversables according to a predicate.default Tuple2<Seq<T>,Seq<T>>Tree. partition(java.util.function.Predicate<? super T> predicate)Tuple2<TreeMap<K,V>,TreeMap<K,V>>TreeMap. partition(java.util.function.Predicate<? super Tuple2<K,V>> predicate)Tuple2<TreeSet<T>,TreeSet<T>>TreeSet. partition(java.util.function.Predicate<? super T> predicate)Tuple2<Vector<T>,Vector<T>>Vector. partition(java.util.function.Predicate<? super T> predicate)default Tuple2<T,List<T>>List. pop2()Removes the head element from this List.Tuple2<M,M>AbstractMultimap. span(java.util.function.Predicate<? super Tuple2<K,V>> predicate)Tuple2<Array<T>,Array<T>>Array. span(java.util.function.Predicate<? super T> predicate)Tuple2<BitSet<T>,BitSet<T>>BitSet. span(java.util.function.Predicate<? super T> predicate)Tuple2<BitSet<T>,BitSet<T>>BitSetModule.AbstractBitSet. span(java.util.function.Predicate<? super T> predicate)Tuple2<CharSeq,CharSeq>CharSeq. span(java.util.function.Predicate<? super java.lang.Character> predicate)Tuple2<HashMap<K,V>,HashMap<K,V>>HashMap. span(java.util.function.Predicate<? super Tuple2<K,V>> predicate)Tuple2<HashSet<T>,HashSet<T>>HashSet. span(java.util.function.Predicate<? super T> predicate)Tuple2<? extends IndexedSeq<T>,? extends IndexedSeq<T>>IndexedSeq. span(java.util.function.Predicate<? super T> predicate)default Tuple2<Iterator<T>,Iterator<T>>Iterator. span(java.util.function.Predicate<? super T> predicate)Tuple2<? extends LinearSeq<T>,? extends LinearSeq<T>>LinearSeq. span(java.util.function.Predicate<? super T> predicate)Tuple2<LinkedHashMap<K,V>,LinkedHashMap<K,V>>LinkedHashMap. span(java.util.function.Predicate<? super Tuple2<K,V>> predicate)Tuple2<LinkedHashSet<T>,LinkedHashSet<T>>LinkedHashSet. span(java.util.function.Predicate<? super T> predicate)default Tuple2<List<T>,List<T>>List. span(java.util.function.Predicate<? super T> predicate)Tuple2<? extends Map<K,V>,? extends Map<K,V>>Map. span(java.util.function.Predicate<? super Tuple2<K,V>> predicate)(package private) static <K,V,M extends Map<K,V>>
Tuple2<M,M>Maps. span(M map, Maps.OfEntries<K,V,M> ofEntries, java.util.function.Predicate<? super Tuple2<K,V>> predicate)Tuple2<? extends Multimap<K,V>,? extends Multimap<K,V>>Multimap. span(java.util.function.Predicate<? super Tuple2<K,V>> predicate)Tuple2<? extends PriorityQueue<T>,? extends PriorityQueue<T>>PriorityQueue. span(java.util.function.Predicate<? super T> predicate)Tuple2<Queue<T>,Queue<T>>Queue. span(java.util.function.Predicate<? super T> predicate)Tuple2<? extends Seq<T>,? extends Seq<T>>Seq. span(java.util.function.Predicate<? super T> predicate)Tuple2<? extends Set<T>,? extends Set<T>>Set. span(java.util.function.Predicate<? super T> predicate)Tuple2<? extends SortedMap<K,V>,? extends SortedMap<K,V>>SortedMap. span(java.util.function.Predicate<? super Tuple2<K,V>> predicate)Tuple2<? extends SortedMultimap<K,V>,? extends SortedMultimap<K,V>>SortedMultimap. span(java.util.function.Predicate<? super Tuple2<K,V>> predicate)Tuple2<? extends SortedSet<T>,? extends SortedSet<T>>SortedSet. span(java.util.function.Predicate<? super T> predicate)default Tuple2<Stream<T>,Stream<T>>Stream. span(java.util.function.Predicate<? super T> predicate)Tuple2<? extends Traversable<T>,? extends Traversable<T>>Traversable. span(java.util.function.Predicate<? super T> predicate)Returns a tuple where the first element is the longest prefix of elements that satisfy the givenpredicateand the second element is the remainder.default Tuple2<Seq<T>,Seq<T>>Tree. span(java.util.function.Predicate<? super T> predicate)Tuple2<TreeMap<K,V>,TreeMap<K,V>>TreeMap. span(java.util.function.Predicate<? super Tuple2<K,V>> predicate)Tuple2<TreeSet<T>,TreeSet<T>>TreeSet. span(java.util.function.Predicate<? super T> predicate)Tuple2<Vector<T>,Vector<T>>Vector. span(java.util.function.Predicate<? super T> predicate)(package private) static <T> Tuple2<RedBlackTree<T>,RedBlackTree<T>>RedBlackTreeModule.Node. split(RedBlackTree<T> tree, T value)Tuple2<Array<T>,Array<T>>Array. splitAt(int n)Tuple2<Array<T>,Array<T>>Array. splitAt(java.util.function.Predicate<? super T> predicate)Tuple2<CharSeq,CharSeq>CharSeq. splitAt(int n)Tuple2<CharSeq,CharSeq>CharSeq. splitAt(java.util.function.Predicate<? super java.lang.Character> predicate)default Tuple2<List<T>,List<T>>List. splitAt(int n)default Tuple2<List<T>,List<T>>List. splitAt(java.util.function.Predicate<? super T> predicate)Tuple2<Queue<T>,Queue<T>>Queue. splitAt(int n)Tuple2<Queue<T>,Queue<T>>Queue. splitAt(java.util.function.Predicate<? super T> predicate)Tuple2<? extends Seq<T>,? extends Seq<T>>Seq. splitAt(int n)Splits a Seq at the specified index.Tuple2<? extends Seq<T>,? extends Seq<T>>Seq. splitAt(java.util.function.Predicate<? super T> predicate)Splits a sequence at the first element which satisfies thePredicate, e.g.default Tuple2<Stream<T>,Stream<T>>Stream. splitAt(int n)default Tuple2<Stream<T>,Stream<T>>Stream. splitAt(java.util.function.Predicate<? super T> predicate)Tuple2<Vector<T>,Vector<T>>Vector. splitAt(int n)Tuple2<Vector<T>,Vector<T>>Vector. splitAt(java.util.function.Predicate<? super T> predicate)Tuple2<Array<T>,Array<T>>Array. splitAtInclusive(java.util.function.Predicate<? super T> predicate)Tuple2<CharSeq,CharSeq>CharSeq. splitAtInclusive(java.util.function.Predicate<? super java.lang.Character> predicate)default Tuple2<List<T>,List<T>>List. splitAtInclusive(java.util.function.Predicate<? super T> predicate)Tuple2<Queue<T>,Queue<T>>Queue. splitAtInclusive(java.util.function.Predicate<? super T> predicate)Tuple2<? extends Seq<T>,? extends Seq<T>>Seq. splitAtInclusive(java.util.function.Predicate<? super T> predicate)Splits a sequence at the first element which satisfies thePredicate, e.g.default Tuple2<Stream<T>,Stream<T>>Stream. splitAtInclusive(java.util.function.Predicate<? super T> predicate)Tuple2<Vector<T>,Vector<T>>Vector. splitAtInclusive(java.util.function.Predicate<? super T> predicate)private Tuple2<CharSeq,CharSeq>CharSeq. splitByBuilder(java.lang.StringBuilder sb)static <T> Tuple2<List<T>,List<T>>ListModule.SplitAt. splitByPredicateReversed(List<T> source, java.util.function.Predicate<? super T> predicate)private static <T> Tuple2<RedBlackTreeModule.Node<T>,java.lang.Boolean>RedBlackTreeModule.Node. unbalancedLeft(RedBlackTree.Color color, int blackHeight, RedBlackTree<T> left, T value, RedBlackTree<T> right, RedBlackTreeModule.Empty<T> empty)private static <T> Tuple2<RedBlackTreeModule.Node<T>,java.lang.Boolean>RedBlackTreeModule.Node. unbalancedRight(RedBlackTree.Color color, int blackHeight, RedBlackTree<T> left, T value, RedBlackTree<T> right, RedBlackTreeModule.Empty<T> empty)<T1,T2>
Tuple2<Array<T1>,Array<T2>>Array. unzip(java.util.function.Function<? super T,Tuple2<? extends T1,? extends T2>> unzipper)default <T1,T2>
Tuple2<TreeSet<T1>,TreeSet<T2>>BitSet. unzip(java.util.function.Function<? super T,Tuple2<? extends T1,? extends T2>> unzipper)<T1,T2>
Tuple2<IndexedSeq<T1>,IndexedSeq<T2>>CharSeq. unzip(java.util.function.Function<? super java.lang.Character,Tuple2<? extends T1,? extends T2>> unzipper)<T1,T2>
Tuple2<HashSet<T1>,HashSet<T2>>HashSet. unzip(java.util.function.Function<? super T,Tuple2<? extends T1,? extends T2>> unzipper)<T1,T2>
Tuple2<? extends IndexedSeq<T1>,? extends IndexedSeq<T2>>IndexedSeq. unzip(java.util.function.Function<? super T,Tuple2<? extends T1,? extends T2>> unzipper)default <T1,T2>
Tuple2<Iterator<T1>,Iterator<T2>>Iterator. unzip(java.util.function.Function<? super T,Tuple2<? extends T1,? extends T2>> unzipper)<T1,T2>
Tuple2<? extends LinearSeq<T1>,? extends LinearSeq<T2>>LinearSeq. unzip(java.util.function.Function<? super T,Tuple2<? extends T1,? extends T2>> unzipper)<T1,T2>
Tuple2<LinkedHashSet<T1>,LinkedHashSet<T2>>LinkedHashSet. unzip(java.util.function.Function<? super T,Tuple2<? extends T1,? extends T2>> unzipper)default <T1,T2>
Tuple2<List<T1>,List<T2>>List. unzip(java.util.function.Function<? super T,Tuple2<? extends T1,? extends T2>> unzipper)default Tuple2<Seq<K>,Seq<V>>Map. unzip()default <T1,T2>
Tuple2<Seq<T1>,Seq<T2>>Map. unzip(java.util.function.BiFunction<? super K,? super V,Tuple2<? extends T1,? extends T2>> unzipper)default <T1,T2>
Tuple2<Seq<T1>,Seq<T2>>Map. unzip(java.util.function.Function<? super Tuple2<K,V>,Tuple2<? extends T1,? extends T2>> unzipper)default <T1,T2>
Tuple2<Seq<T1>,Seq<T2>>Multimap. unzip(java.util.function.BiFunction<? super K,? super V,Tuple2<? extends T1,? extends T2>> unzipper)default <T1,T2>
Tuple2<Seq<T1>,Seq<T2>>Multimap. unzip(java.util.function.Function<? super Tuple2<K,V>,Tuple2<? extends T1,? extends T2>> unzipper)<T1,T2>
Tuple2<? extends PriorityQueue<T1>,? extends PriorityQueue<T2>>PriorityQueue. unzip(java.util.function.Function<? super T,Tuple2<? extends T1,? extends T2>> unzipper)<T1,T2>
Tuple2<Queue<T1>,Queue<T2>>Queue. unzip(java.util.function.Function<? super T,Tuple2<? extends T1,? extends T2>> unzipper)<T1,T2>
Tuple2<? extends Seq<T1>,? extends Seq<T2>>Seq. unzip(java.util.function.Function<? super T,Tuple2<? extends T1,? extends T2>> unzipper)<T1,T2>
Tuple2<? extends Set<T1>,? extends Set<T2>>Set. unzip(java.util.function.Function<? super T,Tuple2<? extends T1,? extends T2>> unzipper)<T1,T2>
Tuple2<? extends SortedSet<T1>,? extends SortedSet<T2>>SortedSet. unzip(java.util.function.Function<? super T,Tuple2<? extends T1,? extends T2>> unzipper)default <T1,T2>
Tuple2<Stream<T1>,Stream<T2>>Stream. unzip(java.util.function.Function<? super T,Tuple2<? extends T1,? extends T2>> unzipper)<T1,T2>
Tuple2<? extends Traversable<T1>,? extends Traversable<T2>>Traversable. unzip(java.util.function.Function<? super T,Tuple2<? extends T1,? extends T2>> unzipper)Unzips this elements by mapping this elements to pairs which are subsequently split into two distinct sets.default <T1,T2>
Tuple2<Tree<T1>,Tree<T2>>Tree. unzip(java.util.function.Function<? super T,Tuple2<? extends T1,? extends T2>> unzipper)static <T,T1,T2>
Tuple2<Tree.Node<T1>,Tree.Node<T2>>TreeModule. unzip(Tree.Node<T> node, java.util.function.Function<? super T,Tuple2<? extends T1,? extends T2>> unzipper)<T1,T2>
Tuple2<TreeSet<T1>,TreeSet<T2>>TreeSet. unzip(java.util.function.Function<? super T,Tuple2<? extends T1,? extends T2>> unzipper)<T1,T2>
Tuple2<Vector<T1>,Vector<T2>>Vector. unzip(java.util.function.Function<? super T,Tuple2<? extends T1,? extends T2>> unzipper)Methods in io.vavr.collection that return types with arguments of type Tuple2 Modifier and Type Method Description static <K,V>
java.util.stream.Collector<Tuple2<K,V>,java.util.ArrayList<Tuple2<K,V>>,HashMap<K,V>>HashMap. collector()Returns aCollectorwhich may be used in conjunction withStream.collect(java.util.stream.Collector)to obtain aHashMap.static <K,V>
java.util.stream.Collector<Tuple2<K,V>,java.util.ArrayList<Tuple2<K,V>>,HashMap<K,V>>HashMap. collector()Returns aCollectorwhich may be used in conjunction withStream.collect(java.util.stream.Collector)to obtain aHashMap.<K,V2 extends V>
java.util.stream.Collector<Tuple2<K,V2>,java.util.ArrayList<Tuple2<K,V2>>,Multimap<K,V2>>HashMultimap.Builder. collector()Returns aCollectorwhich may be used in conjunction withStream.collect(Collector)to obtain aHashMultimap.<K,V2 extends V>
java.util.stream.Collector<Tuple2<K,V2>,java.util.ArrayList<Tuple2<K,V2>>,Multimap<K,V2>>HashMultimap.Builder. collector()Returns aCollectorwhich may be used in conjunction withStream.collect(Collector)to obtain aHashMultimap.static <K,V>
java.util.stream.Collector<Tuple2<K,V>,java.util.ArrayList<Tuple2<K,V>>,LinkedHashMap<K,V>>LinkedHashMap. collector()Returns aCollectorwhich may be used in conjunction withStream.collect(java.util.stream.Collector)to obtain aLinkedHashMap.static <K,V>
java.util.stream.Collector<Tuple2<K,V>,java.util.ArrayList<Tuple2<K,V>>,LinkedHashMap<K,V>>LinkedHashMap. collector()Returns aCollectorwhich may be used in conjunction withStream.collect(java.util.stream.Collector)to obtain aLinkedHashMap.<K,V2 extends V>
java.util.stream.Collector<Tuple2<K,V2>,java.util.ArrayList<Tuple2<K,V2>>,Multimap<K,V2>>LinkedHashMultimap.Builder. collector()Returns aCollectorwhich may be used in conjunction withStream.collect(Collector)to obtain aLinkedHashMultimap.<K,V2 extends V>
java.util.stream.Collector<Tuple2<K,V2>,java.util.ArrayList<Tuple2<K,V2>>,Multimap<K,V2>>LinkedHashMultimap.Builder. collector()Returns aCollectorwhich may be used in conjunction withStream.collect(Collector)to obtain aLinkedHashMultimap.static <K extends java.lang.Comparable<? super K>,V>
java.util.stream.Collector<Tuple2<K,V>,java.util.ArrayList<Tuple2<K,V>>,TreeMap<K,V>>TreeMap. collector()Returns aCollectorwhich may be used in conjunction withStream.collect(Collector)to obtain aTreeMap.static <K extends java.lang.Comparable<? super K>,V>
java.util.stream.Collector<Tuple2<K,V>,java.util.ArrayList<Tuple2<K,V>>,TreeMap<K,V>>TreeMap. collector()Returns aCollectorwhich may be used in conjunction withStream.collect(Collector)to obtain aTreeMap.static <K,V>
java.util.stream.Collector<Tuple2<K,V>,java.util.ArrayList<Tuple2<K,V>>,TreeMap<K,V>>TreeMap. collector(java.util.Comparator<? super K> keyComparator)Returns aCollectorwhich may be used in conjunction withStream.collect(Collector)to obtain aTreeMap.static <K,V>
java.util.stream.Collector<Tuple2<K,V>,java.util.ArrayList<Tuple2<K,V>>,TreeMap<K,V>>TreeMap. collector(java.util.Comparator<? super K> keyComparator)Returns aCollectorwhich may be used in conjunction withStream.collect(Collector)to obtain aTreeMap.<K extends java.lang.Comparable<? super K>,V2 extends V>
java.util.stream.Collector<Tuple2<K,V2>,java.util.ArrayList<Tuple2<K,V2>>,TreeMultimap<K,V2>>TreeMultimap.Builder. collector()Returns aCollectorwhich may be used in conjunction withStream.collect(Collector)to obtain aTreeMultimap.<K extends java.lang.Comparable<? super K>,V2 extends V>
java.util.stream.Collector<Tuple2<K,V2>,java.util.ArrayList<Tuple2<K,V2>>,TreeMultimap<K,V2>>TreeMultimap.Builder. collector()Returns aCollectorwhich may be used in conjunction withStream.collect(Collector)to obtain aTreeMultimap.<K,V2 extends V>
java.util.stream.Collector<Tuple2<K,V2>,java.util.ArrayList<Tuple2<K,V2>>,TreeMultimap<K,V2>>TreeMultimap.Builder. collector(java.util.Comparator<? super K> keyComparator)Returns aCollectorwhich may be used in conjunction withStream.collect(Collector)to obtain aTreeMultimap.<K,V2 extends V>
java.util.stream.Collector<Tuple2<K,V2>,java.util.ArrayList<Tuple2<K,V2>>,TreeMultimap<K,V2>>TreeMultimap.Builder. collector(java.util.Comparator<? super K> keyComparator)Returns aCollectorwhich may be used in conjunction withStream.collect(Collector)to obtain aTreeMultimap.private static <K,V>
java.util.stream.Collector<Tuple2<K,V>,java.util.ArrayList<Tuple2<K,V>>,TreeMap<K,V>>TreeMap. createCollector(TreeMap.EntryComparator<K,V> entryComparator)private static <K,V>
java.util.stream.Collector<Tuple2<K,V>,java.util.ArrayList<Tuple2<K,V>>,TreeMap<K,V>>TreeMap. createCollector(TreeMap.EntryComparator<K,V> entryComparator)default Iterator<Tuple2<T,T>>Seq. crossProduct()Calculates the cross product (, i.e.default <U> Iterator<Tuple2<T,U>>Seq. crossProduct(java.lang.Iterable<? extends U> that)Calculates the cross productthis x that.Option<Tuple2<T,Q>>AbstractQueue. dequeueOption()Removes an element from this Queue.Iterator<Tuple2<K,V>>AbstractMultimap. iterator()Iterator<Tuple2<K,V>>HashArrayMappedTrie. iterator()Iterator<Tuple2<K,V>>HashArrayMappedTrieModule.AbstractNode. iterator()Iterator<Tuple2<K,V>>HashMap. iterator()Iterator<Tuple2<K,V>>LinkedHashMap. iterator()Iterator<Tuple2<K,V>>Map. iterator()Iterator<Tuple2<K,V>>Multimap. iterator()Iterator<Tuple2<K,V>>TreeMap. iterator()default Option<Tuple2<T,List<T>>>List. pop2Option()Removes the head element from this List.<U> Array<Tuple2<T,U>>Array. zip(java.lang.Iterable<? extends U> that)default <U> TreeSet<Tuple2<T,U>>BitSet. zip(java.lang.Iterable<? extends U> that)<U> IndexedSeq<Tuple2<java.lang.Character,U>>CharSeq. zip(java.lang.Iterable<? extends U> that)<U> HashSet<Tuple2<T,U>>HashSet. zip(java.lang.Iterable<? extends U> that)<U> IndexedSeq<Tuple2<T,U>>IndexedSeq. zip(java.lang.Iterable<? extends U> that)default <U> Iterator<Tuple2<T,U>>Iterator. zip(java.lang.Iterable<? extends U> that)<U> LinearSeq<Tuple2<T,U>>LinearSeq. zip(java.lang.Iterable<? extends U> that)<U> LinkedHashSet<Tuple2<T,U>>LinkedHashSet. zip(java.lang.Iterable<? extends U> that)default <U> List<Tuple2<T,U>>List. zip(java.lang.Iterable<? extends U> that)default <U> Seq<Tuple2<Tuple2<K,V>,U>>Map. zip(java.lang.Iterable<? extends U> that)default <U> Seq<Tuple2<Tuple2<K,V>,U>>Map. zip(java.lang.Iterable<? extends U> that)default <U> Seq<Tuple2<Tuple2<K,V>,U>>Multimap. zip(java.lang.Iterable<? extends U> that)default <U> Seq<Tuple2<Tuple2<K,V>,U>>Multimap. zip(java.lang.Iterable<? extends U> that)<U> PriorityQueue<Tuple2<T,U>>PriorityQueue. zip(java.lang.Iterable<? extends U> that)<U> Queue<Tuple2<T,U>>Queue. zip(java.lang.Iterable<? extends U> that)<U> Seq<Tuple2<T,U>>Seq. zip(java.lang.Iterable<? extends U> that)<U> Set<Tuple2<T,U>>Set. zip(java.lang.Iterable<? extends U> that)<U> SortedSet<Tuple2<T,U>>SortedSet. zip(java.lang.Iterable<? extends U> that)default <U> Stream<Tuple2<T,U>>Stream. zip(java.lang.Iterable<? extends U> that)<U> Traversable<Tuple2<T,U>>Traversable. zip(java.lang.Iterable<? extends U> that)Returns a traversable formed from this traversable and another Iterable collection by combining corresponding elements in pairs.default <U> Tree<Tuple2<T,U>>Tree. zip(java.lang.Iterable<? extends U> that)<U> TreeSet<Tuple2<T,U>>TreeSet. zip(java.lang.Iterable<? extends U> that)<U> Vector<Tuple2<T,U>>Vector. zip(java.lang.Iterable<? extends U> that)<U> Array<Tuple2<T,U>>Array. zipAll(java.lang.Iterable<? extends U> that, T thisElem, U thatElem)default <U> TreeSet<Tuple2<T,U>>BitSet. zipAll(java.lang.Iterable<? extends U> that, T thisElem, U thatElem)<U> IndexedSeq<Tuple2<java.lang.Character,U>>CharSeq. zipAll(java.lang.Iterable<? extends U> that, java.lang.Character thisElem, U thatElem)<U> HashSet<Tuple2<T,U>>HashSet. zipAll(java.lang.Iterable<? extends U> that, T thisElem, U thatElem)<U> IndexedSeq<Tuple2<T,U>>IndexedSeq. zipAll(java.lang.Iterable<? extends U> that, T thisElem, U thatElem)default <U> Iterator<Tuple2<T,U>>Iterator. zipAll(java.lang.Iterable<? extends U> that, T thisElem, U thatElem)<U> LinearSeq<Tuple2<T,U>>LinearSeq. zipAll(java.lang.Iterable<? extends U> that, T thisElem, U thatElem)<U> LinkedHashSet<Tuple2<T,U>>LinkedHashSet. zipAll(java.lang.Iterable<? extends U> that, T thisElem, U thatElem)default <U> List<Tuple2<T,U>>List. zipAll(java.lang.Iterable<? extends U> that, T thisElem, U thatElem)default <U> Seq<Tuple2<Tuple2<K,V>,U>>Map. zipAll(java.lang.Iterable<? extends U> that, Tuple2<K,V> thisElem, U thatElem)default <U> Seq<Tuple2<Tuple2<K,V>,U>>Map. zipAll(java.lang.Iterable<? extends U> that, Tuple2<K,V> thisElem, U thatElem)default <U> Seq<Tuple2<Tuple2<K,V>,U>>Multimap. zipAll(java.lang.Iterable<? extends U> that, Tuple2<K,V> thisElem, U thatElem)default <U> Seq<Tuple2<Tuple2<K,V>,U>>Multimap. zipAll(java.lang.Iterable<? extends U> that, Tuple2<K,V> thisElem, U thatElem)<U> PriorityQueue<Tuple2<T,U>>PriorityQueue. zipAll(java.lang.Iterable<? extends U> that, T thisElem, U thatElem)<U> Queue<Tuple2<T,U>>Queue. zipAll(java.lang.Iterable<? extends U> that, T thisElem, U thatElem)<U> Seq<Tuple2<T,U>>Seq. zipAll(java.lang.Iterable<? extends U> that, T thisElem, U thatElem)<U> Set<Tuple2<T,U>>Set. zipAll(java.lang.Iterable<? extends U> that, T thisElem, U thatElem)<U> SortedSet<Tuple2<T,U>>SortedSet. zipAll(java.lang.Iterable<? extends U> that, T thisElem, U thatElem)default <U> Stream<Tuple2<T,U>>Stream. zipAll(java.lang.Iterable<? extends U> iterable, T thisElem, U thatElem)<U> Traversable<Tuple2<T,U>>Traversable. zipAll(java.lang.Iterable<? extends U> that, T thisElem, U thatElem)Returns a traversable formed from this traversable and another Iterable by combining corresponding elements in pairs.default <U> Tree<Tuple2<T,U>>Tree. zipAll(java.lang.Iterable<? extends U> that, T thisElem, U thatElem)static <T,U>
Tree<Tuple2<T,U>>TreeModule. zipAll(Tree.Node<T> node, java.util.Iterator<? extends U> that, U thatElem)<U> TreeSet<Tuple2<T,U>>TreeSet. zipAll(java.lang.Iterable<? extends U> that, T thisElem, U thatElem)<U> Vector<Tuple2<T,U>>Vector. zipAll(java.lang.Iterable<? extends U> that, T thisElem, U thatElem)Array<Tuple2<T,java.lang.Integer>>Array. zipWithIndex()default TreeSet<Tuple2<T,java.lang.Integer>>BitSet. zipWithIndex()IndexedSeq<Tuple2<java.lang.Character,java.lang.Integer>>CharSeq. zipWithIndex()HashSet<Tuple2<T,java.lang.Integer>>HashSet. zipWithIndex()IndexedSeq<Tuple2<T,java.lang.Integer>>IndexedSeq. zipWithIndex()default Iterator<Tuple2<T,java.lang.Integer>>Iterator. zipWithIndex()LinearSeq<Tuple2<T,java.lang.Integer>>LinearSeq. zipWithIndex()LinkedHashSet<Tuple2<T,java.lang.Integer>>LinkedHashSet. zipWithIndex()default List<Tuple2<T,java.lang.Integer>>List. zipWithIndex()default Seq<Tuple2<Tuple2<K,V>,java.lang.Integer>>Map. zipWithIndex()default Seq<Tuple2<Tuple2<K,V>,java.lang.Integer>>Map. zipWithIndex()default Seq<Tuple2<Tuple2<K,V>,java.lang.Integer>>Multimap. zipWithIndex()default Seq<Tuple2<Tuple2<K,V>,java.lang.Integer>>Multimap. zipWithIndex()PriorityQueue<Tuple2<T,java.lang.Integer>>PriorityQueue. zipWithIndex()Queue<Tuple2<T,java.lang.Integer>>Queue. zipWithIndex()Seq<Tuple2<T,java.lang.Integer>>Seq. zipWithIndex()Set<Tuple2<T,java.lang.Integer>>Set. zipWithIndex()SortedSet<Tuple2<T,java.lang.Integer>>SortedSet. zipWithIndex()default Stream<Tuple2<T,java.lang.Integer>>Stream. zipWithIndex()Traversable<Tuple2<T,java.lang.Integer>>Traversable. zipWithIndex()Zips this traversable with its indices.default Tree<Tuple2<T,java.lang.Integer>>Tree. zipWithIndex()TreeSet<Tuple2<T,java.lang.Integer>>TreeSet. zipWithIndex()Vector<Tuple2<T,java.lang.Integer>>Vector. zipWithIndex()Methods in io.vavr.collection with parameters of type Tuple2 Modifier and Type Method Description intTreeMap.EntryComparator.Natural. compare(Tuple2<K,V> e1, Tuple2<K,V> e2)intTreeMap.EntryComparator.Specific. compare(Tuple2<K,V> e1, Tuple2<K,V> e2)default booleanMap. contains(Tuple2<K,V> element)default booleanMultimap. contains(Tuple2<K,V> element)private static <K,V>
TreeMap<K,V>TreeMap. createFromTuple(TreeMap.EntryComparator<K,V> entryComparator, Tuple2<? extends K,? extends V> entry)private static <K,V>
TreeMap<K,V>TreeMap. createFromTuples(TreeMap.EntryComparator<K,V> entryComparator, Tuple2<? extends K,? extends V>... entries)<K,V2 extends V>
HashMultimap<K,V2>HashMultimap.Builder. fill(int n, Tuple2<? extends K,? extends V2> element)Returns a HashMultimap containingntimes the givenelement<K,V2 extends V>
LinkedHashMultimap<K,V2>LinkedHashMultimap.Builder. fill(int n, Tuple2<? extends K,? extends V2> element)Returns a LinkedHashMultimap containingntimes the givenelement<K extends java.lang.Comparable<? super K>,V2 extends V>
TreeMultimap<K,V2>TreeMultimap.Builder. fill(int n, Tuple2<? extends K,? extends V2> element)Returns a TreeMultimap containingntimes the givenelementThe underlying key comparator is the natural comparator of K.<K,V2 extends V>
TreeMultimap<K,V2>TreeMultimap.Builder. fill(java.util.Comparator<? super K> keyComparator, int n, Tuple2<? extends K,? extends V2> element)Returns a TreeMultimap containingntimes the givenelementstatic <K,V>
HashMap<K,V>HashMap. of(Tuple2<? extends K,? extends V> entry)Returns a singletonHashMap, i.e.<K,V2 extends V>
HashMultimap<K,V2>HashMultimap.Builder. of(Tuple2<? extends K,? extends V2> entry)Creates a HashMultimap of the given key-value pair.static <K,V>
LinkedHashMap<K,V>LinkedHashMap. of(Tuple2<? extends K,? extends V> entry)Returns a singletonLinkedHashMap, i.e.<K,V2 extends V>
LinkedHashMultimap<K,V2>LinkedHashMultimap.Builder. of(Tuple2<? extends K,? extends V2> entry)Creates a LinkedHashMultimap of the given key-value pair.static <K extends java.lang.Comparable<? super K>,V>
TreeMap<K,V>TreeMap. of(Tuple2<? extends K,? extends V> entry)Returns a singletonTreeMap, i.e.static <K,V>
TreeMap<K,V>TreeMap. of(java.util.Comparator<? super K> keyComparator, Tuple2<? extends K,? extends V> entry)Returns a singletonTreeMap, i.e.<K extends java.lang.Comparable<? super K>,V2 extends V>
TreeMultimap<K,V2>TreeMultimap.Builder. of(Tuple2<? extends K,? extends V2> entry)Creates a TreeMultimap of the given list of key-value pairs.<K,V2 extends V>
TreeMultimap<K,V2>TreeMultimap.Builder. of(java.util.Comparator<? super K> keyComparator, Tuple2<? extends K,? extends V2> entry)Returns a singletonTreeMultimap, i.e.static <K,V>
HashMap<K,V>HashMap. ofEntries(Tuple2<? extends K,? extends V>... entries)Creates a HashMap of the given entries.<K,V2 extends V>
HashMultimap<K,V2>HashMultimap.Builder. ofEntries(Tuple2<? extends K,? extends V2>... entries)Creates aHashMultimapof the given entries.static <K,V>
LinkedHashMap<K,V>LinkedHashMap. ofEntries(Tuple2<? extends K,? extends V>... entries)Creates a LinkedHashMap of the given entries.<K,V2 extends V>
LinkedHashMultimap<K,V2>LinkedHashMultimap.Builder. ofEntries(Tuple2<? extends K,? extends V2>... entries)Creates aLinkedHashMultimapof the given entries.static <K extends java.lang.Comparable<? super K>,V>
TreeMap<K,V>TreeMap. ofEntries(Tuple2<? extends K,? extends V>... entries)Creates aTreeMapof the given entries using the natural key comparator.static <K,V>
TreeMap<K,V>TreeMap. ofEntries(java.util.Comparator<? super K> keyComparator, Tuple2<? extends K,? extends V>... entries)Creates aTreeMapof the given entries using the given key comparator.<K extends java.lang.Comparable<? super K>,V2 extends V>
TreeMultimap<K,V2>TreeMultimap.Builder. ofEntries(Tuple2<? extends K,? extends V2>... entries)Creates aTreeMultimapof the given entries.<K,V2 extends V>
TreeMultimap<K,V2>TreeMultimap.Builder. ofEntries(java.util.Comparator<? super K> keyComparator, Tuple2<? extends K,? extends V2>... entries)Creates aTreeMultimapof the given entries.MAbstractMultimap. put(Tuple2<? extends K,? extends V> entry)HashMap<K,V>HashMap. put(Tuple2<? extends K,? extends V> entry)<U extends V>
HashMap<K,V>HashMap. put(Tuple2<? extends K,U> entry, java.util.function.BiFunction<? super V,? super U,? extends V> merge)LinkedHashMap<K,V>LinkedHashMap. put(Tuple2<? extends K,? extends V> entry)<U extends V>
LinkedHashMap<K,V>LinkedHashMap. put(Tuple2<? extends K,U> entry, java.util.function.BiFunction<? super V,? super U,? extends V> merge)Map<K,V>Map. put(Tuple2<? extends K,? extends V> entry)Convenience method forput(entry._1, entry._2).<U extends V>
Map<K,V>Map. put(Tuple2<? extends K,U> entry, java.util.function.BiFunction<? super V,? super U,? extends V> merge)Convenience method forput(entry._1, entry._2, merge).(package private) static <K,V,M extends Map<K,V>>
MMaps. put(M map, Tuple2<? extends K,? extends V> entry)(package private) static <K,V,U extends V,M extends Map<K,V>>
MMaps. put(M map, Tuple2<? extends K,U> entry, java.util.function.BiFunction<? super V,? super U,? extends V> merge)Multimap<K,V>Multimap. put(Tuple2<? extends K,? extends V> entry)Convenience method forput(entry._1, entry._2).SortedMap<K,V>SortedMap. put(Tuple2<? extends K,? extends V> entry)<U extends V>
SortedMap<K,V>SortedMap. put(Tuple2<? extends K,U> entry, java.util.function.BiFunction<? super V,? super U,? extends V> merge)SortedMultimap<K,V>SortedMultimap. put(Tuple2<? extends K,? extends V> entry)TreeMap<K,V>TreeMap. put(Tuple2<? extends K,? extends V> entry)<U extends V>
TreeMap<K,V>TreeMap. put(Tuple2<? extends K,U> entry, java.util.function.BiFunction<? super V,? super U,? extends V> merge)MAbstractMultimap. replace(Tuple2<K,V> currentElement, Tuple2<K,V> newElement)HashMap<K,V>HashMap. replace(Tuple2<K,V> currentElement, Tuple2<K,V> newElement)LinkedHashMap<K,V>LinkedHashMap. replace(Tuple2<K,V> currentElement, Tuple2<K,V> newElement)Map<K,V>Map. replace(Tuple2<K,V> currentElement, Tuple2<K,V> newElement)(package private) static <K,V,M extends Map<K,V>>
MMaps. replace(M map, Tuple2<K,V> currentElement, Tuple2<K,V> newElement)Multimap<K,V>Multimap. replace(Tuple2<K,V> currentElement, Tuple2<K,V> newElement)SortedMap<K,V>SortedMap. replace(Tuple2<K,V> currentElement, Tuple2<K,V> newElement)SortedMultimap<K,V>SortedMultimap. replace(Tuple2<K,V> currentElement, Tuple2<K,V> newElement)TreeMap<K,V>TreeMap. replace(Tuple2<K,V> currentElement, Tuple2<K,V> newElement)MAbstractMultimap. replaceAll(Tuple2<K,V> currentElement, Tuple2<K,V> newElement)HashMap<K,V>HashMap. replaceAll(Tuple2<K,V> currentElement, Tuple2<K,V> newElement)LinkedHashMap<K,V>LinkedHashMap. replaceAll(Tuple2<K,V> currentElement, Tuple2<K,V> newElement)Map<K,V>Map. replaceAll(Tuple2<K,V> currentElement, Tuple2<K,V> newElement)(package private) static <K,V,M extends Map<K,V>>
MMaps. replaceAll(M map, Tuple2<K,V> currentElement, Tuple2<K,V> newElement)Multimap<K,V>Multimap. replaceAll(Tuple2<K,V> currentElement, Tuple2<K,V> newElement)SortedMap<K,V>SortedMap. replaceAll(Tuple2<K,V> currentElement, Tuple2<K,V> newElement)SortedMultimap<K,V>SortedMultimap. replaceAll(Tuple2<K,V> currentElement, Tuple2<K,V> newElement)TreeMap<K,V>TreeMap. replaceAll(Tuple2<K,V> currentElement, Tuple2<K,V> newElement)MAbstractMultimap. scan(Tuple2<K,V> zero, java.util.function.BiFunction<? super Tuple2<K,V>,? super Tuple2<K,V>,? extends Tuple2<K,V>> operation)HashMap<K,V>HashMap. scan(Tuple2<K,V> zero, java.util.function.BiFunction<? super Tuple2<K,V>,? super Tuple2<K,V>,? extends Tuple2<K,V>> operation)LinkedHashMap<K,V>LinkedHashMap. scan(Tuple2<K,V> zero, java.util.function.BiFunction<? super Tuple2<K,V>,? super Tuple2<K,V>,? extends Tuple2<K,V>> operation)Map<K,V>Map. scan(Tuple2<K,V> zero, java.util.function.BiFunction<? super Tuple2<K,V>,? super Tuple2<K,V>,? extends Tuple2<K,V>> operation)(package private) static <K,V,M extends Map<K,V>>
MMaps. scan(M map, Tuple2<K,V> zero, java.util.function.BiFunction<? super Tuple2<K,V>,? super Tuple2<K,V>,? extends Tuple2<K,V>> operation, java.util.function.Function<Iterator<Tuple2<K,V>>,Traversable<Tuple2<K,V>>> finisher)Multimap<K,V>Multimap. scan(Tuple2<K,V> zero, java.util.function.BiFunction<? super Tuple2<K,V>,? super Tuple2<K,V>,? extends Tuple2<K,V>> operation)SortedMap<K,V>SortedMap. scan(Tuple2<K,V> zero, java.util.function.BiFunction<? super Tuple2<K,V>,? super Tuple2<K,V>,? extends Tuple2<K,V>> operation)SortedMultimap<K,V>SortedMultimap. scan(Tuple2<K,V> zero, java.util.function.BiFunction<? super Tuple2<K,V>,? super Tuple2<K,V>,? extends Tuple2<K,V>> operation)TreeMap<K,V>TreeMap. scan(Tuple2<K,V> zero, java.util.function.BiFunction<? super Tuple2<K,V>,? super Tuple2<K,V>,? extends Tuple2<K,V>> operation)default <U> Seq<Tuple2<Tuple2<K,V>,U>>Map. zipAll(java.lang.Iterable<? extends U> that, Tuple2<K,V> thisElem, U thatElem)default <U> Seq<Tuple2<Tuple2<K,V>,U>>Multimap. zipAll(java.lang.Iterable<? extends U> that, Tuple2<K,V> thisElem, U thatElem)Method parameters in io.vavr.collection with type arguments of type Tuple2 Modifier and Type Method Description default <R> Seq<R>Map. collect(PartialFunction<? super Tuple2<K,V>,? extends R> partialFunction)default <R> Seq<R>Multimap. collect(PartialFunction<? super Tuple2<K,V>,? extends R> partialFunction)private <K2,V2>
Multimap<K2,V2>AbstractMultimap. createFromEntries(java.lang.Iterable<? extends Tuple2<? extends K2,? extends V2>> entries)private HashMap<K,V>HashMap. createFromEntries(java.lang.Iterable<Tuple2<K,V>> tuples)private LinkedHashMap<K,V>LinkedHashMap. createFromEntries(java.lang.Iterable<Tuple2<K,V>> tuples)private TreeMap<K,V>TreeMap. createFromEntries(java.lang.Iterable<Tuple2<K,V>> tuples)private static <K,V>
TreeMap<K,V>TreeMap. createTreeMap(TreeMap.EntryComparator<K,V> entryComparator, java.lang.Iterable<? extends Tuple2<? extends K,? extends V>> entries)private static <K,K2,V,V2>
TreeMap<K2,V2>TreeMap. createTreeMap(TreeMap.EntryComparator<K2,V2> entryComparator, java.lang.Iterable<Tuple2<K,V>> entries, java.util.function.Function<Tuple2<K,V>,Tuple2<K2,V2>> entryMapper)private static <K,K2,V,V2>
TreeMap<K2,V2>TreeMap. createTreeMap(TreeMap.EntryComparator<K2,V2> entryComparator, java.lang.Iterable<Tuple2<K,V>> entries, java.util.function.Function<Tuple2<K,V>,Tuple2<K2,V2>> entryMapper)private static <K,K2,V,V2>
TreeMap<K2,V2>TreeMap. createTreeMap(TreeMap.EntryComparator<K2,V2> entryComparator, java.lang.Iterable<Tuple2<K,V>> entries, java.util.function.Function<Tuple2<K,V>,Tuple2<K2,V2>> entryMapper)MAbstractMultimap. distinctBy(java.util.Comparator<? super Tuple2<K,V>> comparator)<U> MAbstractMultimap. distinctBy(java.util.function.Function<? super Tuple2<K,V>,? extends U> keyExtractor)HashMap<K,V>HashMap. distinctBy(java.util.Comparator<? super Tuple2<K,V>> comparator)<U> HashMap<K,V>HashMap. distinctBy(java.util.function.Function<? super Tuple2<K,V>,? extends U> keyExtractor)LinkedHashMap<K,V>LinkedHashMap. distinctBy(java.util.Comparator<? super Tuple2<K,V>> comparator)<U> LinkedHashMap<K,V>LinkedHashMap. distinctBy(java.util.function.Function<? super Tuple2<K,V>,? extends U> keyExtractor)Map<K,V>Map. distinctBy(java.util.Comparator<? super Tuple2<K,V>> comparator)<U> Map<K,V>Map. distinctBy(java.util.function.Function<? super Tuple2<K,V>,? extends U> keyExtractor)(package private) static <K,V,M extends Map<K,V>>
MMaps. distinctBy(M map, Maps.OfEntries<K,V,M> ofEntries, java.util.Comparator<? super Tuple2<K,V>> comparator)(package private) static <K,V,U,M extends Map<K,V>>
MMaps. distinctBy(M map, Maps.OfEntries<K,V,M> ofEntries, java.util.function.Function<? super Tuple2<K,V>,? extends U> keyExtractor)Multimap<K,V>Multimap. distinctBy(java.util.Comparator<? super Tuple2<K,V>> comparator)<U> Multimap<K,V>Multimap. distinctBy(java.util.function.Function<? super Tuple2<K,V>,? extends U> keyExtractor)SortedMap<K,V>SortedMap. distinctBy(java.util.Comparator<? super Tuple2<K,V>> comparator)<U> SortedMap<K,V>SortedMap. distinctBy(java.util.function.Function<? super Tuple2<K,V>,? extends U> keyExtractor)SortedMultimap<K,V>SortedMultimap. distinctBy(java.util.Comparator<? super Tuple2<K,V>> comparator)<U> SortedMultimap<K,V>SortedMultimap. distinctBy(java.util.function.Function<? super Tuple2<K,V>,? extends U> keyExtractor)TreeMap<K,V>TreeMap. distinctBy(java.util.Comparator<? super Tuple2<K,V>> comparator)<U> TreeMap<K,V>TreeMap. distinctBy(java.util.function.Function<? super Tuple2<K,V>,? extends U> keyExtractor)MAbstractMultimap. dropUntil(java.util.function.Predicate<? super Tuple2<K,V>> predicate)HashMap<K,V>HashMap. dropUntil(java.util.function.Predicate<? super Tuple2<K,V>> predicate)LinkedHashMap<K,V>LinkedHashMap. dropUntil(java.util.function.Predicate<? super Tuple2<K,V>> predicate)Map<K,V>Map. dropUntil(java.util.function.Predicate<? super Tuple2<K,V>> predicate)(package private) static <K,V,M extends Map<K,V>>
MMaps. dropUntil(M map, Maps.OfEntries<K,V,M> ofEntries, java.util.function.Predicate<? super Tuple2<K,V>> predicate)Multimap<K,V>Multimap. dropUntil(java.util.function.Predicate<? super Tuple2<K,V>> predicate)SortedMap<K,V>SortedMap. dropUntil(java.util.function.Predicate<? super Tuple2<K,V>> predicate)SortedMultimap<K,V>SortedMultimap. dropUntil(java.util.function.Predicate<? super Tuple2<K,V>> predicate)TreeMap<K,V>TreeMap. dropUntil(java.util.function.Predicate<? super Tuple2<K,V>> predicate)MAbstractMultimap. dropWhile(java.util.function.Predicate<? super Tuple2<K,V>> predicate)HashMap<K,V>HashMap. dropWhile(java.util.function.Predicate<? super Tuple2<K,V>> predicate)LinkedHashMap<K,V>LinkedHashMap. dropWhile(java.util.function.Predicate<? super Tuple2<K,V>> predicate)Map<K,V>Map. dropWhile(java.util.function.Predicate<? super Tuple2<K,V>> predicate)(package private) static <K,V,M extends Map<K,V>>
MMaps. dropWhile(M map, Maps.OfEntries<K,V,M> ofEntries, java.util.function.Predicate<? super Tuple2<K,V>> predicate)Multimap<K,V>Multimap. dropWhile(java.util.function.Predicate<? super Tuple2<K,V>> predicate)SortedMap<K,V>SortedMap. dropWhile(java.util.function.Predicate<? super Tuple2<K,V>> predicate)SortedMultimap<K,V>SortedMultimap. dropWhile(java.util.function.Predicate<? super Tuple2<K,V>> predicate)TreeMap<K,V>TreeMap. dropWhile(java.util.function.Predicate<? super Tuple2<K,V>> predicate)static <K,V>
HashMap<K,V>HashMap. fill(int n, java.util.function.Supplier<? extends Tuple2<? extends K,? extends V>> s)Returns a HashMap containing tuples returned byncalls to a given Suppliers.<K,V2 extends V>
HashMultimap<K,V2>HashMultimap.Builder. fill(int n, java.util.function.Supplier<? extends Tuple2<? extends K,? extends V2>> s)Returns a HashMultimap containingnvalues supplied by a given Suppliers.static <K,V>
LinkedHashMap<K,V>LinkedHashMap. fill(int n, java.util.function.Supplier<? extends Tuple2<? extends K,? extends V>> s)Returns a LinkedHashMap containing tuples returned byncalls to a given Suppliers.<K,V2 extends V>
LinkedHashMultimap<K,V2>LinkedHashMultimap.Builder. fill(int n, java.util.function.Supplier<? extends Tuple2<? extends K,? extends V2>> s)Returns a LinkedHashMultimap containingnvalues supplied by a given Suppliers.static <K extends java.lang.Comparable<? super K>,V>
TreeMap<K,V>TreeMap. fill(int n, java.util.function.Supplier<? extends Tuple2<? extends K,? extends V>> s)Returns a TreeMap containing tuples returned byncalls to a given Suppliers.static <K,V>
TreeMap<K,V>TreeMap. fill(java.util.Comparator<? super K> keyComparator, int n, java.util.function.Supplier<? extends Tuple2<? extends K,? extends V>> s)Returns a TreeMap containing tuples returned byncalls to a given Suppliers.<K extends java.lang.Comparable<? super K>,V2 extends V>
TreeMultimap<K,V2>TreeMultimap.Builder. fill(int n, java.util.function.Supplier<? extends Tuple2<? extends K,? extends V2>> s)Returns a TreeMultimap containingnvalues supplied by a given Suppliers.<K,V2 extends V>
TreeMultimap<K,V2>TreeMultimap.Builder. fill(java.util.Comparator<? super K> keyComparator, int n, java.util.function.Supplier<? extends Tuple2<? extends K,? extends V2>> s)Returns a TreeMultimap containingnvalues supplied by a given Suppliers.MAbstractMultimap. filter(java.util.function.Predicate<? super Tuple2<K,V>> predicate)HashMap<K,V>HashMap. filter(java.util.function.Predicate<? super Tuple2<K,V>> predicate)LinkedHashMap<K,V>LinkedHashMap. filter(java.util.function.Predicate<? super Tuple2<K,V>> predicate)Map<K,V>Map. filter(java.util.function.Predicate<? super Tuple2<K,V>> predicate)(package private) static <K,V,M extends Map<K,V>>
MMaps. filter(M map, Maps.OfEntries<K,V,M> ofEntries, java.util.function.Predicate<? super Tuple2<K,V>> predicate)Multimap<K,V>Multimap. filter(java.util.function.Predicate<? super Tuple2<K,V>> predicate)SortedMap<K,V>SortedMap. filter(java.util.function.Predicate<? super Tuple2<K,V>> predicate)SortedMultimap<K,V>SortedMultimap. filter(java.util.function.Predicate<? super Tuple2<K,V>> predicate)TreeMap<K,V>TreeMap. filter(java.util.function.Predicate<? super Tuple2<K,V>> predicate)<K2,V2>
Multimap<K2,V2>AbstractMultimap. flatMap(java.util.function.BiFunction<? super K,? super V,? extends java.lang.Iterable<Tuple2<K2,V2>>> mapper)<K2,V2>
HashMap<K2,V2>HashMap. flatMap(java.util.function.BiFunction<? super K,? super V,? extends java.lang.Iterable<Tuple2<K2,V2>>> mapper)<K2,V2>
LinkedHashMap<K2,V2>LinkedHashMap. flatMap(java.util.function.BiFunction<? super K,? super V,? extends java.lang.Iterable<Tuple2<K2,V2>>> mapper)<K2,V2>
Map<K2,V2>Map. flatMap(java.util.function.BiFunction<? super K,? super V,? extends java.lang.Iterable<Tuple2<K2,V2>>> mapper)FlatMaps thisMapto a newMapwith different component type.default <U> Seq<U>Map. flatMap(java.util.function.Function<? super Tuple2<K,V>,? extends java.lang.Iterable<? extends U>> mapper)Flat-maps this entries to a sequence of values.<K2,V2>
Multimap<K2,V2>Multimap. flatMap(java.util.function.BiFunction<? super K,? super V,? extends java.lang.Iterable<Tuple2<K2,V2>>> mapper)FlatMaps thisMultimapto a newMultimapwith different component type.default <U> Seq<U>Multimap. flatMap(java.util.function.Function<? super Tuple2<K,V>,? extends java.lang.Iterable<? extends U>> mapper)Flat-maps this entries to a sequence of values.<K2,V2>
SortedMap<K2,V2>SortedMap. flatMap(java.util.Comparator<? super K2> keyComparator, java.util.function.BiFunction<? super K,? super V,? extends java.lang.Iterable<Tuple2<K2,V2>>> mapper)Same asSortedMap.flatMap(BiFunction)but using a specific comparator for values of the codomain of the givenmapper.<K2,V2>
SortedMap<K2,V2>SortedMap. flatMap(java.util.function.BiFunction<? super K,? super V,? extends java.lang.Iterable<Tuple2<K2,V2>>> mapper)private static <K,V,K2,V2>
TreeMap<K2,V2>TreeMap. flatMap(TreeMap<K,V> map, TreeMap.EntryComparator<K2,V2> entryComparator, java.util.function.BiFunction<? super K,? super V,? extends java.lang.Iterable<Tuple2<K2,V2>>> mapper)<K2,V2>
TreeMap<K2,V2>TreeMap. flatMap(java.util.Comparator<? super K2> keyComparator, java.util.function.BiFunction<? super K,? super V,? extends java.lang.Iterable<Tuple2<K2,V2>>> mapper)<K2,V2>
TreeMap<K2,V2>TreeMap. flatMap(java.util.function.BiFunction<? super K,? super V,? extends java.lang.Iterable<Tuple2<K2,V2>>> mapper)default <U> UMap. foldRight(U zero, java.util.function.BiFunction<? super Tuple2<K,V>,? super U,? extends U> f)default <U> UMultimap. foldRight(U zero, java.util.function.BiFunction<? super Tuple2<K,V>,? super U,? extends U> f)<C> Map<C,M>AbstractMultimap. groupBy(java.util.function.Function<? super Tuple2<K,V>,? extends C> classifier)<C> Map<C,HashMap<K,V>>HashMap. groupBy(java.util.function.Function<? super Tuple2<K,V>,? extends C> classifier)<C> Map<C,LinkedHashMap<K,V>>LinkedHashMap. groupBy(java.util.function.Function<? super Tuple2<K,V>,? extends C> classifier)<C> Map<C,? extends Map<K,V>>Map. groupBy(java.util.function.Function<? super Tuple2<K,V>,? extends C> classifier)(package private) static <K,V,C,M extends Map<K,V>>
Map<C,M>Maps. groupBy(M map, Maps.OfEntries<K,V,M> ofEntries, java.util.function.Function<? super Tuple2<K,V>,? extends C> classifier)<C> Map<C,? extends Multimap<K,V>>Multimap. groupBy(java.util.function.Function<? super Tuple2<K,V>,? extends C> classifier)<C> Map<C,? extends SortedMap<K,V>>SortedMap. groupBy(java.util.function.Function<? super Tuple2<K,V>,? extends C> classifier)<C> Map<C,? extends SortedMultimap<K,V>>SortedMultimap. groupBy(java.util.function.Function<? super Tuple2<K,V>,? extends C> classifier)<C> Map<C,TreeMap<K,V>>TreeMap. groupBy(java.util.function.Function<? super Tuple2<K,V>,? extends C> classifier)<K2,V2>
Multimap<K2,V2>AbstractMultimap. map(java.util.function.BiFunction<? super K,? super V,Tuple2<K2,V2>> mapper)<K2,V2>
HashMap<K2,V2>HashMap. map(java.util.function.BiFunction<? super K,? super V,Tuple2<K2,V2>> mapper)<K2,V2>
LinkedHashMap<K2,V2>LinkedHashMap. map(java.util.function.BiFunction<? super K,? super V,Tuple2<K2,V2>> mapper)<K2,V2>
Map<K2,V2>Map. map(java.util.function.BiFunction<? super K,? super V,Tuple2<K2,V2>> mapper)Maps the entries of thisMapto form a newMap.default <U> Seq<U>Map. map(java.util.function.Function<? super Tuple2<K,V>,? extends U> mapper)Maps theMapentries to a sequence of values.<K2,V2>
Multimap<K2,V2>Multimap. map(java.util.function.BiFunction<? super K,? super V,Tuple2<K2,V2>> mapper)Maps the entries of thisMultimapto form a newMultimap.default <U> Seq<U>Multimap. map(java.util.function.Function<? super Tuple2<K,V>,? extends U> mapper)Maps theMultimapentries to a sequence of values.<K2,V2>
SortedMap<K2,V2>SortedMap. map(java.util.Comparator<? super K2> keyComparator, java.util.function.BiFunction<? super K,? super V,Tuple2<K2,V2>> mapper)Same asSortedMap.map(BiFunction), using a specific comparator for keys of the codomain of the givenmapper.<K2,V2>
SortedMap<K2,V2>SortedMap. map(java.util.function.BiFunction<? super K,? super V,Tuple2<K2,V2>> mapper)private static <K,K2,V,V2>
TreeMap<K2,V2>TreeMap. map(TreeMap<K,V> map, TreeMap.EntryComparator<K2,V2> entryComparator, java.util.function.BiFunction<? super K,? super V,Tuple2<K2,V2>> mapper)<K2,V2>
TreeMap<K2,V2>TreeMap. map(java.util.Comparator<? super K2> keyComparator, java.util.function.BiFunction<? super K,? super V,Tuple2<K2,V2>> mapper)<K2,V2>
TreeMap<K2,V2>TreeMap. map(java.util.function.BiFunction<? super K,? super V,Tuple2<K2,V2>> mapper)static <T,K,V>
HashMap<K,V>HashMap. ofAll(java.util.stream.Stream<? extends T> stream, java.util.function.Function<? super T,Tuple2<? extends K,? extends V>> entryMapper)Returns aHashMap, from entries mapped from stream.<T,K,V2 extends V>
HashMultimap<K,V2>HashMultimap.Builder. ofAll(java.util.stream.Stream<? extends T> stream, java.util.function.Function<? super T,Tuple2<? extends K,? extends V2>> entryMapper)Returns aHashMultimap, from entries mapped from stream.static <T,K,V>
LinkedHashMap<K,V>LinkedHashMap. ofAll(java.util.stream.Stream<? extends T> stream, java.util.function.Function<? super T,Tuple2<? extends K,? extends V>> entryMapper)Returns aLinkedHashMap, from entries mapped from stream.<T,K,V2 extends V>
LinkedHashMultimap<K,V2>LinkedHashMultimap.Builder. ofAll(java.util.stream.Stream<? extends T> stream, java.util.function.Function<? super T,Tuple2<? extends K,? extends V2>> entryMapper)Returns aLinkedHashMultimap, from entries mapped from stream.static <T,K,V>
TreeMap<K,V>TreeMap. ofAll(java.util.Comparator<? super K> keyComparator, java.util.stream.Stream<? extends T> stream, java.util.function.Function<? super T,Tuple2<? extends K,? extends V>> entryMapper)Returns aTreeMap, from entries mapped from stream.static <T,K extends java.lang.Comparable<? super K>,V>
TreeMap<K,V>TreeMap. ofAll(java.util.stream.Stream<? extends T> stream, java.util.function.Function<? super T,Tuple2<? extends K,? extends V>> entryMapper)Returns aTreeMap, from entries mapped from stream.<T,K,V2 extends V>
TreeMultimap<K,V2>TreeMultimap.Builder. ofAll(java.util.Comparator<? super K> keyComparator, java.util.stream.Stream<? extends T> stream, java.util.function.Function<? super T,Tuple2<? extends K,? extends V2>> entryMapper)Returns aTreeMultimap, from entries mapped from stream.<T,K extends java.lang.Comparable<? super K>,V2 extends V>
TreeMultimap<K,V2>TreeMultimap.Builder. ofAll(java.util.stream.Stream<? extends T> stream, java.util.function.Function<? super T,Tuple2<? extends K,? extends V2>> entryMapper)Returns aTreeMultimap, from entries mapped from stream.static <K,V>
HashMap<K,V>HashMap. ofEntries(java.lang.Iterable<? extends Tuple2<? extends K,? extends V>> entries)Creates a HashMap of the given entries.<K,V2 extends V>
HashMultimap<K,V2>HashMultimap.Builder. ofEntries(java.lang.Iterable<? extends Tuple2<? extends K,? extends V2>> entries)Creates aHashMultimapof the given entries.static <K,V>
LinkedHashMap<K,V>LinkedHashMap. ofEntries(java.lang.Iterable<? extends Tuple2<? extends K,? extends V>> entries)Creates a LinkedHashMap of the given entries.<K,V2 extends V>
LinkedHashMultimap<K,V2>LinkedHashMultimap.Builder. ofEntries(java.lang.Iterable<? extends Tuple2<? extends K,? extends V2>> entries)Creates aLinkedHashMultimapof the given entries.static <K extends java.lang.Comparable<? super K>,V>
TreeMap<K,V>TreeMap. ofEntries(java.lang.Iterable<? extends Tuple2<? extends K,? extends V>> entries)Creates aTreeMapof the given entries.static <K,V>
TreeMap<K,V>TreeMap. ofEntries(java.util.Comparator<? super K> keyComparator, java.lang.Iterable<? extends Tuple2<? extends K,? extends V>> entries)Creates aTreeMapof the given entries.<K extends java.lang.Comparable<? super K>,V2 extends V>
TreeMultimap<K,V2>TreeMultimap.Builder. ofEntries(java.lang.Iterable<? extends Tuple2<? extends K,? extends V2>> entries)Creates aTreeMultimapof the given entries.<K,V2 extends V>
TreeMultimap<K,V2>TreeMultimap.Builder. ofEntries(java.util.Comparator<? super K> keyComparator, java.lang.Iterable<? extends Tuple2<? extends K,? extends V2>> entries)Creates aTreeMultimapof the given entries.(package private) static <T,K,V,M extends Map<K,V>>
MMaps. ofStream(M map, java.util.stream.Stream<? extends T> stream, java.util.function.Function<? super T,Tuple2<? extends K,? extends V>> entryMapper)(package private) static <T,K,V,M extends Multimap<K,V>>
MMultimaps. ofStream(M source, java.util.stream.Stream<? extends T> stream, java.util.function.Function<? super T,Tuple2<? extends K,? extends V>> entryMapper)MAbstractMultimap. orElse(java.lang.Iterable<? extends Tuple2<K,V>> other)Returns thisMultimapif it is nonempty, otherwiseMultimapcreated from iterable, using existing multimap properties.MAbstractMultimap. orElse(java.util.function.Supplier<? extends java.lang.Iterable<? extends Tuple2<K,V>>> supplier)Returns thisMultimapif it is nonempty, otherwiseMultimapcreated from result of evaluating supplier, using existing multimap properties.HashMap<K,V>HashMap. orElse(java.lang.Iterable<? extends Tuple2<K,V>> other)HashMap<K,V>HashMap. orElse(java.util.function.Supplier<? extends java.lang.Iterable<? extends Tuple2<K,V>>> supplier)LinkedHashMap<K,V>LinkedHashMap. orElse(java.lang.Iterable<? extends Tuple2<K,V>> other)LinkedHashMap<K,V>LinkedHashMap. orElse(java.util.function.Supplier<? extends java.lang.Iterable<? extends Tuple2<K,V>>> supplier)Map<K,V>Map. orElse(java.lang.Iterable<? extends Tuple2<K,V>> other)Map<K,V>Map. orElse(java.util.function.Supplier<? extends java.lang.Iterable<? extends Tuple2<K,V>>> supplier)Multimap<K,V>Multimap. orElse(java.lang.Iterable<? extends Tuple2<K,V>> other)Multimap<K,V>Multimap. orElse(java.util.function.Supplier<? extends java.lang.Iterable<? extends Tuple2<K,V>>> supplier)SortedMap<K,V>SortedMap. orElse(java.lang.Iterable<? extends Tuple2<K,V>> other)SortedMap<K,V>SortedMap. orElse(java.util.function.Supplier<? extends java.lang.Iterable<? extends Tuple2<K,V>>> supplier)SortedMultimap<K,V>SortedMultimap. orElse(java.lang.Iterable<? extends Tuple2<K,V>> other)SortedMultimap<K,V>SortedMultimap. orElse(java.util.function.Supplier<? extends java.lang.Iterable<? extends Tuple2<K,V>>> supplier)TreeMap<K,V>TreeMap. orElse(java.lang.Iterable<? extends Tuple2<K,V>> other)Returns thisTreeMapif it is nonempty, otherwiseTreeMapcreated from iterable, using existing comparator.TreeMap<K,V>TreeMap. orElse(java.util.function.Supplier<? extends java.lang.Iterable<? extends Tuple2<K,V>>> supplier)Returns thisTreeMapif it is nonempty, otherwiseTreeMapcreated from result of evaluating supplier, using existing comparator.Tuple2<M,M>AbstractMultimap. partition(java.util.function.Predicate<? super Tuple2<K,V>> predicate)Tuple2<HashMap<K,V>,HashMap<K,V>>HashMap. partition(java.util.function.Predicate<? super Tuple2<K,V>> predicate)Tuple2<LinkedHashMap<K,V>,LinkedHashMap<K,V>>LinkedHashMap. partition(java.util.function.Predicate<? super Tuple2<K,V>> predicate)Tuple2<? extends Map<K,V>,? extends Map<K,V>>Map. partition(java.util.function.Predicate<? super Tuple2<K,V>> predicate)(package private) static <K,V,M extends Map<K,V>>
Tuple2<M,M>Maps. partition(M map, Maps.OfEntries<K,V,M> ofEntries, java.util.function.Predicate<? super Tuple2<K,V>> predicate)Tuple2<? extends Multimap<K,V>,? extends Multimap<K,V>>Multimap. partition(java.util.function.Predicate<? super Tuple2<K,V>> predicate)Tuple2<? extends SortedMap<K,V>,? extends SortedMap<K,V>>SortedMap. partition(java.util.function.Predicate<? super Tuple2<K,V>> predicate)Tuple2<? extends SortedMultimap<K,V>,? extends SortedMultimap<K,V>>SortedMultimap. partition(java.util.function.Predicate<? super Tuple2<K,V>> predicate)Tuple2<TreeMap<K,V>,TreeMap<K,V>>TreeMap. partition(java.util.function.Predicate<? super Tuple2<K,V>> predicate)MAbstractMultimap. peek(java.util.function.Consumer<? super Tuple2<K,V>> action)HashMap<K,V>HashMap. peek(java.util.function.Consumer<? super Tuple2<K,V>> action)LinkedHashMap<K,V>LinkedHashMap. peek(java.util.function.Consumer<? super Tuple2<K,V>> action)Map<K,V>Map. peek(java.util.function.Consumer<? super Tuple2<K,V>> action)(package private) static <K,V,M extends Map<K,V>>
MMaps. peek(M map, java.util.function.Consumer<? super Tuple2<K,V>> action)Multimap<K,V>Multimap. peek(java.util.function.Consumer<? super Tuple2<K,V>> action)SortedMap<K,V>SortedMap. peek(java.util.function.Consumer<? super Tuple2<K,V>> action)SortedMultimap<K,V>SortedMultimap. peek(java.util.function.Consumer<? super Tuple2<K,V>> action)TreeMap<K,V>TreeMap. peek(java.util.function.Consumer<? super Tuple2<K,V>> action)MAbstractMultimap. reject(java.util.function.Predicate<? super Tuple2<K,V>> predicate)HashMap<K,V>HashMap. reject(java.util.function.Predicate<? super Tuple2<K,V>> predicate)LinkedHashMap<K,V>LinkedHashMap. reject(java.util.function.Predicate<? super Tuple2<K,V>> predicate)Map<K,V>Map. reject(java.util.function.Predicate<? super Tuple2<K,V>> predicate)(package private) static <K,V,M extends Map<K,V>>
MMaps. reject(M map, Maps.OfEntries<K,V,M> ofEntries, java.util.function.Predicate<? super Tuple2<K,V>> predicate)Multimap<K,V>Multimap. reject(java.util.function.Predicate<? super Tuple2<K,V>> predicate)SortedMap<K,V>SortedMap. reject(java.util.function.Predicate<? super Tuple2<K,V>> predicate)SortedMultimap<K,V>SortedMultimap. reject(java.util.function.Predicate<? super Tuple2<K,V>> predicate)TreeMap<K,V>TreeMap. reject(java.util.function.Predicate<? super Tuple2<K,V>> predicate)MAbstractMultimap. retainAll(java.lang.Iterable<? extends Tuple2<K,V>> elements)HashMap<K,V>HashMap. retainAll(java.lang.Iterable<? extends Tuple2<K,V>> elements)LinkedHashMap<K,V>LinkedHashMap. retainAll(java.lang.Iterable<? extends Tuple2<K,V>> elements)Map<K,V>Map. retainAll(java.lang.Iterable<? extends Tuple2<K,V>> elements)Multimap<K,V>Multimap. retainAll(java.lang.Iterable<? extends Tuple2<K,V>> elements)SortedMap<K,V>SortedMap. retainAll(java.lang.Iterable<? extends Tuple2<K,V>> elements)SortedMultimap<K,V>SortedMultimap. retainAll(java.lang.Iterable<? extends Tuple2<K,V>> elements)TreeMap<K,V>TreeMap. retainAll(java.lang.Iterable<? extends Tuple2<K,V>> elements)MAbstractMultimap. scan(Tuple2<K,V> zero, java.util.function.BiFunction<? super Tuple2<K,V>,? super Tuple2<K,V>,? extends Tuple2<K,V>> operation)MAbstractMultimap. scan(Tuple2<K,V> zero, java.util.function.BiFunction<? super Tuple2<K,V>,? super Tuple2<K,V>,? extends Tuple2<K,V>> operation)MAbstractMultimap. scan(Tuple2<K,V> zero, java.util.function.BiFunction<? super Tuple2<K,V>,? super Tuple2<K,V>,? extends Tuple2<K,V>> operation)HashMap<K,V>HashMap. scan(Tuple2<K,V> zero, java.util.function.BiFunction<? super Tuple2<K,V>,? super Tuple2<K,V>,? extends Tuple2<K,V>> operation)HashMap<K,V>HashMap. scan(Tuple2<K,V> zero, java.util.function.BiFunction<? super Tuple2<K,V>,? super Tuple2<K,V>,? extends Tuple2<K,V>> operation)HashMap<K,V>HashMap. scan(Tuple2<K,V> zero, java.util.function.BiFunction<? super Tuple2<K,V>,? super Tuple2<K,V>,? extends Tuple2<K,V>> operation)LinkedHashMap<K,V>LinkedHashMap. scan(Tuple2<K,V> zero, java.util.function.BiFunction<? super Tuple2<K,V>,? super Tuple2<K,V>,? extends Tuple2<K,V>> operation)LinkedHashMap<K,V>LinkedHashMap. scan(Tuple2<K,V> zero, java.util.function.BiFunction<? super Tuple2<K,V>,? super Tuple2<K,V>,? extends Tuple2<K,V>> operation)LinkedHashMap<K,V>LinkedHashMap. scan(Tuple2<K,V> zero, java.util.function.BiFunction<? super Tuple2<K,V>,? super Tuple2<K,V>,? extends Tuple2<K,V>> operation)Map<K,V>Map. scan(Tuple2<K,V> zero, java.util.function.BiFunction<? super Tuple2<K,V>,? super Tuple2<K,V>,? extends Tuple2<K,V>> operation)Map<K,V>Map. scan(Tuple2<K,V> zero, java.util.function.BiFunction<? super Tuple2<K,V>,? super Tuple2<K,V>,? extends Tuple2<K,V>> operation)Map<K,V>Map. scan(Tuple2<K,V> zero, java.util.function.BiFunction<? super Tuple2<K,V>,? super Tuple2<K,V>,? extends Tuple2<K,V>> operation)(package private) static <K,V,M extends Map<K,V>>
MMaps. scan(M map, Tuple2<K,V> zero, java.util.function.BiFunction<? super Tuple2<K,V>,? super Tuple2<K,V>,? extends Tuple2<K,V>> operation, java.util.function.Function<Iterator<Tuple2<K,V>>,Traversable<Tuple2<K,V>>> finisher)(package private) static <K,V,M extends Map<K,V>>
MMaps. scan(M map, Tuple2<K,V> zero, java.util.function.BiFunction<? super Tuple2<K,V>,? super Tuple2<K,V>,? extends Tuple2<K,V>> operation, java.util.function.Function<Iterator<Tuple2<K,V>>,Traversable<Tuple2<K,V>>> finisher)(package private) static <K,V,M extends Map<K,V>>
MMaps. scan(M map, Tuple2<K,V> zero, java.util.function.BiFunction<? super Tuple2<K,V>,? super Tuple2<K,V>,? extends Tuple2<K,V>> operation, java.util.function.Function<Iterator<Tuple2<K,V>>,Traversable<Tuple2<K,V>>> finisher)(package private) static <K,V,M extends Map<K,V>>
MMaps. scan(M map, Tuple2<K,V> zero, java.util.function.BiFunction<? super Tuple2<K,V>,? super Tuple2<K,V>,? extends Tuple2<K,V>> operation, java.util.function.Function<Iterator<Tuple2<K,V>>,Traversable<Tuple2<K,V>>> finisher)(package private) static <K,V,M extends Map<K,V>>
MMaps. scan(M map, Tuple2<K,V> zero, java.util.function.BiFunction<? super Tuple2<K,V>,? super Tuple2<K,V>,? extends Tuple2<K,V>> operation, java.util.function.Function<Iterator<Tuple2<K,V>>,Traversable<Tuple2<K,V>>> finisher)Multimap<K,V>Multimap. scan(Tuple2<K,V> zero, java.util.function.BiFunction<? super Tuple2<K,V>,? super Tuple2<K,V>,? extends Tuple2<K,V>> operation)Multimap<K,V>Multimap. scan(Tuple2<K,V> zero, java.util.function.BiFunction<? super Tuple2<K,V>,? super Tuple2<K,V>,? extends Tuple2<K,V>> operation)Multimap<K,V>Multimap. scan(Tuple2<K,V> zero, java.util.function.BiFunction<? super Tuple2<K,V>,? super Tuple2<K,V>,? extends Tuple2<K,V>> operation)SortedMap<K,V>SortedMap. scan(Tuple2<K,V> zero, java.util.function.BiFunction<? super Tuple2<K,V>,? super Tuple2<K,V>,? extends Tuple2<K,V>> operation)SortedMap<K,V>SortedMap. scan(Tuple2<K,V> zero, java.util.function.BiFunction<? super Tuple2<K,V>,? super Tuple2<K,V>,? extends Tuple2<K,V>> operation)SortedMap<K,V>SortedMap. scan(Tuple2<K,V> zero, java.util.function.BiFunction<? super Tuple2<K,V>,? super Tuple2<K,V>,? extends Tuple2<K,V>> operation)SortedMultimap<K,V>SortedMultimap. scan(Tuple2<K,V> zero, java.util.function.BiFunction<? super Tuple2<K,V>,? super Tuple2<K,V>,? extends Tuple2<K,V>> operation)SortedMultimap<K,V>SortedMultimap. scan(Tuple2<K,V> zero, java.util.function.BiFunction<? super Tuple2<K,V>,? super Tuple2<K,V>,? extends Tuple2<K,V>> operation)SortedMultimap<K,V>SortedMultimap. scan(Tuple2<K,V> zero, java.util.function.BiFunction<? super Tuple2<K,V>,? super Tuple2<K,V>,? extends Tuple2<K,V>> operation)TreeMap<K,V>TreeMap. scan(Tuple2<K,V> zero, java.util.function.BiFunction<? super Tuple2<K,V>,? super Tuple2<K,V>,? extends Tuple2<K,V>> operation)TreeMap<K,V>TreeMap. scan(Tuple2<K,V> zero, java.util.function.BiFunction<? super Tuple2<K,V>,? super Tuple2<K,V>,? extends Tuple2<K,V>> operation)TreeMap<K,V>TreeMap. scan(Tuple2<K,V> zero, java.util.function.BiFunction<? super Tuple2<K,V>,? super Tuple2<K,V>,? extends Tuple2<K,V>> operation)default <U> Seq<U>Map. scanLeft(U zero, java.util.function.BiFunction<? super U,? super Tuple2<K,V>,? extends U> operation)default <U> Seq<U>Multimap. scanLeft(U zero, java.util.function.BiFunction<? super U,? super Tuple2<K,V>,? extends U> operation)default <U> Seq<U>Map. scanRight(U zero, java.util.function.BiFunction<? super Tuple2<K,V>,? super U,? extends U> operation)default <U> Seq<U>Multimap. scanRight(U zero, java.util.function.BiFunction<? super Tuple2<K,V>,? super U,? extends U> operation)Iterator<M>AbstractMultimap. slideBy(java.util.function.Function<? super Tuple2<K,V>,?> classifier)Iterator<HashMap<K,V>>HashMap. slideBy(java.util.function.Function<? super Tuple2<K,V>,?> classifier)Iterator<LinkedHashMap<K,V>>LinkedHashMap. slideBy(java.util.function.Function<? super Tuple2<K,V>,?> classifier)Iterator<? extends Map<K,V>>Map. slideBy(java.util.function.Function<? super Tuple2<K,V>,?> classifier)(package private) static <K,V,M extends Map<K,V>>
Iterator<M>Maps. slideBy(M map, Maps.OfEntries<K,V,M> ofEntries, java.util.function.Function<? super Tuple2<K,V>,?> classifier)Iterator<? extends Multimap<K,V>>Multimap. slideBy(java.util.function.Function<? super Tuple2<K,V>,?> classifier)Iterator<? extends SortedMap<K,V>>SortedMap. slideBy(java.util.function.Function<? super Tuple2<K,V>,?> classifier)Iterator<? extends SortedMultimap<K,V>>SortedMultimap. slideBy(java.util.function.Function<? super Tuple2<K,V>,?> classifier)Iterator<TreeMap<K,V>>TreeMap. slideBy(java.util.function.Function<? super Tuple2<K,V>,?> classifier)Tuple2<M,M>AbstractMultimap. span(java.util.function.Predicate<? super Tuple2<K,V>> predicate)Tuple2<HashMap<K,V>,HashMap<K,V>>HashMap. span(java.util.function.Predicate<? super Tuple2<K,V>> predicate)Tuple2<LinkedHashMap<K,V>,LinkedHashMap<K,V>>LinkedHashMap. span(java.util.function.Predicate<? super Tuple2<K,V>> predicate)Tuple2<? extends Map<K,V>,? extends Map<K,V>>Map. span(java.util.function.Predicate<? super Tuple2<K,V>> predicate)(package private) static <K,V,M extends Map<K,V>>
Tuple2<M,M>Maps. span(M map, Maps.OfEntries<K,V,M> ofEntries, java.util.function.Predicate<? super Tuple2<K,V>> predicate)Tuple2<? extends Multimap<K,V>,? extends Multimap<K,V>>Multimap. span(java.util.function.Predicate<? super Tuple2<K,V>> predicate)Tuple2<? extends SortedMap<K,V>,? extends SortedMap<K,V>>SortedMap. span(java.util.function.Predicate<? super Tuple2<K,V>> predicate)Tuple2<? extends SortedMultimap<K,V>,? extends SortedMultimap<K,V>>SortedMultimap. span(java.util.function.Predicate<? super Tuple2<K,V>> predicate)Tuple2<TreeMap<K,V>,TreeMap<K,V>>TreeMap. span(java.util.function.Predicate<? super Tuple2<K,V>> predicate)static <K,V>
HashMap<K,V>HashMap. tabulate(int n, java.util.function.Function<? super java.lang.Integer,? extends Tuple2<? extends K,? extends V>> f)Returns an HashMap containingnvalues of a given Functionfover a range of integer values from 0 ton - 1.<K,V2 extends V>
HashMultimap<K,V2>HashMultimap.Builder. tabulate(int n, java.util.function.Function<? super java.lang.Integer,? extends Tuple2<? extends K,? extends V2>> f)Returns a HashMultimap containingnvalues of a given Functionfover a range of integer values from 0 ton - 1.static <K,V>
LinkedHashMap<K,V>LinkedHashMap. tabulate(int n, java.util.function.Function<? super java.lang.Integer,? extends Tuple2<? extends K,? extends V>> f)Returns a LinkedHashMap containingnvalues of a given Functionfover a range of integer values from 0 ton - 1.<K,V2 extends V>
LinkedHashMultimap<K,V2>LinkedHashMultimap.Builder. tabulate(int n, java.util.function.Function<? super java.lang.Integer,? extends Tuple2<? extends K,? extends V2>> f)Returns a LinkedHashMultimap containingnvalues of a given Functionfover a range of integer values from 0 ton - 1.static <K extends java.lang.Comparable<? super K>,V>
TreeMap<K,V>TreeMap. tabulate(int n, java.util.function.Function<? super java.lang.Integer,? extends Tuple2<? extends K,? extends V>> f)Returns a TreeMap containingnvalues of a given Functionfover a range of integer values from 0 ton - 1.static <K,V>
TreeMap<K,V>TreeMap. tabulate(java.util.Comparator<? super K> keyComparator, int n, java.util.function.Function<? super java.lang.Integer,? extends Tuple2<? extends K,? extends V>> f)Returns a TreeMap containingnvalues of a given Functionfover a range of integer values from 0 ton - 1.<K extends java.lang.Comparable<? super K>,V2 extends V>
TreeMultimap<K,V2>TreeMultimap.Builder. tabulate(int n, java.util.function.Function<? super java.lang.Integer,? extends Tuple2<? extends K,? extends V2>> f)Returns a TreeMultimap containingnvalues of a given Functionfover a range of integer values from 0 ton - 1.<K,V2 extends V>
TreeMultimap<K,V2>TreeMultimap.Builder. tabulate(java.util.Comparator<? super K> keyComparator, int n, java.util.function.Function<? super java.lang.Integer,? extends Tuple2<? extends K,? extends V2>> f)Returns a TreeMultimap containingnvalues of a given Functionfover a range of integer values from 0 ton - 1.MAbstractMultimap. takeUntil(java.util.function.Predicate<? super Tuple2<K,V>> predicate)HashMap<K,V>HashMap. takeUntil(java.util.function.Predicate<? super Tuple2<K,V>> predicate)LinkedHashMap<K,V>LinkedHashMap. takeUntil(java.util.function.Predicate<? super Tuple2<K,V>> predicate)Map<K,V>Map. takeUntil(java.util.function.Predicate<? super Tuple2<K,V>> predicate)(package private) static <K,V,M extends Map<K,V>>
MMaps. takeUntil(M map, Maps.OfEntries<K,V,M> ofEntries, java.util.function.Predicate<? super Tuple2<K,V>> predicate)Multimap<K,V>Multimap. takeUntil(java.util.function.Predicate<? super Tuple2<K,V>> predicate)SortedMap<K,V>SortedMap. takeUntil(java.util.function.Predicate<? super Tuple2<K,V>> predicate)SortedMultimap<K,V>SortedMultimap. takeUntil(java.util.function.Predicate<? super Tuple2<K,V>> predicate)TreeMap<K,V>TreeMap. takeUntil(java.util.function.Predicate<? super Tuple2<K,V>> predicate)MAbstractMultimap. takeWhile(java.util.function.Predicate<? super Tuple2<K,V>> predicate)HashMap<K,V>HashMap. takeWhile(java.util.function.Predicate<? super Tuple2<K,V>> predicate)LinkedHashMap<K,V>LinkedHashMap. takeWhile(java.util.function.Predicate<? super Tuple2<K,V>> predicate)Map<K,V>Map. takeWhile(java.util.function.Predicate<? super Tuple2<K,V>> predicate)(package private) static <K,V,M extends Map<K,V>>
MMaps. takeWhile(M map, Maps.OfEntries<K,V,M> ofEntries, java.util.function.Predicate<? super Tuple2<K,V>> predicate)Multimap<K,V>Multimap. takeWhile(java.util.function.Predicate<? super Tuple2<K,V>> predicate)SortedMap<K,V>SortedMap. takeWhile(java.util.function.Predicate<? super Tuple2<K,V>> predicate)SortedMultimap<K,V>SortedMultimap. takeWhile(java.util.function.Predicate<? super Tuple2<K,V>> predicate)TreeMap<K,V>TreeMap. takeWhile(java.util.function.Predicate<? super Tuple2<K,V>> predicate)static <T> Array<T>Array. unfold(T seed, java.util.function.Function<? super T,Option<Tuple2<? extends T,? extends T>>> f)Creates an Array from a seed value and a function.static CharSeqCharSeq. unfold(java.lang.Character seed, java.util.function.Function<? super java.lang.Character,Option<Tuple2<? extends java.lang.Character,? extends java.lang.Character>>> f)Creates a CharSeq from a seed value and a function.static <T> Iterator<T>Iterator. unfold(T seed, java.util.function.Function<? super T,Option<Tuple2<? extends T,? extends T>>> f)Creates an iterator from a seed value and a function.static <T> List<T>List. unfold(T seed, java.util.function.Function<? super T,Option<Tuple2<? extends T,? extends T>>> f)Creates a list from a seed value and a function.static <T> Queue<T>Queue. unfold(T seed, java.util.function.Function<? super T,Option<Tuple2<? extends T,? extends T>>> f)Creates a Queue from a seed value and a function.static <T> Stream<T>Stream. unfold(T seed, java.util.function.Function<? super T,Option<Tuple2<? extends T,? extends T>>> f)Creates a Stream from a seed value and a function.static <T> Vector<T>Vector. unfold(T seed, java.util.function.Function<? super T,Option<Tuple2<? extends T,? extends T>>> f)Creates a Vector from a seed value and a function.static <T,U>
Array<U>Array. unfoldLeft(T seed, java.util.function.Function<? super T,Option<Tuple2<? extends T,? extends U>>> f)Creates an Array from a seed value and a function.static <T> CharSeqCharSeq. unfoldLeft(T seed, java.util.function.Function<? super T,Option<Tuple2<? extends T,? extends java.lang.Character>>> f)Creates a CharSeq from a seed value and a function.static <T,U>
Iterator<U>Iterator. unfoldLeft(T seed, java.util.function.Function<? super T,Option<Tuple2<? extends T,? extends U>>> f)Creates an iterator from a seed value and a function.static <T,U>
List<U>List. unfoldLeft(T seed, java.util.function.Function<? super T,Option<Tuple2<? extends T,? extends U>>> f)Creates a list from a seed value and a function.static <T,U>
Queue<U>Queue. unfoldLeft(T seed, java.util.function.Function<? super T,Option<Tuple2<? extends T,? extends U>>> f)Creates a Queue from a seed value and a function.static <T,U>
Stream<U>Stream. unfoldLeft(T seed, java.util.function.Function<? super T,Option<Tuple2<? extends T,? extends U>>> f)Creates a Stream from a seed value and a function.static <T,U>
Vector<U>Vector. unfoldLeft(T seed, java.util.function.Function<? super T,Option<Tuple2<? extends T,? extends U>>> f)Creates a Vector from a seed value and a function.static <T,U>
Array<U>Array. unfoldRight(T seed, java.util.function.Function<? super T,Option<Tuple2<? extends U,? extends T>>> f)Creates an Array from a seed value and a function.static <T> CharSeqCharSeq. unfoldRight(T seed, java.util.function.Function<? super T,Option<Tuple2<? extends java.lang.Character,? extends T>>> f)Creates a CharSeq from a seed value and a function.static <T,U>
Iterator<U>Iterator. unfoldRight(T seed, java.util.function.Function<? super T,Option<Tuple2<? extends U,? extends T>>> f)Creates an iterator from a seed value and a function.static <T,U>
List<U>List. unfoldRight(T seed, java.util.function.Function<? super T,Option<Tuple2<? extends U,? extends T>>> f)Creates a list from a seed value and a function.static <T,U>
Queue<U>Queue. unfoldRight(T seed, java.util.function.Function<? super T,Option<Tuple2<? extends U,? extends T>>> f)Creates a Queue from a seed value and a function.static <T,U>
Stream<U>Stream. unfoldRight(T seed, java.util.function.Function<? super T,Option<Tuple2<? extends U,? extends T>>> f)Creates a Stream from a seed value and a function.static <T,U>
Vector<U>Vector. unfoldRight(T seed, java.util.function.Function<? super T,Option<Tuple2<? extends U,? extends T>>> f)Creates a Vector from a seed value and a function.<T1,T2>
Tuple2<Array<T1>,Array<T2>>Array. unzip(java.util.function.Function<? super T,Tuple2<? extends T1,? extends T2>> unzipper)default <T1,T2>
Tuple2<TreeSet<T1>,TreeSet<T2>>BitSet. unzip(java.util.function.Function<? super T,Tuple2<? extends T1,? extends T2>> unzipper)<T1,T2>
Tuple2<IndexedSeq<T1>,IndexedSeq<T2>>CharSeq. unzip(java.util.function.Function<? super java.lang.Character,Tuple2<? extends T1,? extends T2>> unzipper)<T1,T2>
Tuple2<HashSet<T1>,HashSet<T2>>HashSet. unzip(java.util.function.Function<? super T,Tuple2<? extends T1,? extends T2>> unzipper)<T1,T2>
Tuple2<? extends IndexedSeq<T1>,? extends IndexedSeq<T2>>IndexedSeq. unzip(java.util.function.Function<? super T,Tuple2<? extends T1,? extends T2>> unzipper)default <T1,T2>
Tuple2<Iterator<T1>,Iterator<T2>>Iterator. unzip(java.util.function.Function<? super T,Tuple2<? extends T1,? extends T2>> unzipper)<T1,T2>
Tuple2<? extends LinearSeq<T1>,? extends LinearSeq<T2>>LinearSeq. unzip(java.util.function.Function<? super T,Tuple2<? extends T1,? extends T2>> unzipper)<T1,T2>
Tuple2<LinkedHashSet<T1>,LinkedHashSet<T2>>LinkedHashSet. unzip(java.util.function.Function<? super T,Tuple2<? extends T1,? extends T2>> unzipper)default <T1,T2>
Tuple2<List<T1>,List<T2>>List. unzip(java.util.function.Function<? super T,Tuple2<? extends T1,? extends T2>> unzipper)default <T1,T2>
Tuple2<Seq<T1>,Seq<T2>>Map. unzip(java.util.function.BiFunction<? super K,? super V,Tuple2<? extends T1,? extends T2>> unzipper)default <T1,T2>
Tuple2<Seq<T1>,Seq<T2>>Map. unzip(java.util.function.Function<? super Tuple2<K,V>,Tuple2<? extends T1,? extends T2>> unzipper)default <T1,T2>
Tuple2<Seq<T1>,Seq<T2>>Map. unzip(java.util.function.Function<? super Tuple2<K,V>,Tuple2<? extends T1,? extends T2>> unzipper)default <T1,T2>
Tuple2<Seq<T1>,Seq<T2>>Multimap. unzip(java.util.function.BiFunction<? super K,? super V,Tuple2<? extends T1,? extends T2>> unzipper)default <T1,T2>
Tuple2<Seq<T1>,Seq<T2>>Multimap. unzip(java.util.function.Function<? super Tuple2<K,V>,Tuple2<? extends T1,? extends T2>> unzipper)default <T1,T2>
Tuple2<Seq<T1>,Seq<T2>>Multimap. unzip(java.util.function.Function<? super Tuple2<K,V>,Tuple2<? extends T1,? extends T2>> unzipper)<T1,T2>
Tuple2<? extends PriorityQueue<T1>,? extends PriorityQueue<T2>>PriorityQueue. unzip(java.util.function.Function<? super T,Tuple2<? extends T1,? extends T2>> unzipper)<T1,T2>
Tuple2<Queue<T1>,Queue<T2>>Queue. unzip(java.util.function.Function<? super T,Tuple2<? extends T1,? extends T2>> unzipper)<T1,T2>
Tuple2<? extends Seq<T1>,? extends Seq<T2>>Seq. unzip(java.util.function.Function<? super T,Tuple2<? extends T1,? extends T2>> unzipper)<T1,T2>
Tuple2<? extends Set<T1>,? extends Set<T2>>Set. unzip(java.util.function.Function<? super T,Tuple2<? extends T1,? extends T2>> unzipper)<T1,T2>
Tuple2<? extends SortedSet<T1>,? extends SortedSet<T2>>SortedSet. unzip(java.util.function.Function<? super T,Tuple2<? extends T1,? extends T2>> unzipper)default <T1,T2>
Tuple2<Stream<T1>,Stream<T2>>Stream. unzip(java.util.function.Function<? super T,Tuple2<? extends T1,? extends T2>> unzipper)<T1,T2>
Tuple2<? extends Traversable<T1>,? extends Traversable<T2>>Traversable. unzip(java.util.function.Function<? super T,Tuple2<? extends T1,? extends T2>> unzipper)Unzips this elements by mapping this elements to pairs which are subsequently split into two distinct sets.default <T1,T2>
Tuple2<Tree<T1>,Tree<T2>>Tree. unzip(java.util.function.Function<? super T,Tuple2<? extends T1,? extends T2>> unzipper)static <T,T1,T2>
Tuple2<Tree.Node<T1>,Tree.Node<T2>>TreeModule. unzip(Tree.Node<T> node, java.util.function.Function<? super T,Tuple2<? extends T1,? extends T2>> unzipper)<T1,T2>
Tuple2<TreeSet<T1>,TreeSet<T2>>TreeSet. unzip(java.util.function.Function<? super T,Tuple2<? extends T1,? extends T2>> unzipper)<T1,T2>
Tuple2<Vector<T1>,Vector<T2>>Vector. unzip(java.util.function.Function<? super T,Tuple2<? extends T1,? extends T2>> unzipper)default <T1,T2,T3>
Tuple3<Seq<T1>,Seq<T2>,Seq<T3>>Map. unzip3(java.util.function.Function<? super Tuple2<K,V>,Tuple3<? extends T1,? extends T2,? extends T3>> unzipper)default <T1,T2,T3>
Tuple3<Seq<T1>,Seq<T2>,Seq<T3>>Multimap. unzip3(java.util.function.Function<? super Tuple2<K,V>,Tuple3<? extends T1,? extends T2,? extends T3>> unzipper)private static <K,V>
LinkedHashMap<K,V>LinkedHashMap. wrap(Queue<Tuple2<K,V>> list, HashMap<K,V> map)Construct Map with given values and key order.private static <K,V>
LinkedHashMap<K,V>LinkedHashMap. wrapNonUnique(Queue<Tuple2<K,V>> list, HashMap<K,V> map)Construct Map with given values and key order.default <U,R>
Seq<R>Map. zipWith(java.lang.Iterable<? extends U> that, java.util.function.BiFunction<? super Tuple2<K,V>,? super U,? extends R> mapper)default <U,R>
Seq<R>Multimap. zipWith(java.lang.Iterable<? extends U> that, java.util.function.BiFunction<? super Tuple2<K,V>,? super U,? extends R> mapper)default <U> Seq<U>Map. zipWithIndex(java.util.function.BiFunction<? super Tuple2<K,V>,? super java.lang.Integer,? extends U> mapper)default <U> Seq<U>Multimap. zipWithIndex(java.util.function.BiFunction<? super Tuple2<K,V>,? super java.lang.Integer,? extends U> mapper)Constructor parameters in io.vavr.collection with type arguments of type Tuple2 Constructor Description LinkedHashMap(Queue<Tuple2<K,V>> list, HashMap<K,V> map)TreeMap(RedBlackTree<Tuple2<K,V>> entries) -
Uses of Tuple2 in io.vavr.concurrent
Methods in io.vavr.concurrent that return types with arguments of type Tuple2 Modifier and Type Method Description default <U> Future<Tuple2<T,U>>Future. zip(Future<? extends U> that)Returns a tuple of this and that Future result. -
Uses of Tuple2 in io.vavr.test
Methods in io.vavr.test with parameters of type Tuple2 Modifier and Type Method Description static <T> Gen<T>Gen. frequency(Tuple2<java.lang.Integer,Gen<T>>... generators)Chooses one of the given generators according to their frequency.Method parameters in io.vavr.test with type arguments of type Tuple2 Modifier and Type Method Description static <T> Gen<T>Gen. frequency(java.lang.Iterable<Tuple2<java.lang.Integer,Gen<T>>> generators)Chooses one of the given generators according to their frequency.static <T> Gen<T>GenModule. frequency(int n, java.util.Iterator<Tuple2<java.lang.Integer,Gen<T>>> iter)Chooses a Gen according to the given frequencies.
-