public static class ObjectSortedSets.EmptySet<K> extends ObjectSets.EmptySet<K> implements ObjectSortedSet<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() |
ObjectSortedSet<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.
|
ObjectSortedSet<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. |
ObjectSortedSet<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, toArray
addAll, containsAll, isEmpty, removeAll, retainAll, toString
iterator
toArray
public boolean remove(Object ok)
ObjectSet
Note 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 ObjectSet<K>
remove
in interface Collection<K>
remove
in interface Set<K>
remove
in class ObjectSets.EmptySet<K>
Collection.remove(Object)
@Deprecated public ObjectBidirectionalIterator<K> objectIterator()
AbstractObjectCollection
objectIterator
in interface ObjectCollection<K>
objectIterator
in interface ObjectSortedSet<K>
objectIterator
in class AbstractObjectCollection<K>
ObjectCollection.iterator()
public ObjectBidirectionalIterator<K> iterator(K from)
ObjectSortedSet
BidirectionalIterator
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 ObjectSortedSet<K>
from
- an element to start from.public ObjectSortedSet<K> subSet(K from, K to)
ObjectSortedSet
fromElement
, inclusive, to toElement
, exclusive.
Note that this specification strengthens the one given in SortedSet.subSet(Object,Object)
.
subSet
in interface ObjectSortedSet<K>
subSet
in interface SortedSet<K>
SortedSet.subSet(Object,Object)
public ObjectSortedSet<K> headSet(K from)
ObjectSortedSet
toElement
.
Note that this specification strengthens the one given in SortedSet.headSet(Object)
.
headSet
in interface ObjectSortedSet<K>
headSet
in interface SortedSet<K>
SortedSet.headSet(Object)
public ObjectSortedSet<K> tailSet(K to)
ObjectSortedSet
fromElement
.
Note that this specification strengthens the one given in SortedSet.tailSet(Object)
.
tailSet
in interface ObjectSortedSet<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 ObjectSets.EmptySet<K>