public static class ReferenceSortedSets.Singleton<K> extends ReferenceSets.Singleton<K> implements ReferenceSortedSet<K>, java.io.Serializable, java.lang.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 |
---|---|
java.util.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() |
ObjectSpliterator<K> |
spliterator()
Returns a type-specific spliterator on the elements of 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 from)
Returns a view of the portion of this sorted set whose elements are greater than or equal to
fromElement . |
addAll, clone, contains, forEach, iterator, remove, removeAll, removeIf, retainAll, size, toArray
equals, hashCode
toString
iterator
public ObjectBidirectionalIterator<K> iterator(K from)
ReferenceSortedSet
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 ReferenceSortedSet<K>
from
- an element to start from.public java.util.Comparator<? super K> comparator()
comparator
in interface java.util.SortedSet<K>
public ObjectSpliterator<K> spliterator()
ReferenceSet
Set spliterators must report at least Spliterator.DISTINCT
.
See Set.spliterator()
for more documentation on the requirements
of the returned spliterator.
spliterator
in interface ObjectIterable<K>
spliterator
in interface ReferenceCollection<K>
spliterator
in interface ReferenceSet<K>
spliterator
in interface ReferenceSortedSet<K>
spliterator
in interface java.lang.Iterable<K>
spliterator
in interface java.util.Collection<K>
spliterator
in interface java.util.Set<K>
spliterator
in interface java.util.SortedSet<K>
spliterator
in class ReferenceSets.Singleton<K>
public ReferenceSortedSet<K> subSet(K from, K to)
ReferenceSortedSet
fromElement
, inclusive, to toElement
, exclusive.subSet
in interface ReferenceSortedSet<K>
subSet
in interface java.util.SortedSet<K>
SortedSet.subSet(Object,Object)
public ReferenceSortedSet<K> headSet(K to)
ReferenceSortedSet
toElement
.headSet
in interface ReferenceSortedSet<K>
headSet
in interface java.util.SortedSet<K>
SortedSet.headSet(Object)
public ReferenceSortedSet<K> tailSet(K from)
ReferenceSortedSet
fromElement
.tailSet
in interface ReferenceSortedSet<K>
tailSet
in interface java.util.SortedSet<K>
SortedSet.tailSet(Object)