@InterfaceAudience.Private public class CellSkipListSet extends java.lang.Object implements java.util.NavigableSet<Cell>
Set
of Cell
s implemented on top of a
ConcurrentSkipListMap
. Works like a
ConcurrentSkipListSet
in all but one regard:
An add will overwrite if already an entry for the added key. In other words,
where CSLS does "Adds the specified element to this set if it is not already
present.", this implementation "Adds the specified element to this set EVEN
if it is already present overwriting what was there previous". The call to
add returns true if no value in the backing map or false if there was an
entry with same key (though value may be different).
Otherwise, has same attributes as ConcurrentSkipListSet: e.g. tolerant of concurrent get and set and won't throw ConcurrentModificationException when iterating.
Modifier and Type | Method and Description |
---|---|
boolean |
add(Cell e) |
boolean |
addAll(java.util.Collection<? extends Cell> c) |
Cell |
ceiling(Cell e) |
void |
clear() |
java.util.Comparator<? super Cell> |
comparator() |
boolean |
contains(java.lang.Object o) |
boolean |
containsAll(java.util.Collection<?> c) |
java.util.Iterator<Cell> |
descendingIterator() |
java.util.NavigableSet<Cell> |
descendingSet() |
Cell |
first() |
Cell |
floor(Cell e) |
Cell |
get(Cell kv) |
java.util.SortedSet<Cell> |
headSet(Cell toElement) |
java.util.NavigableSet<Cell> |
headSet(Cell toElement,
boolean inclusive) |
Cell |
higher(Cell e) |
boolean |
isEmpty() |
java.util.Iterator<Cell> |
iterator() |
Cell |
last() |
Cell |
lower(Cell e) |
Cell |
pollFirst() |
Cell |
pollLast() |
boolean |
remove(java.lang.Object o) |
boolean |
removeAll(java.util.Collection<?> c) |
boolean |
retainAll(java.util.Collection<?> c) |
int |
size() |
java.util.NavigableSet<Cell> |
subSet(Cell fromElement,
boolean fromInclusive,
Cell toElement,
boolean toInclusive) |
java.util.SortedSet<Cell> |
subSet(Cell fromElement,
Cell toElement) |
java.util.SortedSet<Cell> |
tailSet(Cell fromElement) |
java.util.NavigableSet<Cell> |
tailSet(Cell fromElement,
boolean inclusive) |
java.lang.Object[] |
toArray() |
<T> T[] |
toArray(T[] a) |
public java.util.Iterator<Cell> descendingIterator()
descendingIterator
in interface java.util.NavigableSet<Cell>
public java.util.NavigableSet<Cell> descendingSet()
descendingSet
in interface java.util.NavigableSet<Cell>
public java.util.NavigableSet<Cell> headSet(Cell toElement, boolean inclusive)
headSet
in interface java.util.NavigableSet<Cell>
public java.util.Iterator<Cell> iterator()
public java.util.NavigableSet<Cell> subSet(Cell fromElement, boolean fromInclusive, Cell toElement, boolean toInclusive)
subSet
in interface java.util.NavigableSet<Cell>
public java.util.NavigableSet<Cell> tailSet(Cell fromElement, boolean inclusive)
tailSet
in interface java.util.NavigableSet<Cell>
public java.util.Comparator<? super Cell> comparator()
comparator
in interface java.util.SortedSet<Cell>
public boolean add(Cell e)
public boolean addAll(java.util.Collection<? extends Cell> c)
public void clear()
public boolean contains(java.lang.Object o)
public boolean containsAll(java.util.Collection<?> c)
public boolean isEmpty()
public boolean remove(java.lang.Object o)
public boolean removeAll(java.util.Collection<?> c)
public boolean retainAll(java.util.Collection<?> c)
public int size()
public java.lang.Object[] toArray()