java.util.Collection<K>, java.lang.Iterable<K>, ObjectBidirectionalIterable<K>, ObjectIterable<K>, ReferenceCollection<K>, ReferenceSet<K>, java.util.Set<K>, java.util.SortedSet<K>AbstractReferenceSortedSet, ReferenceLinkedOpenHashSet, ReferenceSortedSets.EmptySet, ReferenceSortedSets.Singleton, ReferenceSortedSets.SynchronizedSortedSet, ReferenceSortedSets.UnmodifiableSortedSetpublic interface ReferenceSortedSet<K> extends ReferenceSet<K>, java.util.SortedSet<K>, ObjectBidirectionalIterable<K>
SortedSet; provides some additional methods that use
polymorphism to avoid (un)boxing.
Additionally, this interface strengthens iterator(),
SortedSet.comparator() (for primitive types),
SortedSet.subSet(Object,Object), SortedSet.headSet(Object)
and SortedSet.tailSet(Object).
SortedSet| Modifier and Type | Method | Description |
|---|---|---|
ReferenceSortedSet<K> |
headSet(K toElement) |
Returns a view of the portion of this sorted set whose elements are strictly
less than
toElement. |
ObjectBidirectionalIterator<K> |
iterator() |
Returns a type-specific
BidirectionalIterator
on the elements in this set. |
ObjectBidirectionalIterator<K> |
iterator(K fromElement) |
Returns a type-specific
BidirectionalIterator
on the elements in this set, starting from a given element of the domain
(optional operation). |
ReferenceSortedSet<K> |
subSet(K fromElement,
K toElement) |
Returns a view of the portion of this sorted set whose elements range from
fromElement, inclusive, to toElement, exclusive. |
ReferenceSortedSet<K> |
tailSet(K fromElement) |
Returns a view of the portion of this sorted set whose elements are greater
than or equal to
fromElement. |
ObjectBidirectionalIterator<K> iterator(K fromElement)
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.
fromElement - an element to start from.java.lang.UnsupportedOperationException - if this set does not support iterators with a starting point.ObjectBidirectionalIterator<K> iterator()
BidirectionalIterator
on the elements in this set.
Note that this specification strengthens the one given in the corresponding
type-specific Collection.
This method returns a parameterised bidirectional iterator. The iterator can be moreover safely cast to a type-specific iterator.
iterator in interface java.util.Collection<K>iterator in interface java.lang.Iterable<K>iterator in interface ObjectBidirectionalIterable<K>iterator in interface ObjectIterable<K>iterator in interface ReferenceCollection<K>iterator in interface ReferenceSet<K>iterator in interface java.util.Set<K>Iterable.iterator()ReferenceSortedSet<K> subSet(K fromElement, K toElement)
fromElement, inclusive, to toElement, exclusive.
Note that this specification strengthens the one given in
SortedSet.subSet(Object,Object).
subSet in interface java.util.SortedSet<K>SortedSet.subSet(Object,Object)ReferenceSortedSet<K> headSet(K toElement)
toElement.
Note that this specification strengthens the one given in
SortedSet.headSet(Object).
headSet in interface java.util.SortedSet<K>SortedSet.headSet(Object)ReferenceSortedSet<K> tailSet(K fromElement)
fromElement.
Note that this specification strengthens the one given in
SortedSet.headSet(Object).
tailSet in interface java.util.SortedSet<K>SortedSet.tailSet(Object)