public static class Slice.SortedMap<K,V> extends ISortedMap.Mixin<K,V> implements IDiffSortedMap<K,V>
IDiffSortedMap.Durable<K,V>ISortedMap.Mixin<K,V>hash| Constructor and Description |
|---|
SortedMap(ISortedMap<K,V> underlying,
K min,
ISortedSet.Bound minBound,
K max,
ISortedSet.Bound maxBound) |
| Modifier and Type | Method and Description |
|---|---|
Slice.SortedMap<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() |
Slice.SortedMap<K,V> |
slice(K min,
ISortedSet.Bound minBound,
K max,
ISortedSet.Bound maxBound) |
ISortedMap<K,V> |
underlying()
The underlying collection
|
cloneequals, hashCode, toStringfinalize, getClass, notify, notifyAll, wait, wait, waitcomparator, inclusiveFloorIndex, iterator, nth, sizeceil, ceil, ceilIndex, ceilIndex, difference, difference, diffSorted, first, floor, floor, floorIndex, floorIndex, forked, indexOf, intersection, keyEquality, keyHash, keys, last, linear, merge, put, put, remove, 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, nthpublic SortedMap(ISortedMap<K,V> underlying, K min, ISortedSet.Bound minBound, K max, ISortedSet.Bound maxBound)
public Slice.SortedMap<K,V> slice(K min, ISortedSet.Bound minBound, K max, ISortedSet.Bound maxBound)
slice in interface ISortedMap<K,V>public ISortedMap<K,V> underlying()
IDiffunderlying in interface IDiff<ISortedMap<K,V>>underlying in interface IDiffSortedMap<K,V>public ISortedMap<K,ISortedMap<K,V>> segments()
segments in interface IDiffSortedMap<K,V>public ISortedSet<Long> segmentOffsets()
segmentOffsets in interface IDiffSortedMap<K,V>public Slice.SortedMap<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>>rebase in interface IDiffSortedMap<K,V>