public class CellSet
extends java.lang.Object
implements java.util.NavigableSet<Cell>
Set
of Cell
s, where an add will overwrite the entry if already
exists in the set. 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).
implementation is tolerant of concurrent get and set and won't throw
ConcurrentModificationException when iterating.Modifier and Type | Field and Description |
---|---|
static int |
UNKNOWN_NUM_UNIQUES |
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) |
int |
getNumUniqueKeys() |
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 static final int UNKNOWN_NUM_UNIQUES
public Cell ceiling(Cell e)
ceiling
in interface java.util.NavigableSet<Cell>
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 Cell floor(Cell e)
floor
in interface java.util.NavigableSet<Cell>
public java.util.SortedSet<Cell> headSet(Cell toElement)
headSet
in interface java.util.NavigableSet<Cell>
headSet
in interface java.util.SortedSet<Cell>
public java.util.NavigableSet<Cell> headSet(Cell toElement, boolean inclusive)
headSet
in interface java.util.NavigableSet<Cell>
public Cell higher(Cell e)
higher
in interface java.util.NavigableSet<Cell>
public java.util.Iterator<Cell> iterator()
iterator
in interface java.lang.Iterable<Cell>
iterator
in interface java.util.Collection<Cell>
iterator
in interface java.util.NavigableSet<Cell>
iterator
in interface java.util.Set<Cell>
public Cell lower(Cell e)
lower
in interface java.util.NavigableSet<Cell>
public Cell pollFirst()
pollFirst
in interface java.util.NavigableSet<Cell>
public Cell pollLast()
pollLast
in interface java.util.NavigableSet<Cell>
public java.util.SortedSet<Cell> subSet(Cell fromElement, Cell toElement)
subSet
in interface java.util.NavigableSet<Cell>
subSet
in interface java.util.SortedSet<Cell>
public java.util.NavigableSet<Cell> subSet(Cell fromElement, boolean fromInclusive, Cell toElement, boolean toInclusive)
subSet
in interface java.util.NavigableSet<Cell>
public java.util.SortedSet<Cell> tailSet(Cell fromElement)
tailSet
in interface java.util.NavigableSet<Cell>
tailSet
in interface java.util.SortedSet<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 Cell first()
first
in interface java.util.SortedSet<Cell>
public Cell last()
last
in interface java.util.SortedSet<Cell>
public boolean add(Cell e)
add
in interface java.util.Collection<Cell>
add
in interface java.util.Set<Cell>
public boolean addAll(java.util.Collection<? extends Cell> c)
addAll
in interface java.util.Collection<Cell>
addAll
in interface java.util.Set<Cell>
public void clear()
clear
in interface java.util.Collection<Cell>
clear
in interface java.util.Set<Cell>
public boolean contains(java.lang.Object o)
contains
in interface java.util.Collection<Cell>
contains
in interface java.util.Set<Cell>
public boolean containsAll(java.util.Collection<?> c)
containsAll
in interface java.util.Collection<Cell>
containsAll
in interface java.util.Set<Cell>
public boolean isEmpty()
isEmpty
in interface java.util.Collection<Cell>
isEmpty
in interface java.util.Set<Cell>
public boolean remove(java.lang.Object o)
remove
in interface java.util.Collection<Cell>
remove
in interface java.util.Set<Cell>
public boolean removeAll(java.util.Collection<?> c)
removeAll
in interface java.util.Collection<Cell>
removeAll
in interface java.util.Set<Cell>
public boolean retainAll(java.util.Collection<?> c)
retainAll
in interface java.util.Collection<Cell>
retainAll
in interface java.util.Set<Cell>
public Cell get(Cell kv)
public int size()
size
in interface java.util.Collection<Cell>
size
in interface java.util.Set<Cell>
public java.lang.Object[] toArray()
toArray
in interface java.util.Collection<Cell>
toArray
in interface java.util.Set<Cell>
public <T> T[] toArray(T[] a)
toArray
in interface java.util.Collection<Cell>
toArray
in interface java.util.Set<Cell>
public int getNumUniqueKeys()