public interface IDiffSortedMap<K,V> extends ISortedMap<K,V>
| Modifier and Type | Method and Description |
|---|---|
ISortedMap<K,V> |
added()
Entries which have been added to the underlying data structure, some of which may shadow underlying entries.
|
ISortedMap<Long,K> |
addedKeys()
The indices of the added keys within the combined data structure.
|
default IEntry<K,V> |
ceil(K key) |
default Comparator<K> |
comparator() |
default IEntry<K,V> |
floor(K key) |
default V |
get(K key,
V defaultValue) |
default Iterator<IEntry<K,V>> |
iterator() |
default BiPredicate<K,K> |
keyEquality() |
default ToLongFunction<K> |
keyHash() |
default IEntry<K,V> |
nth(long idx) |
ISortedSet<Long> |
removedIndices()
Indices which have been removed or shadowed from the underlying data structure.
|
default long |
size() |
ISortedMap<K,V> |
underlying()
The baseline data structure.
|
difference, difference, first, forked, intersection, last, linear, merge, put, put, remove, slice, union, updateapply, contains, containsAll, containsAll, containsAny, containsAny, entries, equals, get, getOrCreate, hashSortedEntries, indexOf, intersection, isLinear, keys, mapValues, save, split, spliterator, stream, toMap, valuesclone, nth, saveISortedMap<K,V> underlying()
ISortedMap<K,V> added()
ISortedMap<Long,K> addedKeys()
ISortedSet<Long> removedIndices()
default ToLongFunction<K> keyHash()
default BiPredicate<K,K> keyEquality()
keyEquality in interface IMap<K,V>default Comparator<K> comparator()
comparator in interface ISortedMap<K,V>default long size()
default IEntry<K,V> floor(K key)
floor in interface ISortedMap<K,V>key, or just below it. If key is less than the
minimum value in the map, returns null.default IEntry<K,V> ceil(K key)
ceil in interface ISortedMap<K,V>key, or just above it. If key is greater than the
maximum value in the map, returns null.