public static class IntSortedSets.SynchronizedSortedSet extends IntSets.SynchronizedSet implements IntSortedSet, Serializable
| Modifier and Type | Method and Description |
|---|---|
IntComparator |
comparator()
Note that this specification strengthens the one given in
SortedSet.comparator(). |
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 to)
Returns a view of the portion of this sorted set whose elements are strictly less than
toElement. |
IntSortedSet |
headSet(Integer to)
Deprecated.
Please use the corresponding type-specific method instead.
|
IntBidirectionalIterator |
iterator()
Returns a type-specific iterator on the elements of this collection.
|
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 from)
Returns a view of the portion of this sorted set whose elements are greater than or equal to
fromElement. |
IntSortedSet |
tailSet(Integer from)
Deprecated.
Please use the corresponding type-specific method instead.
|
rem, removeadd, add, addAll, addAll, clear, contains, contains, containsAll, containsAll, equals, hashCode, isEmpty, remove, removeAll, removeAll, removeIf, retainAll, retainAll, size, toArray, toArray, toArray, toIntArray, toIntArray, toStringadd, contains, rem, remove, removeadd, addAll, contains, containsAll, removeAll, removeIf, removeIf, retainAll, toArray, toIntArray, toIntArrayforEach, forEachspliteratoraddAll, clear, containsAll, equals, hashCode, isEmpty, removeAll, retainAll, size, toArray, toArrayparallelStream, streampublic IntComparator comparator()
IntSortedSetNote that this specification strengthens the one given in SortedSet.comparator().
comparator in interface IntSortedSetcomparator in interface SortedSet<Integer>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 to)
IntSortedSettoElement.
Note that this specification strengthens the one given in SortedSet.headSet(Object).
headSet in interface IntSortedSetSortedSet.headSet(Object)public IntSortedSet tailSet(int from)
IntSortedSetfromElement.
Note that this specification strengthens the one given in SortedSet.headSet(Object).
tailSet in interface IntSortedSetSortedSet.tailSet(Object)public IntBidirectionalIterator iterator()
IntCollectionNote that this specification strengthens the one given in
Iterable.iterator(), which was already
strengthened in the corresponding type-specific class,
but was weakened by the fact that this interface extends Collection.
iterator in interface IntBidirectionalIterableiterator in interface IntCollectioniterator in interface IntIterableiterator in interface IntSetiterator in interface IntSortedSetiterator in interface Iterable<Integer>iterator in interface Collection<Integer>iterator in interface Set<Integer>iterator in class IntCollections.SynchronizedCollectionIterable.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 int firstInt()
IntSortedSetfirstInt in interface IntSortedSetSortedSet.first()public int lastInt()
IntSortedSetlastInt in interface IntSortedSetSortedSet.last()@Deprecated public Integer first()
first in interface IntSortedSetfirst in interface SortedSet<Integer>@Deprecated public Integer last()
last in interface IntSortedSetlast in interface SortedSet<Integer>@Deprecated public IntSortedSet subSet(Integer from, Integer to)
subSet in interface IntSortedSetsubSet in interface SortedSet<Integer>@Deprecated public IntSortedSet headSet(Integer to)
headSet in interface IntSortedSetheadSet in interface SortedSet<Integer>@Deprecated public IntSortedSet tailSet(Integer from)
tailSet in interface IntSortedSettailSet in interface SortedSet<Integer>