public interface IDiffSortedMap<K,V> extends IDiff<ISortedMap<K,V>>, ISortedMap<K,V>
| Modifier and Type | Interface and Description |
|---|---|
static interface |
IDiffSortedMap.Durable<K,V> |
ISortedMap.Mixin<K,V>| Modifier and Type | Method and Description |
|---|---|
default Comparator<K> |
comparator() |
default OptionalLong |
inclusiveFloorIndex(K key) |
default Iterator<IEntry<K,V>> |
iterator() |
default IEntry<K,V> |
nth(long idx) |
IDiffSortedMap<K,V> |
rebase(ISortedMap<K,V> newUnderlying)
Returns a new diff, which is rebased atop the new underlying collection.
|
ISortedSet<Long> |
segmentOffsets() |
ISortedMap<K,ISortedMap<K,V>> |
segments() |
default long |
size() |
ISortedMap<K,V> |
underlying()
The underlying collection
|
ceil, ceil, ceilIndex, ceilIndex, difference, difference, diffSorted, first, floor, floor, floorIndex, floorIndex, forked, indexOf, intersection, keyEquality, keyHash, keys, last, linear, merge, put, put, remove, slice, slice, sliceIndices, union, updateapply, contains, containsAll, containsAll, containsAny, containsAny, diff, entries, equals, get, get, getOrCreate, hashSortedEntries, intersection, isLinear, iterator, mapValues, save, split, spliterator, stream, toMap, valuesclone, nthISortedMap<K,V> underlying()
IDiffunderlying in interface IDiff<ISortedMap<K,V>>ISortedMap<K,ISortedMap<K,V>> segments()
ISortedSet<Long> segmentOffsets()
IDiffSortedMap<K,V> rebase(ISortedMap<K,V> newUnderlying)
IDiffa.rebase(b).rebase(c) is not necessarily equivalent to a.rebase(c) .rebase in interface IDiff<ISortedMap<K,V>>default Comparator<K> comparator()
comparator in interface ISortedMap<K,V>default long size()
default OptionalLong inclusiveFloorIndex(K key)
inclusiveFloorIndex in interface ISortedMap<K,V>