public static class ReferenceSortedSets.EmptySet<K> extends ReferenceSets.EmptySet<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 |
|---|---|
Object |
clone() |
Comparator<? super K> |
comparator() |
K |
first() |
ReferenceSortedSet<K> |
headSet(K from)
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.
|
boolean |
remove(Object ok)
Removes an element from this set.
|
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 to)
Returns a view of the portion of this sorted set whose elements are greater than or equal to
fromElement. |
add, clear, contains, equals, hashCode, iterator, size, toArray, toArrayaddAll, containsAll, isEmpty, removeAll, retainAll, toStringiteratortoArraypublic boolean remove(Object ok)
ReferenceSetNote that the corresponding method of the type-specific collection is rem().
This unfortunate situation is caused by the clash
with the similarly named index-based method in the List interface.
remove in interface ReferenceSet<K>remove in interface Collection<K>remove in interface Set<K>remove in class ReferenceSets.EmptySet<K>Collection.remove(Object)@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 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 from)
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 to)
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)public Comparator<? super K> comparator()
comparator in interface SortedSet<K>public Object clone()
clone in class ReferenceSets.EmptySet<K>