@NotNull PersistentTreeMap<K,V> |
PersistentTreeMap.assoc(K key,
V val) |
Returns a new map with the given key/value added.
|
static <K extends Comparable<K>,V> PersistentTreeMap<K,V> |
PersistentTreeMap.empty() |
Be extremely careful with this because it uses the default comparator, which only works for
items that implement Comparable (have a "natural ordering").
|
static <K,V> PersistentTreeMap<K,V> |
PersistentTreeMap.empty(Comparator<? super K> c) |
Returns a new empty PersistentTreeMap that will use the specified comparator.
|
static <K extends Comparable<K>,V> PersistentTreeMap<K,V> |
PersistentTreeMap.of(Iterable<Map.Entry<K,V>> es) |
Returns a new PersistentTreeMap of the given comparable keys and their paired values, skipping
any null Entries.
|
static <K,V> PersistentTreeMap<K,V> |
PersistentTreeMap.ofComp(Comparator<? super K> comp,
Iterable<Map.Entry<K,V>> kvPairs) |
Returns a new PersistentTreeMap of the specified comparator and the given key/value pairs.
|
@NotNull PersistentTreeMap<K,V> |
PersistentTreeMap.without(K key) |
Returns a new map with the given key/value removed
|