Package | Description |
---|---|
javaslang | |
javaslang.collection |
Purely functional collections based on Traversable.
|
javaslang.concurrent |
This package contains basic building blocks creating fast, asynchronous, non-blocking parallel code.
|
Modifier and Type | Method and Description |
---|---|
<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> |
Tuple2.map(Function<? super T1,? extends U1> f1,
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(Function<? super T1,? extends U> mapper)
Maps the 1st component of this tuple to a new value.
|
<U> Tuple2<T1,U> |
Tuple2.map2(Function<? super T2,? extends U> mapper)
Maps the 2nd component of this tuple to a new value.
|
static <T1,T2> Tuple2<T1,T2> |
Tuple.of(T1 t1,
T2 t2)
Creates a tuple of two elements.
|
Modifier and Type | Method and Description |
---|---|
static <T1,T2> Comparator<Tuple2<T1,T2>> |
Tuple2.comparator(Comparator<? super T1> t1Comp,
Comparator<? super T2> t2Comp) |
static <T1,T2,_1 extends T1,_2 extends T2> |
Patterns.Tuple2(API.Match.Pattern<_1,?> p1,
API.Match.Pattern<_2,?> p2) |
default Function1<Tuple2<T1,T2>,R> |
Function2.tupled() |
default CheckedFunction1<Tuple2<T1,T2>,R> |
CheckedFunction2.tupled() |
Modifier and Type | Method and Description |
---|---|
int |
Tuple2.compareTo(Tuple2<T1,T2> that) |
Modifier and Type | Method and Description |
---|---|
<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.of(Class<? super T> type,
API.Match.Pattern<T1,?> p1,
API.Match.Pattern<T2,?> p2,
Function<T,Tuple2<U1,U2>> unapply) |
default <K,V> Map<K,V> |
Value.toJavaMap(Function<? super T,? extends Tuple2<? extends K,? extends V>> f)
Converts this to a
Map . |
default <K,V,MAP extends Map<K,V>> |
Value.toJavaMap(Supplier<MAP> factory,
Function<? super T,? extends Tuple2<? extends K,? extends V>> f)
Converts this to a specific
Map . |
default <K,V> Map<K,V> |
Value.toMap(Function<? super T,? extends Tuple2<? extends K,? extends V>> f)
Converts this to a
Map . |
Modifier and Type | Method and Description |
---|---|
Tuple2<T,Queue<T>> |
Queue.dequeue()
Removes an element from this Queue.
|
Tuple2<K,V> |
TreeMap.head() |
Tuple2<K,V> |
LinkedHashMap.head() |
Tuple2<K,V> |
HashMap.head() |
default Tuple2<K,V> |
SortedMap.last() |
Tuple2<CharSeq,CharSeq> |
CharSeq.partition(Predicate<? super Character> predicate) |
Tuple2<Vector<T>,Vector<T>> |
Vector.partition(Predicate<? super T> predicate) |
Tuple2<TreeSet<T>,TreeSet<T>> |
TreeSet.partition(Predicate<? super T> predicate) |
default Tuple2<Seq<T>,Seq<T>> |
Tree.partition(Predicate<? super T> predicate) |
Tuple2<? extends Traversable<T>,? extends Traversable<T>> |
Traversable.partition(Predicate<? super T> predicate)
Creates a partition of this
Traversable by splitting this elements in two in distinct tarversables
according to a predicate. |
default Tuple2<Stream<T>,Stream<T>> |
Stream.partition(Predicate<? super T> predicate) |
Tuple2<? extends SortedSet<T>,? extends SortedSet<T>> |
SortedSet.partition(Predicate<? super T> predicate) |
Tuple2<? extends Set<T>,? extends Set<T>> |
Set.partition(Predicate<? super T> predicate) |
Tuple2<? extends Seq<T>,? extends Seq<T>> |
Seq.partition(Predicate<? super T> predicate) |
Tuple2<Queue<T>,Queue<T>> |
Queue.partition(Predicate<? super T> predicate) |
default Tuple2<List<T>,List<T>> |
List.partition(Predicate<? super T> predicate) |
Tuple2<LinkedHashSet<T>,LinkedHashSet<T>> |
LinkedHashSet.partition(Predicate<? super T> predicate) |
Tuple2<? extends LinearSeq<T>,? extends LinearSeq<T>> |
LinearSeq.partition(Predicate<? super T> predicate) |
default Tuple2<Iterator<T>,Iterator<T>> |
Iterator.partition(Predicate<? super T> predicate) |
Tuple2<? extends IndexedSeq<T>,? extends IndexedSeq<T>> |
IndexedSeq.partition(Predicate<? super T> predicate) |
Tuple2<HashSet<T>,HashSet<T>> |
HashSet.partition(Predicate<? super T> predicate) |
Tuple2<Array<T>,Array<T>> |
Array.partition(Predicate<? super T> predicate) |
Tuple2<? extends SortedMap<K,V>,? extends SortedMap<K,V>> |
SortedMap.partition(Predicate<? super Tuple2<K,V>> predicate) |
Tuple2<? extends Map<K,V>,? extends Map<K,V>> |
Map.partition(Predicate<? super Tuple2<K,V>> predicate) |
Tuple2<T,? extends Stack<T>> |
Stack.pop2()
Removes the head element from this Stack.
|
default Tuple2<T,List<T>> |
List.pop2() |
Tuple2<CharSeq,CharSeq> |
CharSeq.span(Predicate<? super Character> predicate) |
Tuple2<Vector<T>,Vector<T>> |
Vector.span(Predicate<? super T> predicate) |
Tuple2<TreeSet<T>,TreeSet<T>> |
TreeSet.span(Predicate<? super T> predicate) |
default Tuple2<Seq<T>,Seq<T>> |
Tree.span(Predicate<? super T> predicate) |
Tuple2<? extends Traversable<T>,? extends Traversable<T>> |
Traversable.span(Predicate<? super T> predicate)
Returns a tuple where the first element is the longest prefix of elements that satisfy the given
predicate and the second element is the remainder. |
default Tuple2<Stream<T>,Stream<T>> |
Stream.span(Predicate<? super T> predicate) |
Tuple2<? extends SortedSet<T>,? extends SortedSet<T>> |
SortedSet.span(Predicate<? super T> predicate) |
Tuple2<? extends Set<T>,? extends Set<T>> |
Set.span(Predicate<? super T> predicate) |
Tuple2<? extends Seq<T>,? extends Seq<T>> |
Seq.span(Predicate<? super T> predicate) |
Tuple2<Queue<T>,Queue<T>> |
Queue.span(Predicate<? super T> predicate) |
default Tuple2<List<T>,List<T>> |
List.span(Predicate<? super T> predicate) |
Tuple2<LinkedHashSet<T>,LinkedHashSet<T>> |
LinkedHashSet.span(Predicate<? super T> predicate) |
Tuple2<? extends LinearSeq<T>,? extends LinearSeq<T>> |
LinearSeq.span(Predicate<? super T> predicate) |
default Tuple2<Iterator<T>,Iterator<T>> |
Iterator.span(Predicate<? super T> predicate) |
Tuple2<? extends IndexedSeq<T>,? extends IndexedSeq<T>> |
IndexedSeq.span(Predicate<? super T> predicate) |
Tuple2<HashSet<T>,HashSet<T>> |
HashSet.span(Predicate<? super T> predicate) |
Tuple2<Array<T>,Array<T>> |
Array.span(Predicate<? super T> predicate) |
Tuple2<? extends SortedMap<K,V>,? extends SortedMap<K,V>> |
SortedMap.span(Predicate<? super Tuple2<K,V>> predicate) |
Tuple2<? extends Map<K,V>,? extends Map<K,V>> |
Map.span(Predicate<? super Tuple2<K,V>> predicate) |
Tuple2<Vector<T>,Vector<T>> |
Vector.splitAt(long n) |
default Tuple2<Stream<T>,Stream<T>> |
Stream.splitAt(long n) |
Tuple2<? extends Seq<T>,? extends Seq<T>> |
Seq.splitAt(long n)
Splits a Seq at the specified index.
|
Tuple2<Queue<T>,Queue<T>> |
Queue.splitAt(long n) |
default Tuple2<List<T>,List<T>> |
List.splitAt(long n) |
Tuple2<CharSeq,CharSeq> |
CharSeq.splitAt(long n) |
Tuple2<Array<T>,Array<T>> |
Array.splitAt(long n) |
Tuple2<CharSeq,CharSeq> |
CharSeq.splitAt(Predicate<? super Character> predicate) |
Tuple2<Vector<T>,Vector<T>> |
Vector.splitAt(Predicate<? super T> predicate) |
default Tuple2<Stream<T>,Stream<T>> |
Stream.splitAt(Predicate<? super T> predicate) |
Tuple2<? extends Seq<T>,? extends Seq<T>> |
Seq.splitAt(Predicate<? super T> predicate)
Splits a sequence at the first element which satisfies the
Predicate , e.g. |
Tuple2<Queue<T>,Queue<T>> |
Queue.splitAt(Predicate<? super T> predicate) |
default Tuple2<List<T>,List<T>> |
List.splitAt(Predicate<? super T> predicate) |
Tuple2<Array<T>,Array<T>> |
Array.splitAt(Predicate<? super T> predicate) |
Tuple2<CharSeq,CharSeq> |
CharSeq.splitAtInclusive(Predicate<? super Character> predicate) |
Tuple2<Vector<T>,Vector<T>> |
Vector.splitAtInclusive(Predicate<? super T> predicate) |
default Tuple2<Stream<T>,Stream<T>> |
Stream.splitAtInclusive(Predicate<? super T> predicate) |
Tuple2<? extends Seq<T>,? extends Seq<T>> |
Seq.splitAtInclusive(Predicate<? super T> predicate)
Splits a sequence at the first element which satisfies the
Predicate , e.g. |
Tuple2<Queue<T>,Queue<T>> |
Queue.splitAtInclusive(Predicate<? super T> predicate) |
default Tuple2<List<T>,List<T>> |
List.splitAtInclusive(Predicate<? super T> predicate) |
Tuple2<Array<T>,Array<T>> |
Array.splitAtInclusive(Predicate<? super T> predicate) |
default <T1,T2> Tuple2<Seq<T1>,Seq<T2>> |
Map.unzip(BiFunction<? super K,? super V,Tuple2<? extends T1,? extends T2>> unzipper) |
<T1,T2> Tuple2<IndexedSeq<T1>,IndexedSeq<T2>> |
CharSeq.unzip(Function<? super Character,Tuple2<? extends T1,? extends T2>> unzipper) |
<T1,T2> Tuple2<Vector<T1>,Vector<T2>> |
Vector.unzip(Function<? super T,Tuple2<? extends T1,? extends T2>> unzipper) |
<T1,T2> Tuple2<TreeSet<T1>,TreeSet<T2>> |
TreeSet.unzip(Function<? super T,Tuple2<? extends T1,? extends T2>> unzipper) |
default <T1,T2> Tuple2<Tree<T1>,Tree<T2>> |
Tree.unzip(Function<? super T,Tuple2<? extends T1,? extends T2>> unzipper) |
<T1,T2> Tuple2<? extends Traversable<T1>,? extends Traversable<T2>> |
Traversable.unzip(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<Stream<T1>,Stream<T2>> |
Stream.unzip(Function<? super T,Tuple2<? extends T1,? extends T2>> unzipper) |
<T1,T2> Tuple2<? extends SortedSet<T1>,? extends SortedSet<T2>> |
SortedSet.unzip(Function<? super T,Tuple2<? extends T1,? extends T2>> unzipper) |
<T1,T2> Tuple2<? extends Set<T1>,? extends Set<T2>> |
Set.unzip(Function<? super T,Tuple2<? extends T1,? extends T2>> unzipper) |
<T1,T2> Tuple2<? extends Seq<T1>,? extends Seq<T2>> |
Seq.unzip(Function<? super T,Tuple2<? extends T1,? extends T2>> unzipper) |
<T1,T2> Tuple2<Queue<T1>,Queue<T2>> |
Queue.unzip(Function<? super T,Tuple2<? extends T1,? extends T2>> unzipper) |
default <T1,T2> Tuple2<List<T1>,List<T2>> |
List.unzip(Function<? super T,Tuple2<? extends T1,? extends T2>> unzipper) |
<T1,T2> Tuple2<LinkedHashSet<T1>,LinkedHashSet<T2>> |
LinkedHashSet.unzip(Function<? super T,Tuple2<? extends T1,? extends T2>> unzipper) |
<T1,T2> Tuple2<? extends LinearSeq<T1>,? extends LinearSeq<T2>> |
LinearSeq.unzip(Function<? super T,Tuple2<? extends T1,? extends T2>> unzipper) |
default <T1,T2> Tuple2<Iterator<T1>,Iterator<T2>> |
Iterator.unzip(Function<? super T,Tuple2<? extends T1,? extends T2>> unzipper) |
<T1,T2> Tuple2<? extends IndexedSeq<T1>,? extends IndexedSeq<T2>> |
IndexedSeq.unzip(Function<? super T,Tuple2<? extends T1,? extends T2>> unzipper) |
<T1,T2> Tuple2<HashSet<T1>,HashSet<T2>> |
HashSet.unzip(Function<? super T,Tuple2<? extends T1,? extends T2>> unzipper) |
<T1,T2> Tuple2<Array<T1>,Array<T2>> |
Array.unzip(Function<? super T,Tuple2<? extends T1,? extends T2>> unzipper) |
default <T1,T2> Tuple2<Seq<T1>,Seq<T2>> |
Map.unzip(Function<? super Tuple2<K,V>,Tuple2<? extends T1,? extends T2>> unzipper) |
Modifier and Type | Method and Description |
---|---|
static <K,V> Collector<Tuple2<K,V>,ArrayList<Tuple2<K,V>>,TreeMap<K,V>> |
TreeMap.collector()
Returns a
Collector which may be used in conjunction with
Stream.collect(java.util.stream.Collector) to obtain a
TreeMap . |
static <K,V> Collector<Tuple2<K,V>,ArrayList<Tuple2<K,V>>,TreeMap<K,V>> |
TreeMap.collector()
Returns a
Collector which may be used in conjunction with
Stream.collect(java.util.stream.Collector) to obtain a
TreeMap . |
static <K,V> Collector<Tuple2<K,V>,ArrayList<Tuple2<K,V>>,LinkedHashMap<K,V>> |
LinkedHashMap.collector()
Returns a
Collector which may be used in conjunction with
Stream.collect(java.util.stream.Collector) to obtain a LinkedHashMap . |
static <K,V> Collector<Tuple2<K,V>,ArrayList<Tuple2<K,V>>,LinkedHashMap<K,V>> |
LinkedHashMap.collector()
Returns a
Collector which may be used in conjunction with
Stream.collect(java.util.stream.Collector) to obtain a LinkedHashMap . |
static <K,V> Collector<Tuple2<K,V>,ArrayList<Tuple2<K,V>>,HashMap<K,V>> |
HashMap.collector()
Returns a
Collector which may be used in conjunction with
Stream.collect(java.util.stream.Collector) to obtain a HashMap . |
static <K,V> Collector<Tuple2<K,V>,ArrayList<Tuple2<K,V>>,HashMap<K,V>> |
HashMap.collector()
Returns a
Collector which may be used in conjunction with
Stream.collect(java.util.stream.Collector) to obtain a HashMap . |
default Iterator<Tuple2<T,T>> |
Seq.crossProduct()
Calculates the cross product (, i.e.
|
default <U> Iterator<Tuple2<T,U>> |
Seq.crossProduct(Iterable<? extends U> that)
Calculates the cross product
this x that . |
Option<Tuple2<T,Queue<T>>> |
Queue.dequeueOption()
Removes an element from this Queue.
|
default Option<Tuple2<K,V>> |
Map.headOption() |
Iterator<Tuple2<K,V>> |
TreeMap.iterator() |
Iterator<Tuple2<K,V>> |
Map.iterator() |
Iterator<Tuple2<K,V>> |
LinkedHashMap.iterator() |
Iterator<Tuple2<K,V>> |
HashMap.iterator() |
Option<? extends Tuple2<T,? extends Stack<T>>> |
Stack.pop2Option()
Removes the head element from this Stack.
|
default Option<Tuple2<T,List<T>>> |
List.pop2Option() |
default Spliterator<Tuple2<K,V>> |
Map.spliterator() |
<U> Vector<Tuple2<T,U>> |
Vector.zip(Iterable<U> that) |
<U> TreeSet<Tuple2<T,U>> |
TreeSet.zip(Iterable<U> that) |
default <U> Tree<Tuple2<T,U>> |
Tree.zip(Iterable<U> that) |
<U> Traversable<Tuple2<T,U>> |
Traversable.zip(Iterable<U> that)
Returns a traversable formed from this traversable and another Iterable collection by combining
corresponding elements in pairs.
|
default <U> Stream<Tuple2<T,U>> |
Stream.zip(Iterable<U> iterable) |
<U> SortedSet<Tuple2<T,U>> |
SortedSet.zip(Iterable<U> that) |
<U> Set<Tuple2<T,U>> |
Set.zip(Iterable<U> that) |
<U> Seq<Tuple2<T,U>> |
Seq.zip(Iterable<U> that) |
<U> Queue<Tuple2<T,U>> |
Queue.zip(Iterable<U> that) |
default <U> Seq<Tuple2<Tuple2<K,V>,U>> |
Map.zip(Iterable<U> that) |
default <U> Seq<Tuple2<Tuple2<K,V>,U>> |
Map.zip(Iterable<U> that) |
default <U> List<Tuple2<T,U>> |
List.zip(Iterable<U> that) |
<U> LinkedHashSet<Tuple2<T,U>> |
LinkedHashSet.zip(Iterable<U> that) |
<U> LinearSeq<Tuple2<T,U>> |
LinearSeq.zip(Iterable<U> that) |
default <U> Iterator<Tuple2<T,U>> |
Iterator.zip(Iterable<U> that) |
<U> IndexedSeq<Tuple2<T,U>> |
IndexedSeq.zip(Iterable<U> that) |
<U> HashSet<Tuple2<T,U>> |
HashSet.zip(Iterable<U> that) |
<U> IndexedSeq<Tuple2<Character,U>> |
CharSeq.zip(Iterable<U> that) |
<U> Array<Tuple2<T,U>> |
Array.zip(Iterable<U> that) |
<U> IndexedSeq<Tuple2<Character,U>> |
CharSeq.zipAll(Iterable<U> that,
Character thisElem,
U thatElem) |
<U> Vector<Tuple2<T,U>> |
Vector.zipAll(Iterable<U> that,
T thisElem,
U thatElem) |
<U> TreeSet<Tuple2<T,U>> |
TreeSet.zipAll(Iterable<U> that,
T thisElem,
U thatElem) |
default <U> Tree<Tuple2<T,U>> |
Tree.zipAll(Iterable<U> that,
T thisElem,
U thatElem) |
<U> Traversable<Tuple2<T,U>> |
Traversable.zipAll(Iterable<U> that,
T thisElem,
U thatElem)
Returns a traversable formed from this traversable and another Iterable by combining corresponding elements in
pairs.
|
default <U> Stream<Tuple2<T,U>> |
Stream.zipAll(Iterable<U> iterable,
T thisElem,
U thatElem) |
<U> SortedSet<Tuple2<T,U>> |
SortedSet.zipAll(Iterable<U> that,
T thisElem,
U thatElem) |
<U> Set<Tuple2<T,U>> |
Set.zipAll(Iterable<U> that,
T thisElem,
U thatElem) |
<U> Seq<Tuple2<T,U>> |
Seq.zipAll(Iterable<U> that,
T thisElem,
U thatElem) |
<U> Queue<Tuple2<T,U>> |
Queue.zipAll(Iterable<U> that,
T thisElem,
U thatElem) |
default <U> List<Tuple2<T,U>> |
List.zipAll(Iterable<U> that,
T thisElem,
U thatElem) |
<U> LinkedHashSet<Tuple2<T,U>> |
LinkedHashSet.zipAll(Iterable<U> that,
T thisElem,
U thatElem) |
<U> LinearSeq<Tuple2<T,U>> |
LinearSeq.zipAll(Iterable<U> that,
T thisElem,
U thatElem) |
default <U> Iterator<Tuple2<T,U>> |
Iterator.zipAll(Iterable<U> that,
T thisElem,
U thatElem) |
<U> IndexedSeq<Tuple2<T,U>> |
IndexedSeq.zipAll(Iterable<U> that,
T thisElem,
U thatElem) |
<U> HashSet<Tuple2<T,U>> |
HashSet.zipAll(Iterable<U> that,
T thisElem,
U thatElem) |
<U> Array<Tuple2<T,U>> |
Array.zipAll(Iterable<U> that,
T thisElem,
U thatElem) |
default <U> Seq<Tuple2<Tuple2<K,V>,U>> |
Map.zipAll(Iterable<U> that,
Tuple2<K,V> thisElem,
U thatElem) |
default <U> Seq<Tuple2<Tuple2<K,V>,U>> |
Map.zipAll(Iterable<U> that,
Tuple2<K,V> thisElem,
U thatElem) |
Vector<Tuple2<T,Long>> |
Vector.zipWithIndex() |
TreeSet<Tuple2<T,Long>> |
TreeSet.zipWithIndex() |
default Tree<Tuple2<T,Long>> |
Tree.zipWithIndex() |
Traversable<Tuple2<T,Long>> |
Traversable.zipWithIndex()
Zips this traversable with its indices.
|
default Stream<Tuple2<T,Long>> |
Stream.zipWithIndex() |
SortedSet<Tuple2<T,Long>> |
SortedSet.zipWithIndex() |
Set<Tuple2<T,Long>> |
Set.zipWithIndex() |
Seq<Tuple2<T,Long>> |
Seq.zipWithIndex() |
Queue<Tuple2<T,Long>> |
Queue.zipWithIndex() |
default Seq<Tuple2<Tuple2<K,V>,Long>> |
Map.zipWithIndex() |
default Seq<Tuple2<Tuple2<K,V>,Long>> |
Map.zipWithIndex() |
default List<Tuple2<T,Long>> |
List.zipWithIndex() |
LinkedHashSet<Tuple2<T,Long>> |
LinkedHashSet.zipWithIndex() |
LinearSeq<Tuple2<T,Long>> |
LinearSeq.zipWithIndex() |
default Iterator<Tuple2<T,Long>> |
Iterator.zipWithIndex() |
IndexedSeq<Tuple2<T,Long>> |
IndexedSeq.zipWithIndex() |
HashSet<Tuple2<T,Long>> |
HashSet.zipWithIndex() |
IndexedSeq<Tuple2<Character,Long>> |
CharSeq.zipWithIndex() |
Array<Tuple2<T,Long>> |
Array.zipWithIndex() |
Modifier and Type | Method and Description |
---|---|
default boolean |
Map.contains(Tuple2<K,V> element) |
static <K,V> TreeMap<K,V> |
TreeMap.of(Comparator<? super K> keyComparator,
Tuple2<? extends K,? extends V> entry)
Returns a singleton
TreeMap , i.e. |
static <K extends Comparable<? super K>,V> |
TreeMap.of(Tuple2<? extends K,? extends V> entry)
Returns a singleton
TreeMap , i.e. |
static <K,V> LinkedHashMap<K,V> |
LinkedHashMap.of(Tuple2<? extends K,? extends V> entry)
Returns a singleton
LinkedHashMap , i.e. |
static <K,V> HashMap<K,V> |
HashMap.of(Tuple2<? extends K,? extends V> entry)
Returns a singleton
HashMap , i.e. |
static <K,V> TreeMap<K,V> |
TreeMap.ofEntries(Comparator<? super K> keyComparator,
Tuple2<? extends K,? extends V>... entries)
Creates a
TreeMap of the given entries using the given key comparator. |
static <K extends Comparable<? super K>,V> |
TreeMap.ofEntries(Tuple2<? extends K,? extends V>... entries)
Creates a
TreeMap of the given entries using the natural key comparator. |
static <K,V> LinkedHashMap<K,V> |
LinkedHashMap.ofEntries(Tuple2<? extends K,? extends V>... entries)
Creates a LinkedHashMap of the given entries.
|
static <K,V> HashMap<K,V> |
HashMap.ofEntries(Tuple2<? extends K,? extends V>... entries)
Creates a HashMap of the given entries.
|
SortedMap<K,V> |
SortedMap.put(Tuple2<? extends K,? extends V> entry) |
Map<K,V> |
Map.put(Tuple2<? extends K,? extends V> entry)
Convenience method for
put(entry._1, entry._2) . |
SortedMap<K,V> |
SortedMap.replace(Tuple2<K,V> currentElement,
Tuple2<K,V> newElement) |
SortedMap<K,V> |
SortedMap.replace(Tuple2<K,V> currentElement,
Tuple2<K,V> newElement) |
Map<K,V> |
Map.replace(Tuple2<K,V> currentElement,
Tuple2<K,V> newElement) |
Map<K,V> |
Map.replace(Tuple2<K,V> currentElement,
Tuple2<K,V> newElement) |
SortedMap<K,V> |
SortedMap.replaceAll(Tuple2<K,V> currentElement,
Tuple2<K,V> newElement) |
SortedMap<K,V> |
SortedMap.replaceAll(Tuple2<K,V> currentElement,
Tuple2<K,V> newElement) |
Map<K,V> |
Map.replaceAll(Tuple2<K,V> currentElement,
Tuple2<K,V> newElement) |
Map<K,V> |
Map.replaceAll(Tuple2<K,V> currentElement,
Tuple2<K,V> newElement) |
SortedMap<K,V> |
SortedMap.scan(Tuple2<K,V> zero,
BiFunction<? super Tuple2<K,V>,? super Tuple2<K,V>,? extends Tuple2<K,V>> operation) |
Map<K,V> |
Map.scan(Tuple2<K,V> zero,
BiFunction<? super Tuple2<K,V>,? super Tuple2<K,V>,? extends Tuple2<K,V>> operation) |
default <U> Seq<Tuple2<Tuple2<K,V>,U>> |
Map.zipAll(Iterable<U> that,
Tuple2<K,V> thisElem,
U thatElem) |
Modifier and Type | Method and Description |
---|---|
SortedMap<K,V> |
SortedMap.distinctBy(Comparator<? super Tuple2<K,V>> comparator) |
Map<K,V> |
Map.distinctBy(Comparator<? super Tuple2<K,V>> comparator) |
<U> SortedMap<K,V> |
SortedMap.distinctBy(Function<? super Tuple2<K,V>,? extends U> keyExtractor) |
<U> Map<K,V> |
Map.distinctBy(Function<? super Tuple2<K,V>,? extends U> keyExtractor) |
SortedMap<K,V> |
SortedMap.dropUntil(Predicate<? super Tuple2<K,V>> predicate) |
Map<K,V> |
Map.dropUntil(Predicate<? super Tuple2<K,V>> predicate) |
SortedMap<K,V> |
SortedMap.dropWhile(Predicate<? super Tuple2<K,V>> predicate) |
Map<K,V> |
Map.dropWhile(Predicate<? super Tuple2<K,V>> predicate) |
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
n values supplied by a given Supplier s . |
static <K extends Comparable<? super K>,V> |
TreeMap.fill(int n,
Supplier<? extends Tuple2<? extends K,? extends V>> s)
Returns a TreeMap containing
n values supplied by a given Supplier s . |
static <K,V> LinkedHashMap<K,V> |
LinkedHashMap.fill(int n,
Supplier<? extends Tuple2<? extends K,? extends V>> s)
Returns a LinkedHashMap containing
n values supplied by a given Supplier s . |
static <K,V> HashMap<K,V> |
HashMap.fill(int n,
Supplier<? extends Tuple2<? extends K,? extends V>> s)
Returns an HashMap containing
n values supplied by a given Supplier s . |
SortedMap<K,V> |
SortedMap.filter(Predicate<? super Tuple2<K,V>> predicate) |
Map<K,V> |
Map.filter(Predicate<? super Tuple2<K,V>> predicate) |
<K2,V2> TreeMap<K2,V2> |
TreeMap.flatMap(BiFunction<? super K,? super V,? extends Iterable<Tuple2<K2,V2>>> mapper) |
<K2,V2> SortedMap<K2,V2> |
SortedMap.flatMap(BiFunction<? super K,? super V,? extends Iterable<Tuple2<K2,V2>>> mapper) |
<K2,V2> Map<K2,V2> |
Map.flatMap(BiFunction<? super K,? super V,? extends Iterable<Tuple2<K2,V2>>> mapper)
FlatMaps this
Map to a new Map with different component type. |
<K2,V2> LinkedHashMap<K2,V2> |
LinkedHashMap.flatMap(BiFunction<? super K,? super V,? extends Iterable<Tuple2<K2,V2>>> mapper) |
<K2,V2> HashMap<K2,V2> |
HashMap.flatMap(BiFunction<? super K,? super V,? extends Iterable<Tuple2<K2,V2>>> mapper) |
<K2,V2> TreeMap<K2,V2> |
TreeMap.flatMap(Comparator<? super K2> keyComparator,
BiFunction<? super K,? super V,? extends Iterable<Tuple2<K2,V2>>> mapper) |
<K2,V2> SortedMap<K2,V2> |
SortedMap.flatMap(Comparator<? super K2> keyComparator,
BiFunction<? super K,? super V,? extends Iterable<Tuple2<K2,V2>>> mapper)
Same as
SortedMap.flatMap(BiFunction) but using a specific comparator for values of the codomain of the given
mapper . |
default <U> Seq<U> |
Map.flatMap(Function<? super Tuple2<K,V>,? extends Iterable<? extends U>> mapper)
Flat-maps this entries to a sequence of values.
|
default <U> U |
Map.foldRight(U zero,
BiFunction<? super Tuple2<K,V>,? super U,? extends U> f) |
<C> Map<C,? extends SortedMap<K,V>> |
SortedMap.groupBy(Function<? super Tuple2<K,V>,? extends C> classifier) |
<C> Map<C,? extends Map<K,V>> |
Map.groupBy(Function<? super Tuple2<K,V>,? extends C> classifier) |
<K2,V2> TreeMap<K2,V2> |
TreeMap.map(BiFunction<? super K,? super V,Tuple2<K2,V2>> mapper) |
<K2,V2> SortedMap<K2,V2> |
SortedMap.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 this
Map to form a new Map . |
<K2,V2> LinkedHashMap<K2,V2> |
LinkedHashMap.map(BiFunction<? super K,? super V,Tuple2<K2,V2>> mapper) |
<K2,V2> HashMap<K2,V2> |
HashMap.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> SortedMap<K2,V2> |
SortedMap.map(Comparator<? super K2> keyComparator,
BiFunction<? super K,? super V,Tuple2<K2,V2>> mapper)
Same as
SortedMap.map(BiFunction) , using a specific comparator for keys of the codomain of the given
mapper . |
default <U> Seq<U> |
Map.map(Function<? super Tuple2<K,V>,? extends U> mapper)
Maps the
Map entries to a sequence of values. |
static <K,V> TreeMap<K,V> |
TreeMap.ofEntries(Comparator<? super K> keyComparator,
Iterable<? extends Tuple2<? extends K,? extends V>> entries)
Creates a
TreeMap of the given entries. |
static <K extends Comparable<? super K>,V> |
TreeMap.ofEntries(Iterable<? extends Tuple2<? extends K,? extends V>> entries)
Creates a
TreeMap of the given entries. |
static <K,V> LinkedHashMap<K,V> |
LinkedHashMap.ofEntries(Iterable<? extends Tuple2<? extends K,? extends V>> entries)
Creates a LinkedHashMap of the given entries.
|
static <K,V> HashMap<K,V> |
HashMap.ofEntries(Iterable<? extends Tuple2<? extends K,? extends V>> entries)
Creates a HashMap of the given entries.
|
Tuple2<? extends SortedMap<K,V>,? extends SortedMap<K,V>> |
SortedMap.partition(Predicate<? super Tuple2<K,V>> predicate) |
Tuple2<? extends Map<K,V>,? extends Map<K,V>> |
Map.partition(Predicate<? super Tuple2<K,V>> predicate) |
SortedMap<K,V> |
SortedMap.peek(Consumer<? super Tuple2<K,V>> action) |
Map<K,V> |
Map.peek(Consumer<? super Tuple2<K,V>> action) |
TreeMap<K,V> |
TreeMap.retainAll(Iterable<? extends Tuple2<K,V>> elements) |
SortedMap<K,V> |
SortedMap.retainAll(Iterable<? extends Tuple2<K,V>> elements) |
Map<K,V> |
Map.retainAll(Iterable<? extends Tuple2<K,V>> elements) |
LinkedHashMap<K,V> |
LinkedHashMap.retainAll(Iterable<? extends Tuple2<K,V>> elements) |
HashMap<K,V> |
HashMap.retainAll(Iterable<? extends Tuple2<K,V>> elements) |
SortedMap<K,V> |
SortedMap.scan(Tuple2<K,V> zero,
BiFunction<? super Tuple2<K,V>,? super Tuple2<K,V>,? extends Tuple2<K,V>> operation) |
SortedMap<K,V> |
SortedMap.scan(Tuple2<K,V> zero,
BiFunction<? super Tuple2<K,V>,? super Tuple2<K,V>,? extends Tuple2<K,V>> operation) |
SortedMap<K,V> |
SortedMap.scan(Tuple2<K,V> zero,
BiFunction<? super Tuple2<K,V>,? super Tuple2<K,V>,? extends Tuple2<K,V>> operation) |
Map<K,V> |
Map.scan(Tuple2<K,V> zero,
BiFunction<? super Tuple2<K,V>,? super Tuple2<K,V>,? extends Tuple2<K,V>> operation) |
Map<K,V> |
Map.scan(Tuple2<K,V> zero,
BiFunction<? super Tuple2<K,V>,? super Tuple2<K,V>,? extends Tuple2<K,V>> operation) |
Map<K,V> |
Map.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> |
Map.scanRight(U zero,
BiFunction<? super Tuple2<K,V>,? super U,? extends U> operation) |
Tuple2<? extends SortedMap<K,V>,? extends SortedMap<K,V>> |
SortedMap.span(Predicate<? super Tuple2<K,V>> predicate) |
Tuple2<? extends Map<K,V>,? extends Map<K,V>> |
Map.span(Predicate<? super Tuple2<K,V>> predicate) |
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 containing
n values of a given Function f
over a range of integer values from 0 to n - 1 . |
static <K extends Comparable<? super K>,V> |
TreeMap.tabulate(int n,
Function<? super Integer,? extends Tuple2<? extends K,? extends V>> f)
Returns a TreeMap containing
n values of a given Function f
over a range of integer values from 0 to n - 1 . |
static <K,V> LinkedHashMap<K,V> |
LinkedHashMap.tabulate(int n,
Function<? super Integer,? extends Tuple2<? extends K,? extends V>> f)
Returns a LinkedHashMap containing
n values of a given Function f
over a range of integer values from 0 to n - 1 . |
static <K,V> HashMap<K,V> |
HashMap.tabulate(int n,
Function<? super Integer,? extends Tuple2<? extends K,? extends V>> f)
Returns an HashMap containing
n values of a given Function f
over a range of integer values from 0 to n - 1 . |
SortedMap<K,V> |
SortedMap.takeUntil(Predicate<? super Tuple2<K,V>> predicate) |
Map<K,V> |
Map.takeUntil(Predicate<? super Tuple2<K,V>> predicate) |
SortedMap<K,V> |
SortedMap.takeWhile(Predicate<? super Tuple2<K,V>> predicate) |
Map<K,V> |
Map.takeWhile(Predicate<? super Tuple2<K,V>> predicate) |
default <T1,T2> Tuple2<Seq<T1>,Seq<T2>> |
Map.unzip(BiFunction<? super K,? super V,Tuple2<? extends T1,? extends T2>> unzipper) |
<T1,T2> Tuple2<IndexedSeq<T1>,IndexedSeq<T2>> |
CharSeq.unzip(Function<? super Character,Tuple2<? extends T1,? extends T2>> unzipper) |
<T1,T2> Tuple2<Vector<T1>,Vector<T2>> |
Vector.unzip(Function<? super T,Tuple2<? extends T1,? extends T2>> unzipper) |
<T1,T2> Tuple2<TreeSet<T1>,TreeSet<T2>> |
TreeSet.unzip(Function<? super T,Tuple2<? extends T1,? extends T2>> unzipper) |
default <T1,T2> Tuple2<Tree<T1>,Tree<T2>> |
Tree.unzip(Function<? super T,Tuple2<? extends T1,? extends T2>> unzipper) |
<T1,T2> Tuple2<? extends Traversable<T1>,? extends Traversable<T2>> |
Traversable.unzip(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<Stream<T1>,Stream<T2>> |
Stream.unzip(Function<? super T,Tuple2<? extends T1,? extends T2>> unzipper) |
<T1,T2> Tuple2<? extends SortedSet<T1>,? extends SortedSet<T2>> |
SortedSet.unzip(Function<? super T,Tuple2<? extends T1,? extends T2>> unzipper) |
<T1,T2> Tuple2<? extends Set<T1>,? extends Set<T2>> |
Set.unzip(Function<? super T,Tuple2<? extends T1,? extends T2>> unzipper) |
<T1,T2> Tuple2<? extends Seq<T1>,? extends Seq<T2>> |
Seq.unzip(Function<? super T,Tuple2<? extends T1,? extends T2>> unzipper) |
<T1,T2> Tuple2<Queue<T1>,Queue<T2>> |
Queue.unzip(Function<? super T,Tuple2<? extends T1,? extends T2>> unzipper) |
default <T1,T2> Tuple2<List<T1>,List<T2>> |
List.unzip(Function<? super T,Tuple2<? extends T1,? extends T2>> unzipper) |
<T1,T2> Tuple2<LinkedHashSet<T1>,LinkedHashSet<T2>> |
LinkedHashSet.unzip(Function<? super T,Tuple2<? extends T1,? extends T2>> unzipper) |
<T1,T2> Tuple2<? extends LinearSeq<T1>,? extends LinearSeq<T2>> |
LinearSeq.unzip(Function<? super T,Tuple2<? extends T1,? extends T2>> unzipper) |
default <T1,T2> Tuple2<Iterator<T1>,Iterator<T2>> |
Iterator.unzip(Function<? super T,Tuple2<? extends T1,? extends T2>> unzipper) |
<T1,T2> Tuple2<? extends IndexedSeq<T1>,? extends IndexedSeq<T2>> |
IndexedSeq.unzip(Function<? super T,Tuple2<? extends T1,? extends T2>> unzipper) |
<T1,T2> Tuple2<HashSet<T1>,HashSet<T2>> |
HashSet.unzip(Function<? super T,Tuple2<? extends T1,? extends T2>> unzipper) |
<T1,T2> Tuple2<Array<T1>,Array<T2>> |
Array.unzip(Function<? super T,Tuple2<? extends T1,? extends T2>> unzipper) |
default <T1,T2> Tuple2<Seq<T1>,Seq<T2>> |
Map.unzip(Function<? super Tuple2<K,V>,Tuple2<? extends T1,? extends T2>> unzipper) |
default <T1,T2> Tuple2<Seq<T1>,Seq<T2>> |
Map.unzip(Function<? super Tuple2<K,V>,Tuple2<? extends T1,? extends T2>> unzipper) |
default <T1,T2,T3> Tuple3<Seq<T1>,Seq<T2>,Seq<T3>> |
Map.unzip3(Function<? super Tuple2<K,V>,Tuple3<? extends T1,? extends T2,? extends T3>> unzipper) |
Modifier and Type | Method and Description |
---|---|
default <U> Future<Tuple2<T,U>> |
Future.zip(Future<? extends U> that)
Returns a tuple of this and that Future result.
|
Copyright © 2016. All Rights Reserved.