public static class DoubleSortedSets.EmptySet extends DoubleSets.EmptySet implements DoubleSortedSet, java.io.Serializable, java.lang.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 |
---|---|
java.lang.Object |
clone() |
DoubleComparator |
comparator()
Returns the comparator associated with this sorted set, or null if it uses its elements' natural ordering.
|
DoubleBidirectionalIterator |
doubleIterator()
Deprecated.
|
java.lang.Double |
first() |
double |
firstDouble() |
DoubleSortedSet |
headSet(double from) |
DoubleSortedSet |
headSet(java.lang.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). |
java.lang.Double |
last() |
double |
lastDouble() |
boolean |
remove(double ok)
Removes an element from this set.
|
DoubleSortedSet |
subSet(double from,
double to) |
DoubleSortedSet |
subSet(java.lang.Double from,
java.lang.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(java.lang.Double to)
Returns a view of the portion of this sorted set whose elements are greater than or equal to
fromElement . |
add, addAll, clear, contains, containsAll, equals, hashCode, iterator, rem, removeAll, retainAll, size, toArray, toDoubleArray, toDoubleArray
add, addAll, contains, containsAll, isEmpty, rem, remove, removeAll, retainAll, toArray, toArray, toString
iterator
add, addAll, contains, containsAll, rem, removeAll, retainAll, toArray, toArray, toDoubleArray, toDoubleArray
public boolean remove(double ok)
DoubleSet
Note that the corresponding method of the type-specific collection is rem()
.
This unfortunate situation is caused by the clash
with the similarly named index-based method in the List
interface.
remove
in interface DoubleSet
remove
in class DoubleSets.EmptySet
Collection.remove(Object)
@Deprecated public DoubleBidirectionalIterator doubleIterator()
AbstractDoubleCollection
doubleIterator
in interface DoubleCollection
doubleIterator
in interface DoubleSortedSet
doubleIterator
in class AbstractDoubleCollection
DoubleCollection.iterator()
public DoubleBidirectionalIterator iterator(double from)
DoubleSortedSet
BidirectionalIterator
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 DoubleSortedSet
from
- an element to start from.public DoubleSortedSet subSet(double from, double to)
subSet
in interface DoubleSortedSet
SortedSet.subSet(Object,Object)
public DoubleSortedSet headSet(double from)
headSet
in interface DoubleSortedSet
SortedSet.headSet(Object)
public DoubleSortedSet tailSet(double to)
tailSet
in interface DoubleSortedSet
SortedSet.tailSet(Object)
public double firstDouble()
firstDouble
in interface DoubleSortedSet
SortedSet.first()
public double lastDouble()
lastDouble
in interface DoubleSortedSet
SortedSet.last()
public DoubleComparator comparator()
DoubleSortedSet
Note that this specification strengthens the one given in SortedSet.comparator()
.
comparator
in interface DoubleSortedSet
comparator
in interface java.util.SortedSet<java.lang.Double>
SortedSet.comparator()
public DoubleSortedSet subSet(java.lang.Double from, java.lang.Double to)
DoubleSortedSet
fromElement
, inclusive, to toElement
, exclusive.
Note that this specification strengthens the one given in SortedSet.subSet(Object,Object)
.
subSet
in interface DoubleSortedSet
subSet
in interface java.util.SortedSet<java.lang.Double>
SortedSet.subSet(Object,Object)
public DoubleSortedSet headSet(java.lang.Double from)
DoubleSortedSet
toElement
.
Note that this specification strengthens the one given in SortedSet.headSet(Object)
.
headSet
in interface DoubleSortedSet
headSet
in interface java.util.SortedSet<java.lang.Double>
SortedSet.headSet(Object)
public DoubleSortedSet tailSet(java.lang.Double to)
DoubleSortedSet
fromElement
.
Note that this specification strengthens the one given in SortedSet.tailSet(Object)
.
tailSet
in interface DoubleSortedSet
tailSet
in interface java.util.SortedSet<java.lang.Double>
SortedSet.tailSet(Object)
public java.lang.Double first()
first
in interface java.util.SortedSet<java.lang.Double>
public java.lang.Double last()
last
in interface java.util.SortedSet<java.lang.Double>
public java.lang.Object clone()
clone
in class DoubleSets.EmptySet