io.lacuna.bifurcan

Interface IDiffSortedSet<V>

All Superinterfaces:

ICollection<ISet<V>,V>, IDiff<ISortedSet<V>>, ISet<V>, ISortedSet<V>, Iterable<V>, Predicate<V>

All Known Subinterfaces:

IDiffSortedSet.Durable<V>

All Known Implementing Classes:

DiffSortedSet, Slice.SortedSet

public interface IDiffSortedSet<V>
extends IDiff<ISortedSet<V>>, ISortedSet<V>

Nested Class Summary

Nested Classes

Modifier and Type	Interface and Description
static interface	IDiffSortedSet.Durable<V>

Nested classes/interfaces inherited from interface io.lacuna.bifurcan.ISortedSet

ISortedSet.Bound, ISortedSet.Mixin<V>

Method Summary

Modifier and Type	Method and Description
default Comparator<V>	comparator()
IDiffSortedMap<V,Void>	diffMap()
default OptionalLong	inclusiveFloorIndex(V value)
default Iterator<V>	iterator()
default V	nth(long idx)
IDiffSortedSet<V>	rebase(ISortedSet<V> newUnderlying) Returns a new diff, which is rebased atop the new underlying collection.
default long	size()
default ISortedSet<V>	underlying() The underlying collection

Methods inherited from interface io.lacuna.bifurcan.ISortedSet

add, ceil, ceilIndex, ceilIndex, difference, diffSorted, first, floor, floorIndex, floorIndex, forked, indexOf, intersection, last, linear, remove, slice, slice, sliceIndices, union, valueEquality, valueHash, zip

Methods inherited from interface io.lacuna.bifurcan.ISet

contains, containsAll, containsAll, containsAny, containsAny, diff, elements, isLinear, iterator, split, spliterator, stream, test, toArray, toArray, toSet

Methods inherited from interface io.lacuna.bifurcan.ICollection

clone, nth, save

Methods inherited from interface java.lang.Iterable

forEach

Methods inherited from interface java.util.function.Predicate

and, isEqual, negate, or

Method Detail

diffMap

IDiffSortedMap<V,Void> diffMap()

rebase

IDiffSortedSet<V> rebase(ISortedSet<V> newUnderlying)

Description copied from interface: IDiff

Returns a new diff, which is rebased atop the new underlying collection. The returned diff may not reflect any changes which cannot be applied to the new collection (removing an element which isn't present in the new collection, for instance), and so a.rebase(b).rebase(c) is not necessarily equivalent to a.rebase(c) .

Specified by:

rebase in interface IDiff<ISortedSet<V>>

underlying

default ISortedSet<V> underlying()

Description copied from interface: IDiff

The underlying collection

Specified by:

underlying in interface IDiff<ISortedSet<V>>

comparator

default Comparator<V> comparator()

Specified by:

comparator in interface ISortedSet<V>

size

default long size()

Specified by:

size in interface ICollection<ISet<V>,V>

Returns:

the number of elements in the collection

inclusiveFloorIndex

default OptionalLong inclusiveFloorIndex(V value)

Specified by:

inclusiveFloorIndex in interface ISortedSet<V>

Returns:

the entry whose key is either equal to key, or just below it. If key is less than the minimum value in the map, returns null.

nth

default V nth(long idx)

Specified by:

nth in interface ICollection<ISet<V>,V>

Returns:

the element at idx

iterator

default Iterator<V> iterator()

Specified by:

iterator in interface ICollection<ISet<V>,V>

Specified by:

iterator in interface Iterable<V>