protected class AbstractDouble2ObjectSortedMap.KeySet extends AbstractDoubleSortedSet
| Modifier | Constructor and Description |
|---|---|
protected |
AbstractDouble2ObjectSortedMap.KeySet() |
| Modifier and Type | Method and Description |
|---|---|
void |
clear() |
DoubleComparator |
comparator()
Returns the comparator associated with this sorted set, or null if it uses its elements' natural ordering.
|
boolean |
contains(double k) |
double |
firstDouble() |
DoubleSortedSet |
headSet(double to) |
DoubleBidirectionalIterator |
iterator()
Returns a type-specific iterator on the elements of this collection.
|
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 |
lastDouble() |
int |
size() |
DoubleSortedSet |
subSet(double from,
double to) |
DoubleSortedSet |
tailSet(double from) |
doubleIterator, first, headSet, last, subSet, tailSetequals, hashCode, rem, remove, removeadd, add, addAll, addAll, contains, containsAll, containsAll, isEmpty, rem, removeAll, removeAll, retainAll, retainAll, toArray, toArray, toArray, toDoubleArray, toDoubleArray, toStringclone, finalize, getClass, notify, notifyAll, wait, wait, waitadd, addAll, containsAll, rem, removeAll, retainAll, toArray, toArray, toDoubleArray, toDoubleArrayprotected AbstractDouble2ObjectSortedMap.KeySet()
public boolean contains(double k)
contains in interface DoubleCollectioncontains in class AbstractDoubleCollectionCollection.contains(Object)public int size()
size in interface Collection<Double>size in interface Set<Double>size in class AbstractCollection<Double>public void clear()
clear in interface Collection<Double>clear in interface Set<Double>clear in class AbstractCollection<Double>public DoubleComparator comparator()
DoubleSortedSetNote that this specification strengthens the one given in SortedSet.comparator().
SortedSet.comparator()public double firstDouble()
SortedSet.first()public double lastDouble()
SortedSet.last()public DoubleSortedSet headSet(double to)
SortedSet.headSet(Object)public DoubleSortedSet tailSet(double from)
SortedSet.tailSet(Object)public DoubleSortedSet subSet(double from, double to)
SortedSet.subSet(Object,Object)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.
from - an element to start from.public DoubleBidirectionalIterator iterator()
DoubleCollectionNote 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 DoubleCollectioniterator in interface DoubleIterableiterator in interface DoubleSetiterator in interface DoubleSortedSetiterator in interface Iterable<Double>iterator in interface Collection<Double>iterator in interface Set<Double>iterator in class AbstractDoubleSortedSetCopyright © 2013. All Rights Reserved.