public static class DoubleSortedSets.EmptySet extends DoubleSets.EmptySet 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 |
|---|---|
Object |
clone() |
DoubleComparator |
comparator()
Returns the comparator associated with this sorted set, or null if it
uses its elements' natural ordering.
|
DoubleBidirectionalIterator |
doubleIterator()
Deprecated.
|
Double |
first() |
double |
firstDouble() |
DoubleSortedSet |
headSet(double from) |
DoubleSortedSet |
headSet(Double from)
Returns a view of the portion of this sorted set whose elements are
strictly less than
toElement. |
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() |
double |
lastDouble() |
boolean |
rem(double ok)
|
DoubleSortedSet |
subSet(double from,
double to) |
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 |
tailSet(double to) |
DoubleSortedSet |
tailSet(Double to)
Returns a view of the portion of this sorted set whose elements are
greater than or equal to
fromElement. |
equals, removeadd, addAll, clear, contains, containsAll, hashCode, iterator, removeAll, retainAll, size, toArray, toDoubleArray, toDoubleArrayadd, addAll, contains, containsAll, isEmpty, rem, remove, removeAll, retainAll, toArray, toArray, toStringiteratoradd, addAll, contains, containsAll, removeAll, retainAll, toArray, toArray, toDoubleArray, toDoubleArrayspliteratoradd, addAll, clear, contains, containsAll, equals, hashCode, isEmpty, remove, removeAll, retainAll, size, toArray, toArrayparallelStream, removeIf, streampublic boolean rem(double ok)
DoubleCollectionremove(), but the clash with
the similarly named index-based method in the List
interface forces us to use a distinguished name. For simplicity, the set
interfaces reinstates remove().rem in interface DoubleCollectionrem in class DoubleCollections.EmptyCollectionCollection.remove(Object)@Deprecated public DoubleBidirectionalIterator doubleIterator()
AbstractDoubleCollectiondoubleIterator in interface DoubleCollectiondoubleIterator in interface DoubleSortedSetdoubleIterator in class AbstractDoubleCollectionDoubleCollection.iterator()public 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 DoubleSortedSet subSet(double from, double to)
subSet in interface DoubleSortedSetSortedSet.subSet(Object,Object)public DoubleSortedSet headSet(double from)
headSet in interface DoubleSortedSetSortedSet.headSet(Object)public DoubleSortedSet tailSet(double to)
tailSet in interface DoubleSortedSetSortedSet.tailSet(Object)public double firstDouble()
firstDouble in interface DoubleSortedSetSortedSet.first()public double lastDouble()
lastDouble in interface DoubleSortedSetSortedSet.last()public DoubleComparator comparator()
DoubleSortedSet
Note that this specification strengthens the one given in
SortedSet.comparator().
comparator in interface DoubleSortedSetcomparator in interface SortedSet<Double>SortedSet.comparator()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 DoubleSortedSetsubSet in interface SortedSet<Double>SortedSet.subSet(Object,Object)public DoubleSortedSet headSet(Double from)
DoubleSortedSettoElement.
Note that this specification strengthens the one given in
SortedSet.headSet(Object).
headSet in interface DoubleSortedSetheadSet in interface SortedSet<Double>SortedSet.headSet(Object)public DoubleSortedSet tailSet(Double to)
DoubleSortedSetfromElement.
Note that this specification strengthens the one given in
SortedSet.tailSet(Object).
tailSet in interface DoubleSortedSettailSet in interface SortedSet<Double>SortedSet.tailSet(Object)public Object clone()
clone in class DoubleSets.EmptySet