| Modifier and Type | Method and Description |
|---|---|
IMap<K,V> |
added()
Entries which have been added to the underlying data structure, some of which may shadow underlying entries.
|
default V |
get(K key,
V defaultValue) |
default OptionalLong |
indexOf(K key) |
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() |
IMap<K,V> |
underlying()
The baseline data structure.
|
apply, contains, containsAll, containsAll, containsAny, containsAny, difference, difference, entries, equals, forked, get, getOrCreate, hashSortedEntries, intersection, intersection, isLinear, keys, linear, mapValues, merge, put, put, remove, save, split, spliterator, stream, toMap, union, update, valuesclone, nth, saveIMap<K,V> added()
ISortedSet<Long> removedIndices()
default ToLongFunction<K> keyHash()
default BiPredicate<K,K> keyEquality()
keyEquality in interface IMap<K,V>default OptionalLong indexOf(K key)
default long size()