@Beta protected class ForwardingNavigableMap.StandardNavigableKeySet extends AbstractSet<E>
A sensible implementation of NavigableMap.navigableKeySet() in terms of the methods of this NavigableMap. In many cases, you may wish to override ForwardingNavigableMap.navigableKeySet() to forward to this implementation or a subclass thereof.
| Constructor and Description |
|---|
StandardNavigableKeySet()
Constructor for use by subclasses.
|
| Modifier and Type | Method and Description |
|---|---|
K |
ceiling(K e) |
void |
clear() |
Comparator<? super K> |
comparator() |
boolean |
contains(Object o) |
Iterator<K> |
descendingIterator() |
NavigableSet<K> |
descendingSet() |
K |
first() |
K |
floor(K e) |
SortedSet<K> |
headSet(K toElement) |
NavigableSet<K> |
headSet(K toElement,
boolean inclusive) |
K |
higher(K e) |
boolean |
isEmpty() |
Iterator<K> |
iterator() |
K |
last() |
K |
lower(K e) |
K |
pollFirst() |
K |
pollLast() |
boolean |
remove(Object o) |
boolean |
removeAll(Collection<?> c) |
boolean |
retainAll(Collection<?> c) |
int |
size() |
NavigableSet<K> |
subSet(K fromElement,
boolean fromInclusive,
K toElement,
boolean toInclusive) |
SortedSet<K> |
subSet(K fromElement,
K toElement) |
SortedSet<K> |
tailSet(K fromElement) |
NavigableSet<K> |
tailSet(K fromElement,
boolean inclusive) |
equals, hashCodeadd, addAll, containsAll, toArray, toArray, toStringclone, finalize, getClass, notify, notifyAll, wait, wait, waititeratorcomparator, first, last, spliteratoradd, addAll, clear, contains, containsAll, equals, hashCode, isEmpty, remove, removeAll, retainAll, size, toArray, toArrayparallelStream, removeIf, streampublic StandardNavigableKeySet()
Constructor for use by subclasses.
public K lower(K e)
lower in interface NavigableSet<K>public K floor(K e)
floor in interface NavigableSet<K>public K ceiling(K e)
ceiling in interface NavigableSet<K>public K higher(K e)
higher in interface NavigableSet<K>public K pollFirst()
pollFirst in interface NavigableSet<K>public K pollLast()
pollLast in interface NavigableSet<K>public NavigableSet<K> descendingSet()
descendingSet in interface NavigableSet<K>public Iterator<K> descendingIterator()
descendingIterator in interface NavigableSet<K>public NavigableSet<K> subSet(K fromElement, boolean fromInclusive, K toElement, boolean toInclusive)
subSet in interface NavigableSet<K>public NavigableSet<K> headSet(K toElement, boolean inclusive)
headSet in interface NavigableSet<K>public NavigableSet<K> tailSet(K fromElement, boolean inclusive)
tailSet in interface NavigableSet<K>public Comparator<? super K> comparator()
comparator in interface SortedSet<K>public int size()
size in interface Collection<K>size in interface Set<K>size in class AbstractCollection<K>public boolean isEmpty()
isEmpty in interface Collection<K>isEmpty in interface Set<K>isEmpty in class AbstractCollection<K>public boolean contains(Object o)
contains in interface Collection<K>contains in interface Set<K>contains in class AbstractCollection<K>public boolean remove(Object o)
remove in interface Collection<K>remove in interface Set<K>remove in class AbstractCollection<K>public void clear()
clear in interface Collection<K>clear in interface Set<K>clear in class AbstractCollection<K>public boolean removeAll(Collection<?> c)
removeAll in interface Collection<E>removeAll in interface Set<E>removeAll in class AbstractSet<E>public boolean retainAll(Collection<?> c)
retainAll in interface Collection<E>retainAll in interface Set<E>retainAll in class AbstractCollection<E>