@Beta protected class ForwardingNavigableMap.StandardNavigableKeySet extends AbstractSet<E>
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)
Returns the least element in this set greater than or equal to
the given element, or
null if there is no such element. |
void |
clear()
Removes all of the elements from this collection (optional operation).
|
Comparator<? super K> |
comparator()
Returns the comparator used to order the elements in this set,
or null if this set uses the natural ordering of its elements.
|
boolean |
contains(Object o)
Returns true if this collection contains the specified element.
|
Iterator<K> |
descendingIterator()
Returns an iterator over the elements in this set, in descending order.
|
NavigableSet<K> |
descendingSet()
Returns a reverse order view of the elements contained in this set.
|
K |
first()
Returns the first (lowest) element currently in this set.
|
K |
floor(K e)
Returns the greatest element in this set less than or equal to
the given element, or
null if there is no such element. |
void |
forEach(Consumer<? super K> action)
Performs the given action for each element of the
Iterable
until all elements have been processed or the action throws an
exception. |
SortedSet<K> |
headSet(K toElement)
Returns a view of the portion of this set whose elements are
strictly less than toElement.
|
NavigableSet<K> |
headSet(K toElement,
boolean inclusive)
Returns a view of the portion of this set whose elements are less than
(or equal to, if
inclusive is true) toElement. |
K |
higher(K e)
Returns the least element in this set strictly greater than the
given element, or
null if there is no such element. |
boolean |
isEmpty()
Returns true if this collection contains no elements.
|
Iterator<K> |
iterator()
Returns an iterator over the elements contained in this collection.
|
K |
last()
Returns the last (highest) element currently in this set.
|
K |
lower(K e)
Returns the greatest element in this set strictly less than the
given element, or
null if there is no such element. |
K |
pollFirst()
Retrieves and removes the first (lowest) element,
or returns
null if this set is empty. |
K |
pollLast()
Retrieves and removes the last (highest) element,
or returns
null if this set is empty. |
boolean |
remove(Object o)
Removes a single instance of the specified element from this
collection, if it is present (optional operation).
|
boolean |
removeAll(Collection<?> c)
Removes from this set all of its elements that are contained in the
specified collection (optional operation).
|
boolean |
retainAll(Collection<?> c)
Retains only the elements in this collection that are contained in the
specified collection (optional operation).
|
int |
size()
Returns the number of elements in this collection.
|
NavigableSet<K> |
subSet(K fromElement,
boolean fromInclusive,
K toElement,
boolean toInclusive)
Returns a view of the portion of this set whose elements range from
fromElement to toElement. |
SortedSet<K> |
subSet(K fromElement,
K toElement)
Returns a view of the portion of this set whose elements range
from fromElement, inclusive, to toElement,
exclusive.
|
SortedSet<K> |
tailSet(K fromElement)
Returns a view of the portion of this set whose elements are
greater than or equal to fromElement.
|
NavigableSet<K> |
tailSet(K fromElement,
boolean inclusive)
Returns a view of the portion of this set whose elements are greater
than (or equal to, if
inclusive is true) fromElement. |
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()
public K lower(K e)
java.util.NavigableSetnull if there is no such element.lower in interface NavigableSet<K>e - the value to matche,
or null if there is no such elementpublic K floor(K e)
java.util.NavigableSetnull if there is no such element.floor in interface NavigableSet<K>e - the value to matche,
or null if there is no such elementpublic K ceiling(K e)
java.util.NavigableSetnull if there is no such element.ceiling in interface NavigableSet<K>e - the value to matche,
or null if there is no such elementpublic K higher(K e)
java.util.NavigableSetnull if there is no such element.higher in interface NavigableSet<K>e - the value to matche,
or null if there is no such elementpublic K pollFirst()
java.util.NavigableSetnull if this set is empty.pollFirst in interface NavigableSet<K>null if this set is emptypublic K pollLast()
java.util.NavigableSetnull if this set is empty.pollLast in interface NavigableSet<K>null if this set is emptypublic NavigableSet<K> descendingSet()
java.util.NavigableSetremove operation), the results of
the iteration are undefined.
The returned set has an ordering equivalent to
Collections.reverseOrder(comparator()).
The expression s.descendingSet().descendingSet() returns a
view of s essentially equivalent to s.
descendingSet in interface NavigableSet<K>public Iterator<K> descendingIterator()
java.util.NavigableSetdescendingSet().iterator().descendingIterator in interface NavigableSet<K>public NavigableSet<K> subSet(K fromElement, boolean fromInclusive, K toElement, boolean toInclusive)
java.util.NavigableSetfromElement to toElement. If fromElement and
toElement are equal, the returned set is empty unless fromInclusive and toInclusive are both true. The returned set
is backed by this set, so changes in the returned set are reflected in
this set, and vice-versa. The returned set supports all optional set
operations that this set supports.
The returned set will throw an IllegalArgumentException
on an attempt to insert an element outside its range.
subSet in interface NavigableSet<K>fromElement - low endpoint of the returned setfromInclusive - true if the low endpoint
is to be included in the returned viewtoElement - high endpoint of the returned settoInclusive - true if the high endpoint
is to be included in the returned viewfromElement, inclusive, to toElement, exclusivepublic SortedSet<K> subSet(K fromElement, K toElement)
java.util.SortedSetThe returned set will throw an IllegalArgumentException on an attempt to insert an element outside its range.
subSet in interface NavigableSet<K>subSet in interface SortedSet<K>fromElement - low endpoint (inclusive) of the returned settoElement - high endpoint (exclusive) of the returned setpublic NavigableSet<K> headSet(K toElement, boolean inclusive)
java.util.NavigableSetinclusive is true) toElement. The
returned set is backed by this set, so changes in the returned set are
reflected in this set, and vice-versa. The returned set supports all
optional set operations that this set supports.
The returned set will throw an IllegalArgumentException
on an attempt to insert an element outside its range.
headSet in interface NavigableSet<K>toElement - high endpoint of the returned setinclusive - true if the high endpoint
is to be included in the returned viewinclusive is true) toElementpublic SortedSet<K> headSet(K toElement)
java.util.SortedSetThe returned set will throw an IllegalArgumentException on an attempt to insert an element outside its range.
headSet in interface NavigableSet<K>headSet in interface SortedSet<K>toElement - high endpoint (exclusive) of the returned setpublic NavigableSet<K> tailSet(K fromElement, boolean inclusive)
java.util.NavigableSetinclusive is true) fromElement.
The returned set is backed by this set, so changes in the returned set
are reflected in this set, and vice-versa. The returned set supports
all optional set operations that this set supports.
The returned set will throw an IllegalArgumentException
on an attempt to insert an element outside its range.
tailSet in interface NavigableSet<K>fromElement - low endpoint of the returned setinclusive - true if the low endpoint
is to be included in the returned viewfromElementpublic SortedSet<K> tailSet(K fromElement)
java.util.SortedSetThe returned set will throw an IllegalArgumentException on an attempt to insert an element outside its range.
tailSet in interface NavigableSet<K>tailSet in interface SortedSet<K>fromElement - low endpoint (inclusive) of the returned setpublic Comparator<? super K> comparator()
java.util.SortedSetcomparator in interface SortedSet<K>public K first()
java.util.SortedSetpublic K last()
java.util.SortedSetpublic Iterator<K> iterator()
java.util.AbstractCollectioniterator in interface Iterable<K>iterator in interface Collection<K>iterator in interface Set<K>iterator in class AbstractCollection<K>public void forEach(Consumer<? super K> action)
java.lang.IterableIterable
until all elements have been processed or the action throws an
exception. Unless otherwise specified by the implementing class,
actions are performed in the order of iteration (if an iteration order
is specified). Exceptions thrown by the action are relayed to the
caller.action - The action to be performed for each elementpublic int size()
java.util.Collectionsize in interface Collection<K>size in interface Set<K>size in class AbstractCollection<K>public boolean isEmpty()
java.util.AbstractCollectionThis implementation returns size() == 0.
isEmpty in interface Collection<K>isEmpty in interface Set<K>isEmpty in class AbstractCollection<K>public boolean contains(Object o)
java.util.AbstractCollectionThis implementation iterates over the elements in the collection, checking each element in turn for equality with the specified element.
contains in interface Collection<K>contains in interface Set<K>contains in class AbstractCollection<K>o - element whose presence in this collection is to be testedpublic boolean remove(Object o)
java.util.AbstractCollectionThis implementation iterates over the collection looking for the specified element. If it finds the element, it removes the element from the collection using the iterator's remove method.
Note that this implementation throws an UnsupportedOperationException if the iterator returned by this collection's iterator method does not implement the remove method and this collection contains the specified object.
remove in interface Collection<K>remove in interface Set<K>remove in class AbstractCollection<K>o - element to be removed from this collection, if presentpublic void clear()
java.util.AbstractCollectionThis implementation iterates over this collection, removing each element using the Iterator.remove operation. Most implementations will probably choose to override this method for efficiency.
Note that this implementation will throw an UnsupportedOperationException if the iterator returned by this collection's iterator method does not implement the remove method and this collection is non-empty.
clear in interface Collection<K>clear in interface Set<K>clear in class AbstractCollection<K>public boolean removeAll(Collection<?> c)
java.util.AbstractSetThis implementation determines which is the smaller of this set and the specified collection, by invoking the size method on each. If this set has fewer elements, then the implementation iterates over this set, checking each element returned by the iterator in turn to see if it is contained in the specified collection. If it is so contained, it is removed from this set with the iterator's remove method. If the specified collection has fewer elements, then the implementation iterates over the specified collection, removing from this set each element returned by the iterator, using this set's remove method.
Note that this implementation will throw an UnsupportedOperationException if the iterator returned by the iterator method does not implement the remove method.
removeAll in interface Collection<E>removeAll in interface Set<E>removeAll in class AbstractSet<E>c - collection containing elements to be removed from this setAbstractCollection.remove(Object),
AbstractCollection.contains(Object)public boolean retainAll(Collection<?> c)
java.util.AbstractCollectionThis implementation iterates over this collection, checking each element returned by the iterator in turn to see if it's contained in the specified collection. If it's not so contained, it's removed from this collection with the iterator's remove method.
Note that this implementation will throw an UnsupportedOperationException if the iterator returned by the iterator method does not implement the remove method and this collection contains one or more elements not present in the specified collection.
retainAll in interface Collection<E>retainAll in interface Set<E>retainAll in class AbstractCollection<E>c - collection containing elements to be retained in this collectionAbstractCollection.remove(Object),
AbstractCollection.contains(Object)Copyright © 2010–2019. All rights reserved.