public static class ReferenceSortedSets.Singleton<K> extends ReferenceSets.Singleton<K> implements ReferenceSortedSet<K>, Serializable, Cloneable
This class may be useful to implement your own in case you subclass a type-specific sorted set.
| Modifier and Type | Method and Description |
|---|---|
Comparator<? super K> |
comparator() |
K |
first() |
ReferenceSortedSet<K> |
headSet(K to)
Returns a view of the portion of this sorted set whose elements are
strictly less than
toElement. |
ObjectBidirectionalIterator<K> |
iterator(K from)
Returns a type-specific
BidirectionalIterator on the elements in
this set, starting from a given element of the domain (optional
operation). |
K |
last() |
ObjectBidirectionalIterator<K> |
objectIterator()
Deprecated.
|
ReferenceSortedSet<K> |
subSet(K from,
K to)
Returns a view of the portion of this sorted set whose elements range
from
fromElement, inclusive, to toElement,
exclusive. |
ReferenceSortedSet<K> |
tailSet(K from)
Returns a view of the portion of this sorted set whose elements are
greater than or equal to
fromElement. |
add, addAll, clone, contains, iterator, removeAll, retainAll, sizeequals, hashCodecontainsAll, isEmpty, rem, remove, toArray, toArray, toStringcleariteratorremovetoArrayspliteratoradd, addAll, clear, contains, containsAll, equals, hashCode, isEmpty, removeAll, retainAll, size, toArray, toArrayparallelStream, removeIf, stream@Deprecated public ObjectBidirectionalIterator<K> objectIterator()
AbstractReferenceCollectionobjectIterator in interface ReferenceCollection<K>objectIterator in interface ReferenceSortedSet<K>objectIterator in class AbstractReferenceCollection<K>ReferenceCollection.iterator()public ObjectBidirectionalIterator<K> iterator(K from)
ReferenceSortedSetBidirectionalIterator on the elements in
this set, starting from a given element of the domain (optional
operation).
This method returns a type-specific bidirectional iterator with given
starting point. The starting point is any element comparable to the
elements of this set (even if it does not actually belong to the set).
The next element of the returned iterator is the least element of the set
that is greater than the starting point (if there are no elements greater
than the starting point,
hasNext()
will return false). The previous element of the returned
iterator is the greatest element of the set that is smaller than or equal
to the starting point (if there are no elements smaller than or equal to
the starting point,
hasPrevious() will return false).
Note that passing the last element of the set as starting point and
calling previous() you can traverse the entire set in reverse order.
iterator in interface ReferenceSortedSet<K>from - an element to start from.public Comparator<? super K> comparator()
comparator in interface SortedSet<K>public ReferenceSortedSet<K> subSet(K from, K to)
ReferenceSortedSetfromElement, inclusive, to toElement,
exclusive.
Note that this specification strengthens the one given in
SortedSet.subSet(Object,Object).
subSet in interface ReferenceSortedSet<K>subSet in interface SortedSet<K>SortedSet.subSet(Object,Object)public ReferenceSortedSet<K> headSet(K to)
ReferenceSortedSettoElement.
Note that this specification strengthens the one given in
SortedSet.headSet(Object).
headSet in interface ReferenceSortedSet<K>headSet in interface SortedSet<K>SortedSet.headSet(Object)public ReferenceSortedSet<K> tailSet(K from)
ReferenceSortedSetfromElement.
Note that this specification strengthens the one given in
SortedSet.tailSet(Object).
tailSet in interface ReferenceSortedSet<K>tailSet in interface SortedSet<K>SortedSet.tailSet(Object)