public static class IntSortedSets.EmptySet extends IntSets.EmptySet implements IntSortedSet, 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() |
IntComparator |
comparator()
Returns the comparator associated with this sorted set, or null if it
uses its elements' natural ordering.
|
Integer |
first() |
int |
firstInt() |
IntSortedSet |
headSet(int from) |
IntSortedSet |
headSet(Integer from)
Returns a view of the portion of this sorted set whose elements are
strictly less than
toElement. |
IntBidirectionalIterator |
intIterator()
Deprecated.
|
IntBidirectionalIterator |
iterator(int from)
Returns a type-specific
BidirectionalIterator on the elements in
this set, starting from a given element of the domain (optional
operation). |
Integer |
last() |
int |
lastInt() |
boolean |
rem(int ok)
|
IntSortedSet |
subSet(Integer from,
Integer to)
Returns a view of the portion of this sorted set whose elements range
from
fromElement, inclusive, to toElement,
exclusive. |
IntSortedSet |
subSet(int from,
int to) |
IntSortedSet |
tailSet(int to) |
IntSortedSet |
tailSet(Integer to)
Returns a view of the portion of this sorted set whose elements are
greater than or equal to
fromElement. |
equals, removeadd, addAll, clear, contains, containsAll, hashCode, iterator, removeAll, retainAll, size, toArray, toIntArray, toIntArrayadd, addAll, contains, containsAll, isEmpty, rem, remove, removeAll, retainAll, toArray, toArray, toStringiteratoradd, addAll, contains, containsAll, removeAll, retainAll, toArray, toArray, toIntArray, toIntArrayspliteratoradd, addAll, clear, contains, containsAll, equals, hashCode, isEmpty, remove, removeAll, retainAll, size, toArray, toArrayparallelStream, removeIf, streampublic boolean rem(int ok)
IntCollectionremove(), but the clash with
the similarly named index-based method in the List
interface forces us to use a distinguished name. For simplicity, the set
interfaces reinstates remove().rem in interface IntCollectionrem in class IntCollections.EmptyCollectionCollection.remove(Object)@Deprecated public IntBidirectionalIterator intIterator()
AbstractIntCollectionintIterator in interface IntCollectionintIterator in interface IntSortedSetintIterator in class AbstractIntCollectionIntCollection.iterator()public IntBidirectionalIterator iterator(int from)
IntSortedSetBidirectionalIterator 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 IntSortedSetfrom - an element to start from.public IntSortedSet subSet(int from, int to)
subSet in interface IntSortedSetSortedSet.subSet(Object,Object)public IntSortedSet headSet(int from)
headSet in interface IntSortedSetSortedSet.headSet(Object)public IntSortedSet tailSet(int to)
tailSet in interface IntSortedSetSortedSet.tailSet(Object)public int firstInt()
firstInt in interface IntSortedSetSortedSet.first()public int lastInt()
lastInt in interface IntSortedSetSortedSet.last()public IntComparator comparator()
IntSortedSet
Note that this specification strengthens the one given in
SortedSet.comparator().
comparator in interface IntSortedSetcomparator in interface SortedSet<Integer>SortedSet.comparator()public IntSortedSet subSet(Integer from, Integer to)
IntSortedSetfromElement, inclusive, to toElement,
exclusive.
Note that this specification strengthens the one given in
SortedSet.subSet(Object,Object).
subSet in interface IntSortedSetsubSet in interface SortedSet<Integer>SortedSet.subSet(Object,Object)public IntSortedSet headSet(Integer from)
IntSortedSettoElement.
Note that this specification strengthens the one given in
SortedSet.headSet(Object).
headSet in interface IntSortedSetheadSet in interface SortedSet<Integer>SortedSet.headSet(Object)public IntSortedSet tailSet(Integer to)
IntSortedSetfromElement.
Note that this specification strengthens the one given in
SortedSet.tailSet(Object).
tailSet in interface IntSortedSettailSet in interface SortedSet<Integer>SortedSet.tailSet(Object)public Object clone()
clone in class IntSets.EmptySet