public static class DoubleSortedSets.Singleton extends DoubleSets.Singleton implements DoubleSortedSet, 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 |
|---|---|
DoubleComparator |
comparator()
Returns the comparator used to order the elements in this set,
or null if this set uses the natural ordering of its elements.
|
Double |
first()
Deprecated.
Please use the corresponding type-specific method
instead.
|
double |
firstDouble()
Returns the first (lowest) element currently in this set.
|
DoubleSortedSet |
headSet(double to)
Returns a view of the portion of this sorted set whose elements are
strictly less than
toElement. |
DoubleSortedSet |
headSet(Double to)
Deprecated.
Please use the corresponding type-specific method
instead.
|
DoubleBidirectionalIterator |
iterator(double from)
Returns a type-specific
BidirectionalIterator on the elements in
this set, starting from a given element of the domain (optional
operation). |
Double |
last()
Deprecated.
Please use the corresponding type-specific method
instead.
|
double |
lastDouble()
Returns the last (highest) element currently in this set.
|
DoubleSortedSet |
subSet(double from,
double to)
Returns a view of the portion of this sorted set whose elements range
from
fromElement, inclusive, to toElement, exclusive. |
DoubleSortedSet |
subSet(Double from,
Double to)
Deprecated.
Please use the corresponding type-specific method
instead.
|
DoubleSortedSet |
tailSet(double from)
Returns a view of the portion of this sorted set whose elements are
greater than or equal to
fromElement. |
DoubleSortedSet |
tailSet(Double from)
Deprecated.
Please use the corresponding type-specific method
instead.
|
addAll, addAll, clone, contains, iterator, remove, removeAll, removeAll, retainAll, retainAll, sizeequals, hashCode, remadd, add, contains, containsAll, remove, toArray, toDoubleArray, toDoubleArray, toStringclear, containsAll, isEmpty, toArray, toArrayiteratoradd, contains, rem, remove, removeadd, addAll, contains, containsAll, removeAll, retainAll, toArray, toDoubleArray, toDoubleArrayforEach, forEachspliteratoraddAll, clear, containsAll, equals, hashCode, isEmpty, removeAll, retainAll, size, toArray, toArrayparallelStream, removeIf, streampublic DoubleBidirectionalIterator iterator(double from)
DoubleSortedSetBidirectionalIterator 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 DoubleSortedSetfrom - an element to start from.public DoubleComparator comparator()
DoubleSortedSet
Note that this specification strengthens the one given in
SortedSet.comparator().
comparator in interface DoubleSortedSetcomparator in interface SortedSet<Double>public DoubleSortedSet subSet(double from, double to)
DoubleSortedSetfromElement, inclusive, to toElement, exclusive.
Note that this specification strengthens the one given in
SortedSet.subSet(Object,Object).
subSet in interface DoubleSortedSetSortedSet.subSet(Object,Object)public DoubleSortedSet headSet(double to)
DoubleSortedSettoElement.
Note that this specification strengthens the one given in
SortedSet.headSet(Object).
headSet in interface DoubleSortedSetSortedSet.headSet(Object)public DoubleSortedSet tailSet(double from)
DoubleSortedSetfromElement.
Note that this specification strengthens the one given in
SortedSet.headSet(Object).
tailSet in interface DoubleSortedSetSortedSet.tailSet(Object)public double firstDouble()
DoubleSortedSetfirstDouble in interface DoubleSortedSetSortedSet.first()public double lastDouble()
DoubleSortedSetlastDouble in interface DoubleSortedSetSortedSet.last()@Deprecated public DoubleSortedSet subSet(Double from, Double to)
The returned set will throw an IllegalArgumentException on an attempt to insert an element outside its range.
subSet in interface DoubleSortedSetsubSet in interface SortedSet<Double>from - low endpoint (inclusive) of the returned setto - high endpoint (exclusive) of the returned set@Deprecated public DoubleSortedSet headSet(Double to)
The returned set will throw an IllegalArgumentException on an attempt to insert an element outside its range.
headSet in interface DoubleSortedSetheadSet in interface SortedSet<Double>to - high endpoint (exclusive) of the returned set@Deprecated public DoubleSortedSet tailSet(Double from)
The returned set will throw an IllegalArgumentException on an attempt to insert an element outside its range.
tailSet in interface DoubleSortedSettailSet in interface SortedSet<Double>from - low endpoint (inclusive) of the returned set@Deprecated public Double first()
first in interface DoubleSortedSetfirst in interface SortedSet<Double>@Deprecated public Double last()
last in interface DoubleSortedSetlast in interface SortedSet<Double>