private static <K,K2,V,V2> TreeMap<K2,V2> |
TreeMap.bimap(TreeMap<K,V> map,
TreeMap.EntryComparator<K2,V2> entryComparator,
java.util.function.Function<? super K,? extends K2> keyMapper,
java.util.function.Function<? super V,? extends V2> valueMapper) |
|
<K2,V2> TreeMap<K2,V2> |
TreeMap.bimap(java.util.Comparator<? super K2> keyComparator,
java.util.function.Function<? super K,? extends K2> keyMapper,
java.util.function.Function<? super V,? extends V2> valueMapper) |
|
<K2,V2> TreeMap<K2,V2> |
TreeMap.bimap(java.util.function.Function<? super K,? extends K2> keyMapper,
java.util.function.Function<? super V,? extends V2> valueMapper) |
|
private TreeMap<K,V> |
TreeMap.createFromEntries(java.lang.Iterable<Tuple2<K,V>> tuples) |
|
private static <K,V> TreeMap<K,V> |
TreeMap.createFromMap(TreeMap.EntryComparator<K,V> entryComparator,
java.util.Map<? extends K,? extends V> map) |
|
private static <K,V> TreeMap<K,V> |
TreeMap.createFromMapEntries(TreeMap.EntryComparator<K,V> entryComparator,
java.util.Map.Entry<? extends K,? extends V>... entries) |
|
private static <K,V> TreeMap<K,V> |
TreeMap.createFromPairs(TreeMap.EntryComparator<K,V> entryComparator,
java.lang.Object... pairs) |
|
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) |
|
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) |
|
TreeMap<K,V> |
TreeMap.distinct() |
|
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) |
|
TreeMap<K,V> |
TreeMap.drop(int n) |
|
TreeMap<K,V> |
TreeMap.dropRight(int n) |
|
TreeMap<K,V> |
TreeMap.dropUntil(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 extends java.lang.Comparable<? super K>,V> TreeMap<K,V> |
TreeMap.empty() |
Returns the empty TreeMap.
|
static <K,V> TreeMap<K,V> |
TreeMap.empty(java.util.Comparator<? super K> keyComparator) |
Returns the empty TreeMap using the given key comparator.
|
private TreeMap<K,V> |
TreeMap.emptyInstance() |
|
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 by n calls to a given Supplier s .
|
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 by n calls to a given Supplier s .
|
TreeMap<K,V> |
TreeMap.filter(java.util.function.BiPredicate<? super K,? super V> predicate) |
|
TreeMap<K,V> |
TreeMap.filter(java.util.function.Predicate<? super Tuple2<K,V>> predicate) |
|
TreeMap<K,V> |
TreeMap.filterKeys(java.util.function.Predicate<? super K> predicate) |
|
TreeMap<K,V> |
TreeMap.filterValues(java.util.function.Predicate<? super V> predicate) |
|
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) |
|
TreeMap<K,V> |
TreeMap.init() |
|
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) |
|
<K2> TreeMap<K2,V> |
TreeMap.mapKeys(java.util.function.Function<? super K,? extends K2> keyMapper) |
|
<K2> TreeMap<K2,V> |
TreeMap.mapKeys(java.util.function.Function<? super K,? extends K2> keyMapper,
java.util.function.BiFunction<? super V,? super V,? extends V> valueMerge) |
|
<W> TreeMap<K,W> |
TreeMap.mapValues(java.util.function.Function<? super V,? extends W> valueMapper) |
|
TreeMap<K,V> |
TreeMap.merge(Map<? extends K,? extends V> that) |
|
<U extends V> TreeMap<K,V> |
TreeMap.merge(Map<? extends K,U> that,
java.util.function.BiFunction<? super V,? super U,? extends V> collisionResolution) |
|
static <K,V> TreeMap<K,V> |
TreeMap.narrow(TreeMap<? extends K,? extends V> treeMap) |
Narrows a widened TreeMap<? extends K, ? extends V> to TreeMap<K, V>
by performing a type-safe cast.
|
static <K extends java.lang.Comparable<? super K>,V> TreeMap<K,V> |
TreeMap.of(Tuple2<? extends K,? extends V> entry) |
Returns a singleton TreeMap , i.e.
|
static <K,V> TreeMap<K,V> |
TreeMap.of(java.util.Comparator<? super K> keyComparator,
Tuple2<? extends K,? extends V> entry) |
Returns a singleton TreeMap , i.e.
|
static <K,V> TreeMap<K,V> |
TreeMap.of(java.util.Comparator<? super K> keyComparator,
K key,
V value) |
Returns a singleton TreeMap , i.e.
|
static <K,V> TreeMap<K,V> |
TreeMap.of(java.util.Comparator<? super K> keyComparator,
K k1,
V v1,
K k2,
V v2) |
Creates a TreeMap of the given list of key-value pairs.
|
static <K,V> TreeMap<K,V> |
TreeMap.of(java.util.Comparator<? super K> keyComparator,
K k1,
V v1,
K k2,
V v2,
K k3,
V v3) |
Creates a TreeMap of the given list of key-value pairs.
|
static <K,V> TreeMap<K,V> |
TreeMap.of(java.util.Comparator<? super K> keyComparator,
K k1,
V v1,
K k2,
V v2,
K k3,
V v3,
K k4,
V v4) |
Creates a TreeMap of the given list of key-value pairs.
|
static <K,V> TreeMap<K,V> |
TreeMap.of(java.util.Comparator<? super K> keyComparator,
K k1,
V v1,
K k2,
V v2,
K k3,
V v3,
K k4,
V v4,
K k5,
V v5) |
Creates a TreeMap of the given list of key-value pairs.
|
static <K,V> TreeMap<K,V> |
TreeMap.of(java.util.Comparator<? super K> keyComparator,
K k1,
V v1,
K k2,
V v2,
K k3,
V v3,
K k4,
V v4,
K k5,
V v5,
K k6,
V v6) |
Creates a TreeMap of the given list of key-value pairs.
|
static <K,V> TreeMap<K,V> |
TreeMap.of(java.util.Comparator<? super K> keyComparator,
K k1,
V v1,
K k2,
V v2,
K k3,
V v3,
K k4,
V v4,
K k5,
V v5,
K k6,
V v6,
K k7,
V v7) |
Creates a TreeMap of the given list of key-value pairs.
|
static <K,V> TreeMap<K,V> |
TreeMap.of(java.util.Comparator<? super K> keyComparator,
K k1,
V v1,
K k2,
V v2,
K k3,
V v3,
K k4,
V v4,
K k5,
V v5,
K k6,
V v6,
K k7,
V v7,
K k8,
V v8) |
Creates a TreeMap of the given list of key-value pairs.
|
static <K,V> TreeMap<K,V> |
TreeMap.of(java.util.Comparator<? super K> keyComparator,
K k1,
V v1,
K k2,
V v2,
K k3,
V v3,
K k4,
V v4,
K k5,
V v5,
K k6,
V v6,
K k7,
V v7,
K k8,
V v8,
K k9,
V v9) |
Creates a TreeMap of the given list of key-value pairs.
|
static <K,V> TreeMap<K,V> |
TreeMap.of(java.util.Comparator<? super K> keyComparator,
K k1,
V v1,
K k2,
V v2,
K k3,
V v3,
K k4,
V v4,
K k5,
V v5,
K k6,
V v6,
K k7,
V v7,
K k8,
V v8,
K k9,
V v9,
K k10,
V v10) |
Creates a TreeMap of the given list of key-value pairs.
|
static <K extends java.lang.Comparable<? super K>,V> TreeMap<K,V> |
TreeMap.of(K key,
V value) |
Returns a singleton TreeMap , i.e.
|
static <K extends java.lang.Comparable<? super K>,V> TreeMap<K,V> |
TreeMap.of(K k1,
V v1,
K k2,
V v2) |
Creates a TreeMap of the given list of key-value pairs.
|
static <K extends java.lang.Comparable<? super K>,V> TreeMap<K,V> |
TreeMap.of(K k1,
V v1,
K k2,
V v2,
K k3,
V v3) |
Creates a TreeMap of the given list of key-value pairs.
|
static <K extends java.lang.Comparable<? super K>,V> TreeMap<K,V> |
TreeMap.of(K k1,
V v1,
K k2,
V v2,
K k3,
V v3,
K k4,
V v4) |
Creates a TreeMap of the given list of key-value pairs.
|
static <K extends java.lang.Comparable<? super K>,V> TreeMap<K,V> |
TreeMap.of(K k1,
V v1,
K k2,
V v2,
K k3,
V v3,
K k4,
V v4,
K k5,
V v5) |
Creates a TreeMap of the given list of key-value pairs.
|
static <K extends java.lang.Comparable<? super K>,V> TreeMap<K,V> |
TreeMap.of(K k1,
V v1,
K k2,
V v2,
K k3,
V v3,
K k4,
V v4,
K k5,
V v5,
K k6,
V v6) |
Creates a TreeMap of the given list of key-value pairs.
|
static <K extends java.lang.Comparable<? super K>,V> TreeMap<K,V> |
TreeMap.of(K k1,
V v1,
K k2,
V v2,
K k3,
V v3,
K k4,
V v4,
K k5,
V v5,
K k6,
V v6,
K k7,
V v7) |
Creates a TreeMap of the given list of key-value pairs.
|
static <K extends java.lang.Comparable<? super K>,V> TreeMap<K,V> |
TreeMap.of(K k1,
V v1,
K k2,
V v2,
K k3,
V v3,
K k4,
V v4,
K k5,
V v5,
K k6,
V v6,
K k7,
V v7,
K k8,
V v8) |
Creates a TreeMap of the given list of key-value pairs.
|
static <K extends java.lang.Comparable<? super K>,V> TreeMap<K,V> |
TreeMap.of(K k1,
V v1,
K k2,
V v2,
K k3,
V v3,
K k4,
V v4,
K k5,
V v5,
K k6,
V v6,
K k7,
V v7,
K k8,
V v8,
K k9,
V v9) |
Creates a TreeMap of the given list of key-value pairs.
|
static <K extends java.lang.Comparable<? super K>,V> TreeMap<K,V> |
TreeMap.of(K k1,
V v1,
K k2,
V v2,
K k3,
V v3,
K k4,
V v4,
K k5,
V v5,
K k6,
V v6,
K k7,
V v7,
K k8,
V v8,
K k9,
V v9,
K k10,
V v10) |
Creates a TreeMap of the given list of key-value pairs.
|
static <K,V> TreeMap<K,V> |
TreeMap.ofAll(java.util.Comparator<? super K> keyComparator,
java.util.Map<? extends K,? extends V> map) |
Returns a TreeMap , from a source java.util.Map.
|
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,? extends K> keyMapper,
java.util.function.Function<? super T,? extends V> valueMapper) |
Returns a TreeMap , 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 a TreeMap , from entries mapped from stream.
|
static <K extends java.lang.Comparable<? super K>,V> TreeMap<K,V> |
TreeMap.ofAll(java.util.Map<? extends K,? extends V> map) |
Returns a TreeMap , from a source java.util.Map.
|
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,? extends K> keyMapper,
java.util.function.Function<? super T,? extends V> valueMapper) |
Returns a TreeMap , 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 a TreeMap , from entries mapped from stream.
|
static <K extends java.lang.Comparable<? super K>,V> TreeMap<K,V> |
TreeMap.ofEntries(Tuple2<? extends K,? extends V>... entries) |
Creates a TreeMap of the given entries using the natural key comparator.
|
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 a TreeMap of the given entries.
|
static <K,V> TreeMap<K,V> |
TreeMap.ofEntries(java.util.Comparator<? super K> keyComparator,
Tuple2<? extends K,? extends V>... entries) |
Creates a TreeMap of the given entries using the given key comparator.
|
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 a TreeMap of the given entries.
|
static <K,V> TreeMap<K,V> |
TreeMap.ofEntries(java.util.Comparator<? super K> keyComparator,
java.util.Map.Entry<? extends K,? extends V>... entries) |
Creates a TreeMap of the given entries using the given key comparator.
|
static <K extends java.lang.Comparable<? super K>,V> TreeMap<K,V> |
TreeMap.ofEntries(java.util.Map.Entry<? extends K,? extends V>... entries) |
Creates a TreeMap of the given entries using the natural key comparator.
|
TreeMap<K,V> |
TreeMap.orElse(java.lang.Iterable<? extends Tuple2<K,V>> other) |
Returns this TreeMap if it is nonempty,
otherwise TreeMap created from iterable, using existing comparator.
|
TreeMap<K,V> |
TreeMap.orElse(java.util.function.Supplier<? extends java.lang.Iterable<? extends Tuple2<K,V>>> supplier) |
Returns this TreeMap if it is nonempty,
otherwise TreeMap created from result of evaluating supplier, using existing comparator.
|
TreeMap<K,V> |
TreeMap.peek(java.util.function.Consumer<? super Tuple2<K,V>> action) |
|
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) |
|
<U extends V> TreeMap<K,V> |
TreeMap.put(K key,
U value,
java.util.function.BiFunction<? super V,? super U,? extends V> merge) |
|
TreeMap<K,V> |
TreeMap.put(K key,
V value) |
|
TreeMap<K,V> |
TreeMap.reject(java.util.function.BiPredicate<? super K,? super V> predicate) |
|
TreeMap<K,V> |
TreeMap.reject(java.util.function.Predicate<? super Tuple2<K,V>> predicate) |
|
TreeMap<K,V> |
TreeMap.rejectKeys(java.util.function.Predicate<? super K> predicate) |
|
TreeMap<K,V> |
TreeMap.rejectValues(java.util.function.Predicate<? super V> predicate) |
|
TreeMap<K,V> |
TreeMap.remove(K key) |
|
TreeMap<K,V> |
TreeMap.removeAll(java.lang.Iterable<? extends K> keys) |
|
TreeMap<K,V> |
TreeMap.removeAll(java.util.function.BiPredicate<? super K,? super V> predicate) |
Deprecated.
|
TreeMap<K,V> |
TreeMap.removeKeys(java.util.function.Predicate<? super K> predicate) |
Deprecated.
|
TreeMap<K,V> |
TreeMap.removeValues(java.util.function.Predicate<? super V> predicate) |
Deprecated.
|
TreeMap<K,V> |
TreeMap.replace(Tuple2<K,V> currentElement,
Tuple2<K,V> newElement) |
|
TreeMap<K,V> |
TreeMap.replace(K key,
V oldValue,
V newValue) |
|
TreeMap<K,V> |
TreeMap.replaceAll(Tuple2<K,V> currentElement,
Tuple2<K,V> newElement) |
|
TreeMap<K,V> |
TreeMap.replaceAll(java.util.function.BiFunction<? super K,? super V,? extends V> function) |
|
TreeMap<K,V> |
TreeMap.replaceValue(K key,
V value) |
|
TreeMap<K,V> |
TreeMap.retainAll(java.lang.Iterable<? extends Tuple2<K,V>> elements) |
|
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) |
|
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 containing n values of a given Function f
over a range of integer values from 0 to n - 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 containing n values of a given Function f
over a range of integer values from 0 to n - 1 .
|
TreeMap<K,V> |
TreeMap.tail() |
|
TreeMap<K,V> |
TreeMap.take(int n) |
|
TreeMap<K,V> |
TreeMap.takeRight(int n) |
|
TreeMap<K,V> |
TreeMap.takeUntil(java.util.function.Predicate<? super Tuple2<K,V>> predicate) |
|
TreeMap<K,V> |
TreeMap.takeWhile(java.util.function.Predicate<? super Tuple2<K,V>> predicate) |
|