@NotNull @Override public SortedMap<K, V> take(int number) { return new TreeMap<K, V>(redBlackTree.take(tree, number), redBlackTree); }
@NotNull @Override public SortedMap<K, V> from(@NotNull K key, boolean inclusive) { return new TreeMap<K, V>(redBlackTree.from(tree, key, inclusive), redBlackTree); }
@NotNull @Override public TreeMap<K, V> remove(@NotNull K key) { return new TreeMap<K, V>(redBlackTree.delete(tree, key), redBlackTree); }
@NotNull @Override public TreeMap<K, V> put(@NotNull K key, V value) { return new TreeMap<K, V>(redBlackTree.update(tree, key, value, true), redBlackTree); }
@NotNull @Override public TreeMap<K, V> remove(@NotNull K key) { return new TreeMap<K, V>(redBlackTree.delete(tree, key), redBlackTree); }
@NotNull @Override public SortedMap<K, V> drop(int number) { return new TreeMap<K, V>(redBlackTree.drop(tree, number), redBlackTree); }
@NotNull @Override public TreeMap<K, V> remove(@NotNull K key) { return new TreeMap<K, V>(redBlackTree.delete(tree, key), redBlackTree); }
@NotNull @Override public SortedMap<K, V> drop(int number) { return new TreeMap<K, V>(redBlackTree.drop(tree, number), redBlackTree); }
@NotNull @Override public SortedMap<K, V> from(@NotNull K key, boolean inclusive) { return new TreeMap<K, V>(redBlackTree.from(tree, key, inclusive), redBlackTree); }
@NotNull @Override public SortedMap<K, V> to(@NotNull K key, boolean inclusive) { return new TreeMap<K, V>(redBlackTree.until(tree, key, inclusive), redBlackTree); }
@NotNull @Override public SortedMap<K, V> range(@NotNull K from, boolean fromInclusive, @NotNull K to, boolean toInclusive) { return new TreeMap<K, V>(redBlackTree.range(tree, from, fromInclusive, to, toInclusive), redBlackTree); }
@NotNull @Override public TreeMap<K, V> put(@NotNull K key, V value) { return new TreeMap<K, V>(redBlackTree.update(tree, key, value, true), redBlackTree); }
@NotNull @Override public SortedMap<K, V> to(@NotNull K key, boolean inclusive) { return new TreeMap<K, V>(redBlackTree.until(tree, key, inclusive), redBlackTree); }
@NotNull @Override public SortedMap<K, V> from(@NotNull K key, boolean inclusive) { return new TreeMap<K, V>(redBlackTree.from(tree, key, inclusive), redBlackTree); }
@NotNull public static <K, V> SortedMap<K, V> copyOf(Comparator<? super K> comparator, Pair<K, V>[] pairs) { SortedMap<K, V> result = new TreeMap<K, V>(comparator, null); for (Pair<K, V> pair : pairs) { result = result.put(pair.component1(), pair.component2()); } return result; }
@NotNull public static <K, V> SortedMap<K, V> copyOf(Comparator<? super K> comparator, java.lang.Iterable<Pair<K, V>> iterable) { SortedMap<K, V> result = new TreeMap<K, V>(comparator, null); for (Pair<K, V> pair : iterable) { result = result.put(pair.component1(), pair.component2()); } return result; }
@NotNull public static <K, V> SortedMap<K, V> copyOf(Comparator<? super K> comparator, java.lang.Iterable<Pair<K, V>> iterable) { SortedMap<K, V> result = new TreeMap<K, V>(comparator, null); for (Pair<K, V> pair : iterable) { result = result.put(pair.component1(), pair.component2()); } return result; }
private static <K, V> SortedMap<K, V> construct(Comparator<? super K> comparator, Pair<K, V>... pairs) { SortedMap<K, V> map = new TreeMap<K, V>(comparator, null); for (Pair<K, V> pair : pairs) { map = map.put(pair.component1(), pair.component2()); } return map; }
private static <K, V> SortedMap<K, V> construct(Comparator<? super K> comparator, Pair<K, V>... pairs) { SortedMap<K, V> map = new TreeMap<K, V>(comparator, null); for (Pair<K, V> pair : pairs) { map = map.put(pair.component1(), pair.component2()); } return map; }
private static <K extends Comparable<? super K>, V> SortedMap<K, V> construct(Pair<K, V>... pairs) { SortedMap<K, V> map = new TreeMap<K, V>(); for (Pair<K, V> pair : pairs) { map = map.put(pair.component1(), pair.component2()); } return map; }