@InterfaceAudience.Private public class CellSet extends Object implements NavigableSet<Cell>
Set of Cells, 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.| 限定符和类型 | 字段和说明 |
|---|---|
static int |
UNKNOWN_NUM_UNIQUES |
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, waitspliteratorparallelStream, removeIf, streampublic static final int UNKNOWN_NUM_UNIQUES
public Cell ceiling(Cell e)
ceiling 在接口中 NavigableSet<Cell>public Iterator<Cell> descendingIterator()
descendingIterator 在接口中 NavigableSet<Cell>public NavigableSet<Cell> descendingSet()
descendingSet 在接口中 NavigableSet<Cell>public Cell floor(Cell e)
floor 在接口中 NavigableSet<Cell>public NavigableSet<Cell> headSet(Cell toElement, boolean inclusive)
headSet 在接口中 NavigableSet<Cell>public Cell higher(Cell e)
higher 在接口中 NavigableSet<Cell>public Cell lower(Cell e)
lower 在接口中 NavigableSet<Cell>public Cell pollFirst()
pollFirst 在接口中 NavigableSet<Cell>public Cell pollLast()
pollLast 在接口中 NavigableSet<Cell>public NavigableSet<Cell> subSet(Cell fromElement, boolean fromInclusive, Cell toElement, boolean toInclusive)
subSet 在接口中 NavigableSet<Cell>public NavigableSet<Cell> tailSet(Cell fromElement, boolean inclusive)
tailSet 在接口中 NavigableSet<Cell>public Comparator<? super Cell> comparator()
comparator 在接口中 SortedSet<Cell>public boolean addAll(Collection<? extends Cell> c)
public boolean contains(Object o)
public boolean containsAll(Collection<?> c)
containsAll 在接口中 Collection<Cell>containsAll 在接口中 Set<Cell>public boolean removeAll(Collection<?> c)
public boolean retainAll(Collection<?> c)
public <T> T[] toArray(T[] a)
public int getNumUniqueKeys()
Copyright © 2007–2019 The Apache Software Foundation. All rights reserved.