Uses of Class
io.vavr.Tuple2
Packages that use Tuple2
Package
Description
Beside
API the io.vavr package contains core types like (Checked)Functions and Tuples.Purely functional collections based on Traversable.
This package contains basic building blocks for creating fast, asynchronous, non-blocking parallel code.
A property check framework built around Property which integrates well with unit test frameworks like junit.
-
Uses of Tuple2 in io.vavr
Modifier and TypeClassDescriptionstatic classAPI.Match.Pattern2<T,T1, T2> final classTuple2<T1,T2> A tuple of two elements which can be seen as cartesian product of two components.Modifier and TypeMethodDescriptionTuple1.append(T2 t2) Append a value to this tuple.<T1,T2> Tuple2 <T1, T2> Concat a tuple's values to this tuple.Concat a tuple's values to this tuple.static <T1,T2> Tuple2 <T1, T2> Creates aTuple2from aMap.Entry.<U1,U2> Tuple2 <U1, U2> Tuple2.map(BiFunction<? super T1, ? super T2, Tuple2<U1, U2>> mapper) Maps the components of this tuple using a mapper function.<U1,U2> Tuple2 <U1, U2> Maps the components of this tuple using a mapper function for each component.Maps the 1st component of this tuple to a new value.Maps the 2nd component of this tuple to a new value.static <T1,T2> Tuple2 <T1, T2> 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.Turns a sequence ofTuple2into a Tuple2 ofSeqs.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.Sets the 1st element of this tuple to the givenvalue.Sets the 2nd element of this tuple to the givenvalue.Modifier and TypeMethodDescriptionstatic <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> Comparator <Tuple2<T1, T2>> Tuple2.comparator(Comparator<? super T1> t1Comp, Comparator<? super T2> t2Comp) default CheckedFunction1<Tuple2<T1, T2>, R> CheckedFunction2.tupled()Returns a tupled version of this function.Function2.tupled()Returns a tupled version of this function.Modifier and TypeMethodDescriptionint<T1,T2> Tuple2 <T1, T2> Concat a tuple's values to this tuple.Concat a tuple's values to this tuple.Concat a tuple's values to this tuple.Concat a tuple's values to this tuple.Concat a tuple's values to this tuple.Concat a tuple's values to this tuple.Concat a tuple's values to this tuple.static <K,V> Map <K, V> Deprecated.Will be removed in a future version.static <K,V> Map <K, V> Deprecated.Will be removed in a future version.static <T1,T2> Tuple2 <T1, T2> Narrows a widenedTuple2<? extends T1, ? extends T2>toTuple2<T1, T2>.static <K extends Comparable<? super K>, V>
SortedMap<K, V> Deprecated.Will be removed in a future version.static <K,V> SortedMap <K, V> API.SortedMap(Comparator<? super K> keyComparator, Tuple2<? extends K, ? extends V>... entries) Deprecated.Will be removed in a future version.Modifier and TypeMethodDescription<U1,U2> Tuple2 <U1, U2> Tuple2.map(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(Class<? super T> type, API.Match.Pattern<T1, ?> p1, API.Match.Pattern<T2, ?> p2, Function<T, Tuple2<U1, U2>> unapply) Turns a sequence ofTuple2into a Tuple2 ofSeqs.default <K,V> Map <K, V> Converts this to a mutableMap.default <K, V, MAP extends Map<K,V>>
MAPValue.toJavaMap(Supplier<MAP> factory, Function<? super T, ? extends Tuple2<? extends K, ? extends V>> f) Converts this to a specific mutableMap.default <K,V> Map <K, V> Value.toLinkedMap(Function<? super T, ? extends Tuple2<? extends K, ? extends V>> f) Converts this to aMap.default <K,V> Map <K, V> Converts this to aMap.default <K,V> SortedMap <K, V> Value.toSortedMap(Comparator<? super K> comparator, Function<? super T, ? extends Tuple2<? extends K, ? extends V>> f) Converts this to aMap.default <K extends Comparable<? super K>, V>
SortedMap<K, V> Value.toSortedMap(Function<? super T, ? extends Tuple2<? extends K, ? extends V>> f) Converts this to aMap. -
Uses of Tuple2 in io.vavr.collection
Subinterfaces with type arguments of type Tuple2 in io.vavr.collectionModifier and TypeInterfaceDescriptioninterfaceMap<K,V> An immutableMapinterface.interfaceMultimap<K,V> An immutableMultimapinterface.Methods in io.vavr.collection that return Tuple2Modifier and TypeMethodDescriptionHashMap.computeIfAbsent(K key, Function<? super K, ? extends V> mappingFunction) Tuple2<V, LinkedHashMap<K, V>> LinkedHashMap.computeIfAbsent(K key, Function<? super K, ? extends V> mappingFunction) Map.computeIfAbsent(K key, 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.SortedMap.computeIfAbsent(K key, Function<? super K, ? extends V> mappingFunction) TreeMap.computeIfAbsent(K key, Function<? super K, ? extends V> mappingFunction) HashMap.computeIfPresent(K key, BiFunction<? super K, ? super V, ? extends V> remappingFunction) LinkedHashMap.computeIfPresent(K key, BiFunction<? super K, ? super V, ? extends V> remappingFunction) Map.computeIfPresent(K key, 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.SortedMap.computeIfPresent(K key, BiFunction<? super K, ? super V, ? extends V> remappingFunction) TreeMap.computeIfPresent(K key, BiFunction<? super K, ? super V, ? extends V> remappingFunction) Tuple2<T, PriorityQueue<T>> PriorityQueue.dequeue()static <K,V> Tuple2 <K, V> Map.entry(K key, V value) Convenience factory method to create a key/value pair.HashMap.head()LinkedHashMap.head()TreeMap.head()HashMap.last()LinkedHashMap.last()SortedMap.last()TreeMap.last()Tuple2<? extends IndexedSeq<T>, ? extends IndexedSeq<T>> Tuple2<LinkedHashMap<K, V>, LinkedHashMap<K, V>> Tuple2<? extends PriorityQueue<T>, ? extends PriorityQueue<T>> Tuple2<? extends SortedMultimap<K, V>, ? extends SortedMultimap<K, V>> Tuple2<? extends Traversable<T>, ? extends Traversable<T>> Creates a partition of thisTraversableby splitting this elements in two in distinct traversables according to a predicate.List.pop2()Removes the head element from this List.Tuple2<? extends IndexedSeq<T>, ? extends IndexedSeq<T>> Tuple2<LinkedHashMap<K, V>, LinkedHashMap<K, V>> Tuple2<? extends PriorityQueue<T>, ? extends PriorityQueue<T>> Tuple2<? extends SortedMultimap<K, V>, ? extends SortedMultimap<K, V>> Tuple2<? extends Traversable<T>, ? extends Traversable<T>> Returns a tuple where the first element is the longest prefix of elements that satisfy the givenpredicateand the second element is the remainder.Array.splitAt(int n) CharSeq.splitAt(int n) List.splitAt(int n) Queue.splitAt(int n) Seq.splitAt(int n) Splits a Seq at the specified index.Splits a sequence at the first element which satisfies thePredicate, e.g.Stream.splitAt(int n) Vector.splitAt(int n) Array.splitAtInclusive(Predicate<? super T> predicate) CharSeq.splitAtInclusive(Predicate<? super Character> predicate) List.splitAtInclusive(Predicate<? super T> predicate) Queue.splitAtInclusive(Predicate<? super T> predicate) Seq.splitAtInclusive(Predicate<? super T> predicate) Splits a sequence at the first element which satisfies thePredicate, e.g.Stream.splitAtInclusive(Predicate<? super T> predicate) Vector.splitAtInclusive(Predicate<? super T> predicate) <T1,T2> Tuple2 <IndexedSeq<T1>, IndexedSeq<T2>> <T1,T2> Tuple2 <? extends IndexedSeq<T1>, ? extends IndexedSeq<T2>> <T1,T2> Tuple2 <LinkedHashSet<T1>, LinkedHashSet<T2>> Map.unzip()Map.unzip(BiFunction<? super K, ? super V, Tuple2<? extends T1, ? extends T2>> unzipper) Multimap.unzip(BiFunction<? super K, ? super V, Tuple2<? extends T1, ? extends T2>> unzipper) <T1,T2> Tuple2 <? extends PriorityQueue<T1>, ? extends PriorityQueue<T2>> <T1,T2> Tuple2 <? extends Traversable<T1>, ? extends Traversable<T2>> Unzips this elements by mapping this elements to pairs which are subsequently split into two distinct sets.Methods in io.vavr.collection that return types with arguments of type Tuple2Modifier and TypeMethodDescriptionHashMap.collector()Returns aCollectorwhich may be used in conjunction withStream.collect(java.util.stream.Collector)to obtain aHashMap.HashMap.collector()Returns aCollectorwhich may be used in conjunction withStream.collect(java.util.stream.Collector)to obtain aHashMap.HashMultimap.Builder.collector()Returns aCollectorwhich may be used in conjunction withStream.collect(Collector)to obtain aHashMultimap.HashMultimap.Builder.collector()Returns aCollectorwhich may be used in conjunction withStream.collect(Collector)to obtain aHashMultimap.static <K,V> Collector <Tuple2<K, V>, 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> Collector <Tuple2<K, V>, 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.LinkedHashMultimap.Builder.collector()Returns aCollectorwhich may be used in conjunction withStream.collect(Collector)to obtain aLinkedHashMultimap.LinkedHashMultimap.Builder.collector()Returns aCollectorwhich may be used in conjunction withStream.collect(Collector)to obtain aLinkedHashMultimap.static <K extends Comparable<? super K>, V>
Collector<Tuple2<K, V>, 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 Comparable<? super K>, V>
Collector<Tuple2<K, V>, ArrayList<Tuple2<K, V>>, TreeMap<K, V>> TreeMap.collector()Returns aCollectorwhich may be used in conjunction withStream.collect(Collector)to obtain aTreeMap.TreeMap.collector(Comparator<? super K> keyComparator) Returns aCollectorwhich may be used in conjunction withStream.collect(Collector)to obtain aTreeMap.TreeMap.collector(Comparator<? super K> keyComparator) Returns aCollectorwhich may be used in conjunction withStream.collect(Collector)to obtain aTreeMap.<K extends Comparable<? super K>, V2 extends V>
Collector<Tuple2<K, V2>, 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 Comparable<? super K>, V2 extends V>
Collector<Tuple2<K, V2>, ArrayList<Tuple2<K, V2>>, TreeMultimap<K, V2>> TreeMultimap.Builder.collector()Returns aCollectorwhich may be used in conjunction withStream.collect(Collector)to obtain aTreeMultimap.TreeMultimap.Builder.collector(Comparator<? super K> keyComparator) Returns aCollectorwhich may be used in conjunction withStream.collect(Collector)to obtain aTreeMultimap.TreeMultimap.Builder.collector(Comparator<? super K> keyComparator) Returns aCollectorwhich may be used in conjunction withStream.collect(Collector)to obtain aTreeMultimap.Seq.crossProduct()Calculates the cross product (, i.e. square) ofthis x this.Seq.crossProduct(Iterable<? extends U> that) Calculates the cross productthis x that.HashMap.iterator()LinkedHashMap.iterator()Map.iterator()Multimap.iterator()TreeMap.iterator()List.pop2Option()Removes the head element from this List.<U> IndexedSeq<Tuple2<Character, U>> <U> IndexedSeq<Tuple2<T, U>> <U> LinkedHashSet<Tuple2<T, U>> <U> PriorityQueue<Tuple2<T, U>> <U> Traversable<Tuple2<T, U>> Returns a traversable formed from this traversable and another Iterable collection by combining corresponding elements in pairs.<U> IndexedSeq<Tuple2<Character, U>> <U> IndexedSeq<Tuple2<T, U>> <U> LinkedHashSet<Tuple2<T, U>> <U> PriorityQueue<Tuple2<T, U>> <U> Traversable<Tuple2<T, U>> Returns a traversable formed from this traversable and another Iterable by combining corresponding elements in pairs.Array.zipWithIndex()BitSet.zipWithIndex()CharSeq.zipWithIndex()HashSet.zipWithIndex()IndexedSeq.zipWithIndex()Iterator.zipWithIndex()LinearSeq.zipWithIndex()LinkedHashSet.zipWithIndex()List.zipWithIndex()Map.zipWithIndex()Map.zipWithIndex()Multimap.zipWithIndex()Multimap.zipWithIndex()PriorityQueue.zipWithIndex()Queue.zipWithIndex()Seq.zipWithIndex()Set.zipWithIndex()SortedSet.zipWithIndex()Stream.zipWithIndex()Traversable.zipWithIndex()Zips this traversable with its indices.Tree.zipWithIndex()TreeSet.zipWithIndex()Vector.zipWithIndex()Methods in io.vavr.collection with parameters of type Tuple2Modifier and TypeMethodDescriptiondefault booleandefault boolean<K, V2 extends V>
HashMultimap<K, V2> Returns a HashMultimap containingntimes the givenelement<K, V2 extends V>
LinkedHashMultimap<K, V2> Returns a LinkedHashMultimap containingntimes the givenelement<K extends Comparable<? super K>, V2 extends V>
TreeMultimap<K, V2> 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(Comparator<? super K> keyComparator, int n, Tuple2<? extends K, ? extends V2> element) Returns a TreeMultimap containingntimes the givenelementstatic <K,V> HashMap <K, V> Returns a singletonHashMap, i.e. aHashMapof one element.<K, V2 extends V>
HashMultimap<K, V2> Creates a HashMultimap of the given key-value pair.static <K,V> LinkedHashMap <K, V> Returns a singletonLinkedHashMap, i.e. aLinkedHashMapof one element.<K, V2 extends V>
LinkedHashMultimap<K, V2> Creates a LinkedHashMultimap of the given key-value pair.static <K extends Comparable<? super K>, V>
TreeMap<K, V> Returns a singletonTreeMap, i.e. aTreeMapof one entry.static <K,V> TreeMap <K, V> TreeMap.of(Comparator<? super K> keyComparator, Tuple2<? extends K, ? extends V> entry) Returns a singletonTreeMap, i.e. aTreeMapof one entry using a specific key comparator.<K extends Comparable<? super K>, V2 extends V>
TreeMultimap<K, V2> Creates a TreeMultimap of the given list of key-value pairs.<K, V2 extends V>
TreeMultimap<K, V2> TreeMultimap.Builder.of(Comparator<? super K> keyComparator, Tuple2<? extends K, ? extends V2> entry) Returns a singletonTreeMultimap, i.e. aTreeMultimapof one entry using a specific key comparator.static <K,V> HashMap <K, V> Creates a HashMap of the given entries.final <K, V2 extends V>
HashMultimap<K, V2> Creates aHashMultimapof the given entries.static <K,V> LinkedHashMap <K, V> Creates a LinkedHashMap of the given entries.final <K, V2 extends V>
LinkedHashMultimap<K, V2> Creates aLinkedHashMultimapof the given entries.static <K extends Comparable<? super K>, V>
TreeMap<K, V> Creates aTreeMapof the given entries using the natural key comparator.static <K,V> TreeMap <K, V> TreeMap.ofEntries(Comparator<? super K> keyComparator, Tuple2<? extends K, ? extends V>... entries) Creates aTreeMapof the given entries using the given key comparator.final <K extends Comparable<? super K>, V2 extends V>
TreeMultimap<K, V2> Creates aTreeMultimapof the given entries.final <K, V2 extends V>
TreeMultimap<K, V2> TreeMultimap.Builder.ofEntries(Comparator<? super K> keyComparator, Tuple2<? extends K, ? extends V2>... entries) Creates aTreeMultimapof the given entries.<U extends V>
LinkedHashMap<K, V> LinkedHashMap.put(Tuple2<? extends K, U> entry, BiFunction<? super V, ? super U, ? extends V> merge) Convenience method forput(entry._1, entry._2).Convenience method forput(entry._1, entry._2, merge).Convenience method forput(entry._1, entry._2).HashMap.scan(Tuple2<K, V> zero, BiFunction<? super Tuple2<K, V>, ? super Tuple2<K, V>, ? extends Tuple2<K, V>> operation) LinkedHashMap.scan(Tuple2<K, V> zero, BiFunction<? super Tuple2<K, V>, ? super Tuple2<K, V>, ? extends Tuple2<K, V>> operation) Map.scan(Tuple2<K, V> zero, BiFunction<? super Tuple2<K, V>, ? super Tuple2<K, V>, ? extends Tuple2<K, V>> operation) Multimap.scan(Tuple2<K, V> zero, BiFunction<? super Tuple2<K, V>, ? super Tuple2<K, V>, ? extends Tuple2<K, V>> operation) SortedMap.scan(Tuple2<K, V> zero, BiFunction<? super Tuple2<K, V>, ? super Tuple2<K, V>, ? extends Tuple2<K, V>> operation) SortedMultimap.scan(Tuple2<K, V> zero, BiFunction<? super Tuple2<K, V>, ? super Tuple2<K, V>, ? extends Tuple2<K, V>> operation) TreeMap.scan(Tuple2<K, V> zero, BiFunction<? super Tuple2<K, V>, ? super Tuple2<K, V>, ? extends Tuple2<K, V>> operation) Method parameters in io.vavr.collection with type arguments of type Tuple2Modifier and TypeMethodDescriptiondefault <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) HashMap.distinctBy(Comparator<? super Tuple2<K, V>> comparator) HashMap.distinctBy(Function<? super Tuple2<K, V>, ? extends U> keyExtractor) LinkedHashMap.distinctBy(Comparator<? super Tuple2<K, V>> comparator) <U> LinkedHashMap<K, V> LinkedHashMap.distinctBy(Function<? super Tuple2<K, V>, ? extends U> keyExtractor) Map.distinctBy(Comparator<? super Tuple2<K, V>> comparator) Map.distinctBy(Function<? super Tuple2<K, V>, ? extends U> keyExtractor) Multimap.distinctBy(Comparator<? super Tuple2<K, V>> comparator) Multimap.distinctBy(Function<? super Tuple2<K, V>, ? extends U> keyExtractor) SortedMap.distinctBy(Comparator<? super Tuple2<K, V>> comparator) SortedMap.distinctBy(Function<? super Tuple2<K, V>, ? extends U> keyExtractor) SortedMultimap.distinctBy(Comparator<? super Tuple2<K, V>> comparator) <U> SortedMultimap<K, V> SortedMultimap.distinctBy(Function<? super Tuple2<K, V>, ? extends U> keyExtractor) TreeMap.distinctBy(Comparator<? super Tuple2<K, V>> comparator) TreeMap.distinctBy(Function<? super Tuple2<K, V>, ? extends U> keyExtractor) static <K,V> HashMap <K, V> Returns a HashMap containing tuples returned byncalls to a given Suppliers.<K, V2 extends V>
HashMultimap<K, V2> Returns a HashMultimap containingnvalues supplied by a given Suppliers.static <K,V> LinkedHashMap <K, V> Returns a LinkedHashMap containing tuples returned byncalls to a given Suppliers.<K, V2 extends V>
LinkedHashMultimap<K, V2> Returns a LinkedHashMultimap containingnvalues supplied by a given Suppliers.static <K extends Comparable<? super K>, V>
TreeMap<K, V> Returns a TreeMap containing tuples returned byncalls to a given Suppliers.static <K,V> TreeMap <K, V> TreeMap.fill(Comparator<? super K> keyComparator, int n, Supplier<? extends Tuple2<? extends K, ? extends V>> s) Returns a TreeMap containing tuples returned byncalls to a given Suppliers.<K extends Comparable<? super K>, V2 extends V>
TreeMultimap<K, V2> Returns a TreeMultimap containingnvalues supplied by a given Suppliers.<K, V2 extends V>
TreeMultimap<K, V2> TreeMultimap.Builder.fill(Comparator<? super K> keyComparator, int n, Supplier<? extends Tuple2<? extends K, ? extends V2>> s) Returns a TreeMultimap containingnvalues supplied by a given Suppliers.<K2,V2> HashMap <K2, V2> <K2,V2> LinkedHashMap <K2, V2> <K2,V2> Map <K2, V2> FlatMaps thisMapto a newMapwith different component type.default <U> Seq<U> Flat-maps this entries to a sequence of values.<K2,V2> Multimap <K2, V2> FlatMaps thisMultimapto a newMultimapwith different component type.default <U> Seq<U> Flat-maps this entries to a sequence of values.<K2,V2> SortedMap <K2, V2> SortedMap.flatMap(Comparator<? super K2> keyComparator, BiFunction<? super K, ? super V, ? extends 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> <K2,V2> TreeMap <K2, V2> TreeMap.flatMap(Comparator<? super K2> keyComparator, BiFunction<? super K, ? super V, ? extends Iterable<Tuple2<K2, V2>>> mapper) <K2,V2> TreeMap <K2, V2> default <U> UMap.foldRight(U zero, BiFunction<? super Tuple2<K, V>, ? super U, ? extends U> f) default <U> UMultimap.foldRight(U zero, BiFunction<? super Tuple2<K, V>, ? super U, ? extends U> f) <C> Map<C, LinkedHashMap<K, V>> <C> Map<C, ? extends SortedMultimap<K, V>> <K2,V2> HashMap <K2, V2> HashMap.map(BiFunction<? super K, ? super V, Tuple2<K2, V2>> mapper) <K2,V2> LinkedHashMap <K2, V2> LinkedHashMap.map(BiFunction<? super K, ? super V, Tuple2<K2, V2>> mapper) <K2,V2> Map <K2, V2> Map.map(BiFunction<? super K, ? super V, Tuple2<K2, V2>> mapper) Maps the entries of thisMapto form a newMap.default <U> Seq<U> Maps theMapentries to a sequence of values.<K2,V2> Multimap <K2, V2> Multimap.map(BiFunction<? super K, ? super V, Tuple2<K2, V2>> mapper) Maps the entries of thisMultimapto form a newMultimap.default <U> Seq<U> Maps theMultimapentries to a sequence of values.<K2,V2> SortedMap <K2, V2> SortedMap.map(Comparator<? super K2> keyComparator, 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(BiFunction<? super K, ? super V, Tuple2<K2, V2>> mapper) <K2,V2> TreeMap <K2, V2> TreeMap.map(Comparator<? super K2> keyComparator, BiFunction<? super K, ? super V, Tuple2<K2, V2>> mapper) <K2,V2> TreeMap <K2, V2> TreeMap.map(BiFunction<? super K, ? super V, Tuple2<K2, V2>> mapper) static <T,K, V> HashMap <K, V> HashMap.ofAll(Stream<? extends T> stream, 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(Stream<? extends T> stream, 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(Stream<? extends T> stream, 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(Stream<? extends T> stream, 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(Comparator<? super K> keyComparator, Stream<? extends T> stream, Function<? super T, Tuple2<? extends K, ? extends V>> entryMapper) Returns aTreeMap, from entries mapped from stream.static <T, K extends Comparable<? super K>, V>
TreeMap<K, V> TreeMap.ofAll(Stream<? extends T> stream, 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(Comparator<? super K> keyComparator, Stream<? extends T> stream, Function<? super T, Tuple2<? extends K, ? extends V2>> entryMapper) Returns aTreeMultimap, from entries mapped from stream.<T, K extends Comparable<? super K>, V2 extends V>
TreeMultimap<K, V2> TreeMultimap.Builder.ofAll(Stream<? extends T> stream, Function<? super T, Tuple2<? extends K, ? extends V2>> entryMapper) Returns aTreeMultimap, from entries mapped from stream.static <K,V> HashMap <K, V> Creates a HashMap of the given entries.<K, V2 extends V>
HashMultimap<K, V2> Creates aHashMultimapof the given entries.static <K,V> LinkedHashMap <K, V> Creates a LinkedHashMap of the given entries.<K, V2 extends V>
LinkedHashMultimap<K, V2> Creates aLinkedHashMultimapof the given entries.static <K extends Comparable<? super K>, V>
TreeMap<K, V> Creates aTreeMapof the given entries.static <K,V> TreeMap <K, V> TreeMap.ofEntries(Comparator<? super K> keyComparator, Iterable<? extends Tuple2<? extends K, ? extends V>> entries) Creates aTreeMapof the given entries.<K extends Comparable<? super K>, V2 extends V>
TreeMultimap<K, V2> Creates aTreeMultimapof the given entries.<K, V2 extends V>
TreeMultimap<K, V2> TreeMultimap.Builder.ofEntries(Comparator<? super K> keyComparator, Iterable<? extends Tuple2<? extends K, ? extends V2>> entries) Creates aTreeMultimapof the given entries.Returns thisTreeMapif it is nonempty, otherwiseTreeMapcreated from iterable, using existing comparator.Returns thisTreeMapif it is nonempty, otherwiseTreeMapcreated from result of evaluating supplier, using existing comparator.Tuple2<LinkedHashMap<K, V>, LinkedHashMap<K, V>> Tuple2<? extends SortedMultimap<K, V>, ? extends SortedMultimap<K, V>> HashMap.scan(Tuple2<K, V> zero, BiFunction<? super Tuple2<K, V>, ? super Tuple2<K, V>, ? extends Tuple2<K, V>> operation) HashMap.scan(Tuple2<K, V> zero, BiFunction<? super Tuple2<K, V>, ? super Tuple2<K, V>, ? extends Tuple2<K, V>> operation) HashMap.scan(Tuple2<K, V> zero, BiFunction<? super Tuple2<K, V>, ? super Tuple2<K, V>, ? extends Tuple2<K, V>> operation) LinkedHashMap.scan(Tuple2<K, V> zero, BiFunction<? super Tuple2<K, V>, ? super Tuple2<K, V>, ? extends Tuple2<K, V>> operation) LinkedHashMap.scan(Tuple2<K, V> zero, BiFunction<? super Tuple2<K, V>, ? super Tuple2<K, V>, ? extends Tuple2<K, V>> operation) LinkedHashMap.scan(Tuple2<K, V> zero, BiFunction<? super Tuple2<K, V>, ? super Tuple2<K, V>, ? extends Tuple2<K, V>> operation) Map.scan(Tuple2<K, V> zero, BiFunction<? super Tuple2<K, V>, ? super Tuple2<K, V>, ? extends Tuple2<K, V>> operation) Map.scan(Tuple2<K, V> zero, BiFunction<? super Tuple2<K, V>, ? super Tuple2<K, V>, ? extends Tuple2<K, V>> operation) Map.scan(Tuple2<K, V> zero, BiFunction<? super Tuple2<K, V>, ? super Tuple2<K, V>, ? extends Tuple2<K, V>> operation) Multimap.scan(Tuple2<K, V> zero, BiFunction<? super Tuple2<K, V>, ? super Tuple2<K, V>, ? extends Tuple2<K, V>> operation) Multimap.scan(Tuple2<K, V> zero, BiFunction<? super Tuple2<K, V>, ? super Tuple2<K, V>, ? extends Tuple2<K, V>> operation) Multimap.scan(Tuple2<K, V> zero, BiFunction<? super Tuple2<K, V>, ? super Tuple2<K, V>, ? extends Tuple2<K, V>> operation) SortedMap.scan(Tuple2<K, V> zero, BiFunction<? super Tuple2<K, V>, ? super Tuple2<K, V>, ? extends Tuple2<K, V>> operation) SortedMap.scan(Tuple2<K, V> zero, BiFunction<? super Tuple2<K, V>, ? super Tuple2<K, V>, ? extends Tuple2<K, V>> operation) SortedMap.scan(Tuple2<K, V> zero, BiFunction<? super Tuple2<K, V>, ? super Tuple2<K, V>, ? extends Tuple2<K, V>> operation) SortedMultimap.scan(Tuple2<K, V> zero, BiFunction<? super Tuple2<K, V>, ? super Tuple2<K, V>, ? extends Tuple2<K, V>> operation) SortedMultimap.scan(Tuple2<K, V> zero, BiFunction<? super Tuple2<K, V>, ? super Tuple2<K, V>, ? extends Tuple2<K, V>> operation) SortedMultimap.scan(Tuple2<K, V> zero, BiFunction<? super Tuple2<K, V>, ? super Tuple2<K, V>, ? extends Tuple2<K, V>> operation) TreeMap.scan(Tuple2<K, V> zero, BiFunction<? super Tuple2<K, V>, ? super Tuple2<K, V>, ? extends Tuple2<K, V>> operation) TreeMap.scan(Tuple2<K, V> zero, BiFunction<? super Tuple2<K, V>, ? super Tuple2<K, V>, ? extends Tuple2<K, V>> operation) TreeMap.scan(Tuple2<K, V> zero, BiFunction<? super Tuple2<K, V>, ? super Tuple2<K, V>, ? extends Tuple2<K, V>> operation) default <U> Seq<U> Map.scanLeft(U zero, BiFunction<? super U, ? super Tuple2<K, V>, ? extends U> operation) default <U> Seq<U> Multimap.scanLeft(U zero, BiFunction<? super U, ? super Tuple2<K, V>, ? extends U> operation) default <U> Seq<U> Map.scanRight(U zero, BiFunction<? super Tuple2<K, V>, ? super U, ? extends U> operation) default <U> Seq<U> Multimap.scanRight(U zero, BiFunction<? super Tuple2<K, V>, ? super U, ? extends U> operation) Iterator<? extends SortedMultimap<K, V>> Tuple2<LinkedHashMap<K, V>, LinkedHashMap<K, V>> Tuple2<? extends SortedMultimap<K, V>, ? extends SortedMultimap<K, V>> static <K,V> HashMap <K, V> 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, Function<? super 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, Function<? super 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, Function<? super 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 Comparable<? super K>, V>
TreeMap<K, V> 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(Comparator<? super K> keyComparator, int n, Function<? super 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 Comparable<? super K>, V2 extends V>
TreeMultimap<K, V2> TreeMultimap.Builder.tabulate(int n, Function<? super 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(Comparator<? super K> keyComparator, int n, Function<? super 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.static <T> Array<T> Creates an Array from a seed value and a function.static CharSeqCharSeq.unfold(Character seed, Function<? super Character, Option<Tuple2<? extends Character, ? extends Character>>> f) Creates a CharSeq from a seed value and a function.static <T> Iterator<T> Creates an iterator from a seed value and a function.static <T> List<T> Creates a list from a seed value and a function.static <T> Queue<T> Creates a Queue from a seed value and a function.static <T> Stream<T> Creates a Stream from a seed value and a function.static <T> Vector<T> Creates a Vector from a seed value and a function.static <T,U> Array <U> Array.unfoldLeft(T seed, 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, Function<? super T, Option<Tuple2<? extends T, ? extends Character>>> f) Creates a CharSeq from a seed value and a function.static <T,U> Iterator <U> Iterator.unfoldLeft(T seed, 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, 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, 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, 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, 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, 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, Function<? super T, Option<Tuple2<? extends Character, ? extends T>>> f) Creates a CharSeq from a seed value and a function.static <T,U> Iterator <U> Iterator.unfoldRight(T seed, 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, 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, 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, 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, Function<? super T, Option<Tuple2<? extends U, ? extends T>>> f) Creates a Vector from a seed value and a function.<T1,T2> Tuple2 <IndexedSeq<T1>, IndexedSeq<T2>> <T1,T2> Tuple2 <? extends IndexedSeq<T1>, ? extends IndexedSeq<T2>> <T1,T2> Tuple2 <LinkedHashSet<T1>, LinkedHashSet<T2>> Map.unzip(BiFunction<? super K, ? super V, Tuple2<? extends T1, ? extends T2>> unzipper) Multimap.unzip(BiFunction<? super K, ? super V, Tuple2<? extends T1, ? extends T2>> unzipper) <T1,T2> Tuple2 <? extends PriorityQueue<T1>, ? extends PriorityQueue<T2>> <T1,T2> Tuple2 <? extends Traversable<T1>, ? extends Traversable<T2>> Unzips this elements by mapping this elements to pairs which are subsequently split into two distinct sets.Map.unzip3(Function<? super Tuple2<K, V>, Tuple3<? extends T1, ? extends T2, ? extends T3>> unzipper) Multimap.unzip3(Function<? super Tuple2<K, V>, Tuple3<? extends T1, ? extends T2, ? extends T3>> unzipper) default <U,R> Seq <R> Map.zipWith(Iterable<? extends U> that, BiFunction<? super Tuple2<K, V>, ? super U, ? extends R> mapper) default <U,R> Seq <R> Multimap.zipWith(Iterable<? extends U> that, BiFunction<? super Tuple2<K, V>, ? super U, ? extends R> mapper) default <U> Seq<U> Map.zipWithIndex(BiFunction<? super Tuple2<K, V>, ? super Integer, ? extends U> mapper) default <U> Seq<U> Multimap.zipWithIndex(BiFunction<? super Tuple2<K, V>, ? super Integer, ? extends U> mapper) -
Uses of Tuple2 in io.vavr.concurrent
Methods in io.vavr.concurrent that return types with arguments of type Tuple2 -
Uses of Tuple2 in io.vavr.test
Methods in io.vavr.test with parameters of type Tuple2Modifier and TypeMethodDescriptionstatic <T> Gen<T> Chooses one of the given generators according to their frequency.Method parameters in io.vavr.test with type arguments of type Tuple2