public static class LongSortedSets.SynchronizedSortedSet extends LongSets.SynchronizedSet implements LongSortedSet, Serializable
| Modifier and Type | Method and Description |
|---|---|
LongComparator |
comparator()
Note that this specification strengthens the one given in
SortedSet.comparator(). |
Long |
first()
Deprecated.
Please use the corresponding type-specific method instead.
|
long |
firstLong()
Returns the first (lowest) element currently in this set.
|
LongSortedSet |
headSet(long to)
Returns a view of the portion of this sorted set whose elements are strictly less than
toElement. |
LongSortedSet |
headSet(Long to)
Deprecated.
Please use the corresponding type-specific method instead.
|
LongBidirectionalIterator |
iterator()
Returns a type-specific iterator on the elements of this collection.
|
LongBidirectionalIterator |
iterator(long from)
Returns a type-specific
BidirectionalIterator on the elements in
this set, starting from a given element of the domain (optional operation). |
Long |
last()
Deprecated.
Please use the corresponding type-specific method instead.
|
long |
lastLong()
Returns the last (highest) element currently in this set.
|
LongSortedSet |
subSet(long from,
long to)
Returns a view of the portion of this sorted set whose elements range from
fromElement, inclusive, to toElement, exclusive. |
LongSortedSet |
subSet(Long from,
Long to)
Deprecated.
Please use the corresponding type-specific method instead.
|
LongSortedSet |
tailSet(long from)
Returns a view of the portion of this sorted set whose elements are greater than or equal to
fromElement. |
LongSortedSet |
tailSet(Long 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, toLongArray, toLongArray, toStringadd, contains, rem, remove, removeadd, addAll, contains, containsAll, removeAll, removeIf, removeIf, retainAll, toArray, toLongArray, toLongArrayforEach, forEachspliteratoraddAll, clear, containsAll, equals, hashCode, isEmpty, removeAll, retainAll, size, toArray, toArrayparallelStream, streampublic LongComparator comparator()
LongSortedSetNote that this specification strengthens the one given in SortedSet.comparator().
comparator in interface LongSortedSetcomparator in interface SortedSet<Long>public LongSortedSet subSet(long from, long to)
LongSortedSetfromElement, inclusive, to toElement, exclusive.
Note that this specification strengthens the one given in SortedSet.subSet(Object,Object).
subSet in interface LongSortedSetSortedSet.subSet(Object,Object)public LongSortedSet headSet(long to)
LongSortedSettoElement.
Note that this specification strengthens the one given in SortedSet.headSet(Object).
headSet in interface LongSortedSetSortedSet.headSet(Object)public LongSortedSet tailSet(long from)
LongSortedSetfromElement.
Note that this specification strengthens the one given in SortedSet.headSet(Object).
tailSet in interface LongSortedSetSortedSet.tailSet(Object)public LongBidirectionalIterator iterator()
LongCollectionNote 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 LongBidirectionalIterableiterator in interface LongCollectioniterator in interface LongIterableiterator in interface LongSetiterator in interface LongSortedSetiterator in interface Iterable<Long>iterator in interface Collection<Long>iterator in interface Set<Long>iterator in class LongCollections.SynchronizedCollectionIterable.iterator()public LongBidirectionalIterator iterator(long from)
LongSortedSetBidirectionalIterator 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 LongSortedSetfrom - an element to start from.public long firstLong()
LongSortedSetfirstLong in interface LongSortedSetSortedSet.first()public long lastLong()
LongSortedSetlastLong in interface LongSortedSetSortedSet.last()@Deprecated public Long first()
first in interface LongSortedSetfirst in interface SortedSet<Long>@Deprecated public Long last()
last in interface LongSortedSetlast in interface SortedSet<Long>@Deprecated public LongSortedSet subSet(Long from, Long to)
subSet in interface LongSortedSetsubSet in interface SortedSet<Long>@Deprecated public LongSortedSet headSet(Long to)
headSet in interface LongSortedSetheadSet in interface SortedSet<Long>@Deprecated public LongSortedSet tailSet(Long from)
tailSet in interface LongSortedSettailSet in interface SortedSet<Long>