protected class AbstractInt2DoubleSortedMap.KeySet extends AbstractIntSortedSet
| Modifier | Constructor and Description |
|---|---|
protected |
AbstractInt2DoubleSortedMap.KeySet() |
| Modifier and Type | Method and Description |
|---|---|
void |
clear() |
IntComparator |
comparator()
Returns the comparator associated with this sorted set, or null if it uses its elements' natural ordering.
|
boolean |
contains(int k) |
int |
firstInt() |
IntSortedSet |
headSet(int to) |
IntBidirectionalIterator |
iterator()
Returns a type-specific iterator on the elements of this collection.
|
IntBidirectionalIterator |
iterator(int from)
Returns a type-specific
BidirectionalIterator on the elements in
this set, starting from a given element of the domain (optional operation). |
int |
lastInt() |
int |
size() |
IntSortedSet |
subSet(int from,
int to) |
IntSortedSet |
tailSet(int from) |
first, headSet, intIterator, last, subSet, tailSetequals, hashCode, rem, remove, removeadd, add, addAll, addAll, contains, containsAll, containsAll, isEmpty, rem, removeAll, removeAll, retainAll, retainAll, toArray, toArray, toArray, toIntArray, toIntArray, toStringclone, finalize, getClass, notify, notifyAll, wait, wait, waitadd, addAll, containsAll, rem, removeAll, retainAll, toArray, toArray, toIntArray, toIntArrayprotected AbstractInt2DoubleSortedMap.KeySet()
public boolean contains(int k)
contains in interface IntCollectioncontains in class AbstractIntCollectionCollection.contains(Object)public int size()
size in interface Collection<Integer>size in interface Set<Integer>size in class AbstractCollection<Integer>public void clear()
clear in interface Collection<Integer>clear in interface Set<Integer>clear in class AbstractCollection<Integer>public IntComparator comparator()
IntSortedSetNote that this specification strengthens the one given in SortedSet.comparator().
SortedSet.comparator()public int firstInt()
SortedSet.first()public int lastInt()
SortedSet.last()public IntSortedSet headSet(int to)
SortedSet.headSet(Object)public IntSortedSet tailSet(int from)
SortedSet.tailSet(Object)public IntSortedSet subSet(int from, int to)
SortedSet.subSet(Object,Object)public IntBidirectionalIterator iterator(int from)
IntSortedSetBidirectionalIterator 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 IntBidirectionalIterator iterator()
IntCollectionNote 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 IntCollectioniterator in interface IntIterableiterator in interface IntSetiterator in interface IntSortedSetiterator in interface Iterable<Integer>iterator in interface Collection<Integer>iterator in interface Set<Integer>iterator in class AbstractIntSortedSetCopyright © 2013. All Rights Reserved.