public static class IntSortedSets.EmptySet extends IntSets.EmptySet implements IntSortedSet, 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.lang.Object |
clone() |
IntComparator |
comparator()
Returns the comparator associated with this sorted set, or null if it uses its elements' natural ordering.
|
java.lang.Integer |
first() |
int |
firstInt() |
IntSortedSet |
headSet(int from) |
IntSortedSet |
headSet(java.lang.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). |
java.lang.Integer |
last() |
int |
lastInt() |
boolean |
remove(int ok)
Removes an element from this set.
|
IntSortedSet |
subSet(java.lang.Integer from,
java.lang.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(java.lang.Integer to)
Returns a view of the portion of this sorted set whose elements are greater than or equal to
fromElement . |
add, addAll, clear, contains, containsAll, equals, hashCode, iterator, rem, removeAll, retainAll, size, toArray, toIntArray, toIntArray
add, addAll, contains, containsAll, isEmpty, rem, remove, removeAll, retainAll, toArray, toArray, toString
iterator
add, addAll, contains, containsAll, rem, removeAll, retainAll, toArray, toArray, toIntArray, toIntArray
public boolean remove(int ok)
IntSet
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 IntSet
remove
in class IntSets.EmptySet
Collection.remove(Object)
@Deprecated public IntBidirectionalIterator intIterator()
AbstractIntCollection
intIterator
in interface IntCollection
intIterator
in interface IntSortedSet
intIterator
in class AbstractIntCollection
IntCollection.iterator()
public IntBidirectionalIterator iterator(int from)
IntSortedSet
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 IntSortedSet
from
- an element to start from.public IntSortedSet subSet(int from, int to)
subSet
in interface IntSortedSet
SortedSet.subSet(Object,Object)
public IntSortedSet headSet(int from)
headSet
in interface IntSortedSet
SortedSet.headSet(Object)
public IntSortedSet tailSet(int to)
tailSet
in interface IntSortedSet
SortedSet.tailSet(Object)
public int firstInt()
firstInt
in interface IntSortedSet
SortedSet.first()
public int lastInt()
lastInt
in interface IntSortedSet
SortedSet.last()
public IntComparator comparator()
IntSortedSet
Note that this specification strengthens the one given in SortedSet.comparator()
.
comparator
in interface IntSortedSet
comparator
in interface java.util.SortedSet<java.lang.Integer>
SortedSet.comparator()
public IntSortedSet subSet(java.lang.Integer from, java.lang.Integer to)
IntSortedSet
fromElement
, inclusive, to toElement
, exclusive.
Note that this specification strengthens the one given in SortedSet.subSet(Object,Object)
.
subSet
in interface IntSortedSet
subSet
in interface java.util.SortedSet<java.lang.Integer>
SortedSet.subSet(Object,Object)
public IntSortedSet headSet(java.lang.Integer from)
IntSortedSet
toElement
.
Note that this specification strengthens the one given in SortedSet.headSet(Object)
.
headSet
in interface IntSortedSet
headSet
in interface java.util.SortedSet<java.lang.Integer>
SortedSet.headSet(Object)
public IntSortedSet tailSet(java.lang.Integer to)
IntSortedSet
fromElement
.
Note that this specification strengthens the one given in SortedSet.tailSet(Object)
.
tailSet
in interface IntSortedSet
tailSet
in interface java.util.SortedSet<java.lang.Integer>
SortedSet.tailSet(Object)
public java.lang.Integer first()
first
in interface java.util.SortedSet<java.lang.Integer>
public java.lang.Integer last()
last
in interface java.util.SortedSet<java.lang.Integer>
public java.lang.Object clone()
clone
in class IntSets.EmptySet