Uses of Class
io.vavr.collection.TreeMap
Packages that use TreeMap
-
Uses of TreeMap in io.vavr.collection
Methods in io.vavr.collection that return TreeMapModifier and TypeMethodDescriptionprivate static <K,K2, V, V2>
TreeMap<K2, V2> TreeMap.bimap(@NonNull TreeMap<K, V> map, @NonNull TreeMap.EntryComparator<K2, V2> entryComparator, Function<? super K, ? extends K2> keyMapper, Function<? super V, ? extends V2> valueMapper) <K2,V2> TreeMap <K2, V2> TreeMap.bimap(@NonNull Comparator<? super K2> keyComparator, @NonNull Function<? super K, ? extends K2> keyMapper, Function<? super V, ? extends V2> valueMapper) <K2,V2> TreeMap <K2, V2> TreeMap.bimap(@NonNull Function<? super K, ? extends K2> keyMapper, @NonNull Function<? super V, ? extends V2> valueMapper) TreeMap.createFromEntries(@NonNull Iterable<Tuple2<K, V>> tuples) private static <K,V> TreeMap <K, V> TreeMap.createFromMap(@NonNull TreeMap.EntryComparator<K, V> entryComparator, @NonNull Map<? extends K, ? extends V> map) private static <K,V> TreeMap <K, V> TreeMap.createFromMapEntries(@NonNull TreeMap.EntryComparator<K, V> entryComparator, @NonNull Map.Entry<? extends K, ? extends V> @NonNull ... entries) private static <K,V> TreeMap <K, V> TreeMap.createFromPairs(@NonNull TreeMap.EntryComparator<K, V> entryComparator, @NonNull Object @NonNull ... pairs) private static <K,V> TreeMap <K, V> TreeMap.createFromTuple(@NonNull TreeMap.EntryComparator<K, V> entryComparator, @NonNull Tuple2<? extends K, ? extends V> entry) private static <K,V> TreeMap <K, V> TreeMap.createFromTuples(@NonNull TreeMap.EntryComparator<K, V> entryComparator, @NonNull Tuple2<? extends K, ? extends V> @NonNull ... entries) private static <K,V> TreeMap <K, V> TreeMap.createTreeMap(@NonNull TreeMap.EntryComparator<K, V> entryComparator, @NonNull Iterable<? extends Tuple2<? extends K, ? extends V>> entries) private static <K,K2, V, V2>
TreeMap<K2, V2> TreeMap.createTreeMap(@NonNull TreeMap.EntryComparator<K2, V2> entryComparator, @NonNull Iterable<Tuple2<K, V>> entries, Function<Tuple2<K, V>, Tuple2<K2, V2>> entryMapper) TreeMap.distinct()TreeMap.distinctBy(@NonNull Comparator<? super Tuple2<K, V>> comparator) TreeMap.distinctBy(@NonNull Function<? super Tuple2<K, V>, ? extends U> keyExtractor) TreeMap.drop(int n) TreeMap.dropRight(int n) static <K extends Comparable<? super K>, V>
TreeMap<K, V> TreeMap.empty()Returns the empty TreeMap.static <K,V> TreeMap <K, V> TreeMap.empty(@NonNull Comparator<? super K> keyComparator) Returns the empty TreeMap using the given key comparator.TreeMap.emptyInstance()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(@NonNull Comparator<? super K> keyComparator, int n, @NonNull Supplier<? extends Tuple2<? extends K, ? extends V>> s) Returns a TreeMap containing tuples returned byncalls to a given Suppliers.TreeMap.filter(@NonNull BiPredicate<? super K, ? super V> predicate) TreeMap.filterKeys(@NonNull Predicate<? super K> predicate) TreeMap.filterValues(@NonNull Predicate<? super V> predicate) private static <K,V, K2, V2>
TreeMap<K2, V2> TreeMap.flatMap(@NonNull TreeMap<K, V> map, @NonNull TreeMap.EntryComparator<K2, V2> entryComparator, BiFunction<? super K, ? super V, ? extends Iterable<Tuple2<K2, V2>>> mapper) <K2,V2> TreeMap <K2, V2> TreeMap.flatMap(@NonNull Comparator<? super K2> keyComparator, @NonNull BiFunction<? super K, ? super V, ? extends Iterable<Tuple2<K2, V2>>> mapper) <K2,V2> TreeMap <K2, V2> TreeMap.flatMap(@NonNull BiFunction<? super K, ? super V, ? extends Iterable<Tuple2<K2, V2>>> mapper) TreeMap.init()private static <K,K2, V, V2>
TreeMap<K2, V2> TreeMap.map(@NonNull TreeMap<K, V> map, @NonNull TreeMap.EntryComparator<K2, V2> entryComparator, BiFunction<? super K, ? super V, Tuple2<K2, V2>> mapper) <K2,V2> TreeMap <K2, V2> TreeMap.map(@NonNull Comparator<? super K2> keyComparator, @NonNull BiFunction<? super K, ? super V, Tuple2<K2, V2>> mapper) <K2,V2> TreeMap <K2, V2> TreeMap.map(@NonNull BiFunction<? super K, ? super V, Tuple2<K2, V2>> mapper) TreeMap.mapKeys(@NonNull Function<? super K, ? extends K2> keyMapper, @NonNull BiFunction<? super V, ? super V, ? extends V> valueMerge) TreeMap.merge(@NonNull Map<? extends K, U> that, @NonNull BiFunction<? super V, ? super U, ? extends V> collisionResolution) static <K,V> TreeMap <K, V> Narrows aTreeMap<? extends K, ? extends V>toTreeMap<K, V>via a type-safe cast.static <K extends Comparable<? super K>, V>
TreeMap<K, V> Returns a singletonTreeMap, i.e.static <K,V> TreeMap <K, V> TreeMap.of(@NonNull Comparator<? super K> keyComparator, @NonNull Tuple2<? extends K, ? extends V> entry) Returns a singletonTreeMap, i.e.static <K,V> TreeMap <K, V> TreeMap.of(Comparator<? super K> keyComparator, K key, V value) Returns a singletonTreeMap, i.e.static <K,V> TreeMap <K, V> TreeMap.of(Comparator<? super K> keyComparator, K k1, V v1, K k2, V v2) Creates aTreeMapof 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 aTreeMapof 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 aTreeMapof 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 aTreeMapof 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 aTreeMapof 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 aTreeMapof 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 aTreeMapof 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 aTreeMapof 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 aTreeMapof the given list of key-value pairs.static <K extends Comparable<? super K>, V>
TreeMap<K, V> TreeMap.of(K key, V value) Returns a singletonTreeMap, i.e.static <K extends Comparable<? super K>, V>
TreeMap<K, V> TreeMap.of(K k1, V v1, K k2, V v2) Creates aTreeMapof the given list of key-value pairs.static <K extends Comparable<? super K>, V>
TreeMap<K, V> TreeMap.of(K k1, V v1, K k2, V v2, K k3, V v3) Creates aTreeMapof the given list of key-value pairs.static <K extends 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 aTreeMapof the given list of key-value pairs.static <K extends 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 aTreeMapof the given list of key-value pairs.static <K extends 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 aTreeMapof the given list of key-value pairs.static <K extends 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 aTreeMapof the given list of key-value pairs.static <K extends 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 aTreeMapof the given list of key-value pairs.static <K extends 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 aTreeMapof the given list of key-value pairs.static <K extends 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 aTreeMapof the given list of key-value pairs.static <K,V> TreeMap <K, V> TreeMap.ofAll(@NonNull Comparator<? super K> keyComparator, @NonNull Map<? extends K, ? extends V> map) Returns aTreeMap, from a source java.util.Map.static <T,K, V> TreeMap <K, V> TreeMap.ofAll(@NonNull Comparator<? super K> keyComparator, @NonNull Stream<? extends T> stream, @NonNull Function<? super T, Tuple2<? extends K, ? extends V>> entryMapper) Returns aTreeMap, from entries mapped from stream.static <K extends Comparable<? super K>, V>
TreeMap<K, V> Returns aTreeMap, from a source java.util.Map.static <T,K, V> TreeMap <K, V> TreeMap.ofAll(Comparator<? super K> keyComparator, @NonNull Stream<? extends T> stream, @NonNull Function<? super T, ? extends K> keyMapper, @NonNull Function<? super T, ? extends V> valueMapper) Returns aTreeMap, from entries mapped from stream.static <T, K extends Comparable<? super K>, V>
TreeMap<K, V> TreeMap.ofAll(@NonNull Stream<? extends T> stream, @NonNull Function<? super T, ? extends K> keyMapper, @NonNull Function<? super T, ? extends V> valueMapper) Returns aTreeMap, from entries mapped from stream.static <T, K extends Comparable<? super K>, V>
TreeMap<K, V> TreeMap.ofAll(@NonNull Stream<? extends T> stream, @NonNull Function<? super T, Tuple2<? extends K, ? extends V>> entryMapper) Returns aTreeMap, from entries mapped from stream.static <K extends Comparable<? super K>, V>
TreeMap<K, V> Creates aTreeMapof the given entries using the natural key comparator.static <K extends Comparable<? super K>, V>
TreeMap<K, V> Creates aTreeMapof the given entries.static <K,V> TreeMap <K, V> TreeMap.ofEntries(@NonNull Comparator<? super K> keyComparator, @NonNull Tuple2<? extends K, ? extends V> @NonNull ... entries) Creates aTreeMapof the given entries using the given key comparator.static <K,V> TreeMap <K, V> TreeMap.ofEntries(@NonNull Comparator<? super K> keyComparator, @NonNull Iterable<? extends Tuple2<? extends K, ? extends V>> entries) Creates aTreeMapof the given entries.static <K,V> TreeMap <K, V> TreeMap.ofEntries(@NonNull Comparator<? super K> keyComparator, @NonNull Map.Entry<? extends K, ? extends V> @NonNull ... entries) Creates aTreeMapof the given entries using the given key comparator.static <K extends Comparable<? super K>, V>
TreeMap<K, V> Creates aTreeMapof the given entries using the natural key comparator.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.TreeMap.put(@NonNull Tuple2<? extends K, U> entry, @NonNull BiFunction<? super V, ? super U, ? extends V> merge) TreeMap.put(K key, U value, @NonNull BiFunction<? super V, ? super U, ? extends V> merge) TreeMap.reject(@NonNull BiPredicate<? super K, ? super V> predicate) TreeMap.rejectKeys(@NonNull Predicate<? super K> predicate) TreeMap.rejectValues(@NonNull Predicate<? super V> predicate) TreeMap.removeAll(@NonNull BiPredicate<? super K, ? super V> predicate) Deprecated.TreeMap.removeKeys(@NonNull Predicate<? super K> predicate) Deprecated.TreeMap.removeValues(@NonNull Predicate<? super V> predicate) Deprecated.TreeMap.replaceAll(@NonNull BiFunction<? super K, ? super V, ? extends V> function) TreeMap.replaceValue(K key, V value) TreeMap.scan(@NonNull Tuple2<K, V> zero, @NonNull BiFunction<? super Tuple2<K, V>, ? super Tuple2<K, V>, ? extends Tuple2<K, V>> operation) static <K extends Comparable<? super K>, V>
TreeMap<K, V> TreeMap.tabulate(int n, @NonNull 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.static <K,V> TreeMap <K, V> TreeMap.tabulate(Comparator<? super K> keyComparator, int n, @NonNull 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.TreeMap.tail()TreeMap.take(int n) TreeMap.takeRight(int n) Methods in io.vavr.collection that return types with arguments of type TreeMapModifier and TypeMethodDescriptionstatic <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(@NonNull Comparator<? super K> keyComparator) Returns aCollectorwhich may be used in conjunction withStream.collect(Collector)to obtain aTreeMap.TreeMap.collector(@NonNull Comparator<? super K> keyComparator, @NonNull Function<? super T, ? extends K> keyMapper) Returns aCollectorwhich may be used in conjunction withStream.collect(java.util.stream.Collector)to obtain aTreeMap.TreeMap.collector(@NonNull Comparator<? super K> keyComparator, @NonNull Function<? super T, ? extends K> keyMapper, Function<? super T, ? extends V> valueMapper) Returns aCollectorwhich may be used in conjunction withStream.collect(java.util.stream.Collector)to obtain aTreeMap.static <K extends Comparable<? super K>, V, T extends V>
Collector<T, ArrayList<T>, TreeMap<K, V>> Returns aCollectorwhich may be used in conjunction withStream.collect(java.util.stream.Collector)to obtain aTreeMap.static <K extends Comparable<? super K>, V, T>
Collector<T, ArrayList<T>, TreeMap<K, V>> TreeMap.collector(@NonNull Function<? super T, ? extends K> keyMapper, @NonNull Function<? super T, ? extends V> valueMapper) Returns aCollectorwhich may be used in conjunction withStream.collect(java.util.stream.Collector)to obtain aTreeMap.TreeMap.computeIfAbsent(K key, @NonNull Function<? super K, ? extends V> mappingFunction) TreeMap.computeIfPresent(K key, @NonNull BiFunction<? super K, ? super V, ? extends V> remappingFunction) TreeMap.createCollector(@NonNull TreeMap.EntryComparator<K, V> entryComparator) TreeMap.createCollector(@NonNull TreeMap.EntryComparator<K, V> entryComparator, @NonNull Function<? super T, ? extends K> keyMapper, @NonNull Function<? super T, ? extends V> valueMapper) TreeMap.grouped(int size) TreeMap.initOption()TreeMap.sliding(int size) TreeMap.sliding(int size, int step) TreeMap.tailOption()Methods in io.vavr.collection with parameters of type TreeMapModifier and TypeMethodDescriptionprivate static <K,K2, V, V2>
TreeMap<K2, V2> TreeMap.bimap(@NonNull TreeMap<K, V> map, @NonNull TreeMap.EntryComparator<K2, V2> entryComparator, Function<? super K, ? extends K2> keyMapper, Function<? super V, ? extends V2> valueMapper) private static <K,V, K2, V2>
TreeMap<K2, V2> TreeMap.flatMap(@NonNull TreeMap<K, V> map, @NonNull TreeMap.EntryComparator<K2, V2> entryComparator, BiFunction<? super K, ? super V, ? extends Iterable<Tuple2<K2, V2>>> mapper) private static <K,K2, V, V2>
TreeMap<K2, V2> TreeMap.map(@NonNull TreeMap<K, V> map, @NonNull TreeMap.EntryComparator<K2, V2> entryComparator, BiFunction<? super K, ? super V, Tuple2<K2, V2>> mapper) static <K,V> TreeMap <K, V> Narrows aTreeMap<? extends K, ? extends V>toTreeMap<K, V>via a type-safe cast.