Package | Description |
---|---|
io.vavr.collection |
Purely functional collections based on Traversable.
|
Modifier and Type | Method and Description |
---|---|
<K2,V2> TreeMap<K2,V2> |
TreeMap.bimap(Comparator<? super K2> keyComparator,
Function<? super K,? extends K2> keyMapper,
Function<? super V,? extends V2> valueMapper) |
<K2,V2> TreeMap<K2,V2> |
TreeMap.bimap(Function<? super K,? extends K2> keyMapper,
Function<? super V,? extends V2> valueMapper) |
TreeMap<K,V> |
TreeMap.distinct() |
TreeMap<K,V> |
TreeMap.distinctBy(Comparator<? super Tuple2<K,V>> comparator) |
<U> TreeMap<K,V> |
TreeMap.distinctBy(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(Predicate<? super Tuple2<K,V>> predicate) |
TreeMap<K,V> |
TreeMap.dropWhile(Predicate<? super Tuple2<K,V>> predicate) |
static <K extends Comparable<? super K>,V> |
TreeMap.empty()
Returns the empty TreeMap.
|
static <K,V> TreeMap<K,V> |
TreeMap.empty(Comparator<? super K> keyComparator)
Returns the empty TreeMap using the given key comparator.
|
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 . |
TreeMap<K,V> |
TreeMap.filter(BiPredicate<? super K,? super V> predicate) |
TreeMap<K,V> |
TreeMap.filter(Predicate<? super Tuple2<K,V>> predicate) |
TreeMap<K,V> |
TreeMap.filterKeys(Predicate<? super K> predicate) |
TreeMap<K,V> |
TreeMap.filterValues(Predicate<? super V> predicate) |
<K2,V2> TreeMap<K2,V2> |
TreeMap.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) |
TreeMap<K,V> |
TreeMap.init() |
<K2,V2> TreeMap<K2,V2> |
TreeMap.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> TreeMap<K2,V> |
TreeMap.mapKeys(Function<? super K,? extends K2> keyMapper) |
<K2> TreeMap<K2,V> |
TreeMap.mapKeys(Function<? super K,? extends K2> keyMapper,
BiFunction<? super V,? super V,? extends V> valueMerge) |
<W> TreeMap<K,W> |
TreeMap.mapValues(Function<? super V,? extends W> valueMapper) |
TreeMap<K,V> |
TreeMap.merge(Map<? extends K,? extends V> that) |
<U extends V> |
TreeMap.merge(Map<? extends K,U> that,
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,V> TreeMap<K,V> |
TreeMap.of(Comparator<? super K> keyComparator,
K key,
V value)
Returns a singleton
TreeMap , i.e. |
static <K,V> TreeMap<K,V> |
TreeMap.of(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(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(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(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(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(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(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(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(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,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(K key,
V value)
Returns a singleton
TreeMap , i.e. |
static <K extends Comparable<? super 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 Comparable<? super 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 Comparable<? super 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 Comparable<? super 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 Comparable<? super 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 Comparable<? super 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 Comparable<? super 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 Comparable<? super 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 Comparable<? super 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 extends Comparable<? super K>,V> |
TreeMap.of(Tuple2<? extends K,? extends V> entry)
Returns a singleton
TreeMap , i.e. |
static <K,V> TreeMap<K,V> |
TreeMap.ofAll(Comparator<? super K> keyComparator,
Map<? extends K,? extends V> map)
Returns a
TreeMap , from a source java.util.Map. |
static <T,K,V> TreeMap<K,V> |
TreeMap.ofAll(Comparator<? super K> keyComparator,
Stream<? extends T> stream,
Function<? super T,? extends K> keyMapper,
Function<? super T,? extends V> valueMapper)
Returns a
TreeMap , 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 a
TreeMap , from entries mapped from stream. |
static <K extends Comparable<? super K>,V> |
TreeMap.ofAll(Map<? extends K,? extends V> map)
Returns a
TreeMap , from a source java.util.Map. |
static <T,K extends Comparable<? super K>,V> |
TreeMap.ofAll(Stream<? extends T> stream,
Function<? super T,? extends K> keyMapper,
Function<? super T,? extends V> valueMapper)
Returns a
TreeMap , from entries mapped from stream. |
static <T,K extends Comparable<? super K>,V> |
TreeMap.ofAll(Stream<? extends T> stream,
Function<? super T,Tuple2<? extends K,? extends V>> entryMapper)
Returns a
TreeMap , from entries mapped from stream. |
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,V> TreeMap<K,V> |
TreeMap.ofEntries(Comparator<? super K> keyComparator,
Map.Entry<? 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(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(Iterable<? extends Tuple2<? extends K,? extends V>> entries)
Creates a
TreeMap of the given entries. |
static <K extends Comparable<? super K>,V> |
TreeMap.ofEntries(Map.Entry<? extends K,? extends V>... entries)
Creates a
TreeMap of the given entries using the natural 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. |
TreeMap<K,V> |
TreeMap.orElse(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(Supplier<? extends 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(Consumer<? super Tuple2<K,V>> action) |
<U extends V> |
TreeMap.put(K key,
U value,
BiFunction<? super V,? super U,? extends V> merge) |
TreeMap<K,V> |
TreeMap.put(K key,
V value) |
TreeMap<K,V> |
TreeMap.put(Tuple2<? extends K,? extends V> entry) |
<U extends V> |
TreeMap.put(Tuple2<? extends K,U> entry,
BiFunction<? super V,? super U,? extends V> merge) |
TreeMap<K,V> |
TreeMap.remove(K key) |
TreeMap<K,V> |
TreeMap.removeAll(BiPredicate<? super K,? super V> predicate) |
TreeMap<K,V> |
TreeMap.removeAll(Iterable<? extends K> keys) |
TreeMap<K,V> |
TreeMap.removeKeys(Predicate<? super K> predicate) |
TreeMap<K,V> |
TreeMap.removeValues(Predicate<? super V> predicate) |
TreeMap<K,V> |
TreeMap.replace(K key,
V oldValue,
V newValue) |
TreeMap<K,V> |
TreeMap.replace(Tuple2<K,V> currentElement,
Tuple2<K,V> newElement) |
TreeMap<K,V> |
TreeMap.replaceAll(BiFunction<? super K,? super V,? extends V> function) |
TreeMap<K,V> |
TreeMap.replaceAll(Tuple2<K,V> currentElement,
Tuple2<K,V> newElement) |
TreeMap<K,V> |
TreeMap.replaceValue(K key,
V value) |
TreeMap<K,V> |
TreeMap.retainAll(Iterable<? extends Tuple2<K,V>> elements) |
TreeMap<K,V> |
TreeMap.scan(Tuple2<K,V> zero,
BiFunction<? super Tuple2<K,V>,? super Tuple2<K,V>,? extends Tuple2<K,V>> operation) |
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 . |
TreeMap<K,V> |
TreeMap.tail() |
TreeMap<K,V> |
TreeMap.take(int n) |
TreeMap<K,V> |
TreeMap.takeRight(int n) |
TreeMap<K,V> |
TreeMap.takeUntil(Predicate<? super Tuple2<K,V>> predicate) |
TreeMap<K,V> |
TreeMap.takeWhile(Predicate<? super Tuple2<K,V>> predicate) |
Modifier and Type | Method and Description |
---|---|
static <K extends Comparable<? super K>,V> |
TreeMap.collector()
Returns a
Collector which may be used in conjunction with
Stream.collect(Collector) to obtain a
TreeMap . |
static <K,V> Collector<Tuple2<K,V>,ArrayList<Tuple2<K,V>>,TreeMap<K,V>> |
TreeMap.collector(Comparator<? super K> keyComparator)
Returns a
Collector which may be used in conjunction with
Stream.collect(Collector) to obtain a
TreeMap . |
Tuple2<V,TreeMap<K,V>> |
TreeMap.computeIfAbsent(K key,
Function<? super K,? extends V> mappingFunction) |
Tuple2<Option<V>,TreeMap<K,V>> |
TreeMap.computeIfPresent(K key,
BiFunction<? super K,? super V,? extends V> remappingFunction) |
<C> Map<C,TreeMap<K,V>> |
TreeMap.groupBy(Function<? super Tuple2<K,V>,? extends C> classifier) |
Iterator<TreeMap<K,V>> |
TreeMap.grouped(int size) |
Option<TreeMap<K,V>> |
TreeMap.initOption() |
Tuple2<TreeMap<K,V>,TreeMap<K,V>> |
TreeMap.partition(Predicate<? super Tuple2<K,V>> predicate) |
Tuple2<TreeMap<K,V>,TreeMap<K,V>> |
TreeMap.partition(Predicate<? super Tuple2<K,V>> predicate) |
Iterator<TreeMap<K,V>> |
TreeMap.slideBy(Function<? super Tuple2<K,V>,?> classifier) |
Iterator<TreeMap<K,V>> |
TreeMap.sliding(int size) |
Iterator<TreeMap<K,V>> |
TreeMap.sliding(int size,
int step) |
Tuple2<TreeMap<K,V>,TreeMap<K,V>> |
TreeMap.span(Predicate<? super Tuple2<K,V>> predicate) |
Tuple2<TreeMap<K,V>,TreeMap<K,V>> |
TreeMap.span(Predicate<? super Tuple2<K,V>> predicate) |
Option<TreeMap<K,V>> |
TreeMap.tailOption() |
Modifier and Type | Method and Description |
---|---|
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. |
Copyright © 2017. All Rights Reserved.