public static class Slice.SortedSet<V> extends ISortedSet.Mixin<V> implements IDiffSortedSet<V>
IDiffSortedSet.Durable<V>
ISortedSet.Bound, ISortedSet.Mixin<V>
hash
Constructor and Description |
---|
SortedSet(V min,
ISortedSet.Bound minBound,
V max,
ISortedSet.Bound maxBound,
ISortedMap<V,Void> underlying) |
Modifier and Type | Method and Description |
---|---|
IDiffSortedMap<V,Void> |
diffMap() |
IDiffSortedSet<V> |
rebase(ISortedSet<V> newUnderlying)
Returns a new diff, which is rebased atop the new underlying collection.
|
IDiffSortedSet<V> |
slice(V min,
ISortedSet.Bound minBound,
V max,
ISortedSet.Bound maxBound) |
clone
equals, hashCode, toString
finalize, getClass, notify, notifyAll, wait, wait, wait
comparator, inclusiveFloorIndex, iterator, nth, size, underlying
add, ceil, ceilIndex, ceilIndex, difference, diffSorted, first, floor, floorIndex, floorIndex, forked, indexOf, intersection, last, linear, remove, slice, sliceIndices, union, valueEquality, valueHash, zip
contains, containsAll, containsAll, containsAny, containsAny, diff, elements, isLinear, iterator, split, spliterator, stream, test, toArray, toArray, toSet
clone, nth, save
public SortedSet(V min, ISortedSet.Bound minBound, V max, ISortedSet.Bound maxBound, ISortedMap<V,Void> underlying)
public IDiffSortedMap<V,Void> diffMap()
diffMap
in interface IDiffSortedSet<V>
public IDiffSortedSet<V> slice(V min, ISortedSet.Bound minBound, V max, ISortedSet.Bound maxBound)
slice
in interface ISortedSet<V>
public IDiffSortedSet<V> rebase(ISortedSet<V> newUnderlying)
IDiff
a.rebase(b).rebase(c)
is not necessarily equivalent to a.rebase(c)
.rebase
in interface IDiff<ISortedSet<V>>
rebase
in interface IDiffSortedSet<V>