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()
Creates and returns a copy of this object.
|
IntComparator |
comparator()
Returns the comparator used to order the elements in this set,
or null if this set uses the natural ordering of its elements.
|
Integer |
first()
Deprecated.
Please use the corresponding type-specific method
instead.
|
int |
firstInt()
Returns the first (lowest) element currently in this set.
|
IntSortedSet |
headSet(int from)
Returns a view of the portion of this sorted set whose elements are
strictly less than
toElement. |
IntSortedSet |
headSet(Integer from)
Deprecated.
Please use the corresponding type-specific method
instead.
|
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()
Deprecated.
Please use the corresponding type-specific method
instead.
|
int |
lastInt()
Returns the last (highest) element currently in this set.
|
IntSortedSet |
subSet(Integer from,
Integer to)
Deprecated.
Please use the corresponding type-specific method
instead.
|
IntSortedSet |
subSet(int from,
int to)
Returns a view of the portion of this sorted set whose elements range
from
fromElement, inclusive, to toElement, exclusive. |
IntSortedSet |
tailSet(int to)
Returns a view of the portion of this sorted set whose elements are
greater than or equal to
fromElement. |
IntSortedSet |
tailSet(Integer to)
Deprecated.
Please use the corresponding type-specific method
instead.
|
equals, rem, removeaddAll, addAll, clear, contains, hashCode, iterator, removeAll, removeAll, retainAll, retainAll, size, toArrayadd, add, contains, containsAll, remove, toArray, toIntArray, toIntArray, toStringcontainsAll, isEmpty, toArrayiteratoradd, contains, rem, remove, removeadd, addAll, contains, containsAll, removeAll, retainAll, toArray, toIntArray, toIntArrayforEach, forEachspliteratoraddAll, clear, containsAll, equals, hashCode, isEmpty, removeAll, retainAll, size, toArray, toArrayparallelStream, removeIf, streampublic 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)
IntSortedSetfromElement, inclusive, to toElement, exclusive.
Note that this specification strengthens the one given in
SortedSet.subSet(Object,Object).
subSet in interface IntSortedSetSortedSet.subSet(Object,Object)public IntSortedSet headSet(int from)
IntSortedSettoElement.
Note that this specification strengthens the one given in
SortedSet.headSet(Object).
headSet in interface IntSortedSetSortedSet.headSet(Object)public IntSortedSet tailSet(int to)
IntSortedSetfromElement.
Note that this specification strengthens the one given in
SortedSet.headSet(Object).
tailSet in interface IntSortedSetSortedSet.tailSet(Object)public int firstInt()
IntSortedSetfirstInt in interface IntSortedSetSortedSet.first()public int lastInt()
IntSortedSetlastInt 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>@Deprecated public IntSortedSet subSet(Integer from, Integer to)
The returned set will throw an IllegalArgumentException on an attempt to insert an element outside its range.
subSet in interface IntSortedSetsubSet in interface SortedSet<Integer>from - low endpoint (inclusive) of the returned setto - high endpoint (exclusive) of the returned set@Deprecated public IntSortedSet headSet(Integer from)
The returned set will throw an IllegalArgumentException on an attempt to insert an element outside its range.
headSet in interface IntSortedSetheadSet in interface SortedSet<Integer>from - high endpoint (exclusive) of the returned set@Deprecated public IntSortedSet tailSet(Integer to)
The returned set will throw an IllegalArgumentException on an attempt to insert an element outside its range.
tailSet in interface IntSortedSettailSet in interface SortedSet<Integer>to - low endpoint (inclusive) of the returned set@Deprecated public Integer first()
first in interface IntSortedSetfirst in interface SortedSet<Integer>@Deprecated public Integer last()
last in interface IntSortedSetlast in interface SortedSet<Integer>public Object clone()
java.lang.Objectx, the expression:
will be true, and that the expression:x.clone() != x
will bex.clone().getClass() == x.getClass()
true, but these are not absolute requirements.
While it is typically the case that:
will bex.clone().equals(x)
true, this is not an absolute requirement.
By convention, the returned object should be obtained by calling
super.clone. If a class and all of its superclasses (except
Object) obey this convention, it will be the case that
x.clone().getClass() == x.getClass().
By convention, the object returned by this method should be independent
of this object (which is being cloned). To achieve this independence,
it may be necessary to modify one or more fields of the object returned
by super.clone before returning it. Typically, this means
copying any mutable objects that comprise the internal "deep structure"
of the object being cloned and replacing the references to these
objects with references to the copies. If a class contains only
primitive fields or references to immutable objects, then it is usually
the case that no fields in the object returned by super.clone
need to be modified.
The method clone for class Object performs a
specific cloning operation. First, if the class of this object does
not implement the interface Cloneable, then a
CloneNotSupportedException is thrown. Note that all arrays
are considered to implement the interface Cloneable and that
the return type of the clone method of an array type T[]
is T[] where T is any reference or primitive type.
Otherwise, this method creates a new instance of the class of this
object and initializes all its fields with exactly the contents of
the corresponding fields of this object, as if by assignment; the
contents of the fields are not themselves cloned. Thus, this method
performs a "shallow copy" of this object, not a "deep copy" operation.
The class Object does not itself implement the interface
Cloneable, so calling the clone method on an object
whose class is Object will result in throwing an
exception at run time.
clone in class IntSets.EmptySetCloneable