protected class AbstractShort2FloatSortedMap.KeySet extends AbstractShortSortedSet
| Modifier | Constructor and Description |
|---|---|
protected |
KeySet() |
| Modifier and Type | Method and Description |
|---|---|
void |
clear() |
ShortComparator |
comparator() |
boolean |
contains(short k)
Returns
true if this collection contains the specified element. |
short |
firstShort()
Returns the first (lowest) element currently in this set.
|
ShortSortedSet |
headSet(short to)
Returns a view of the portion of this sorted set whose elements are strictly less than
toElement. |
ShortBidirectionalIterator |
iterator()
Returns a type-specific iterator on the elements of this collection.
|
ShortBidirectionalIterator |
iterator(short from)
Returns a type-specific
BidirectionalIterator on the elements in
this set, starting from a given element of the domain (optional operation). |
short |
lastShort()
Returns the last (highest) element currently in this set.
|
int |
size() |
ShortSortedSet |
subSet(short from,
short to)
Returns a view of the portion of this sorted set whose elements range from
fromElement, inclusive, to toElement, exclusive. |
ShortSortedSet |
tailSet(short from)
Returns a view of the portion of this sorted set whose elements are greater than or equal to
fromElement. |
equals, hashCode, rem, removeadd, add, addAll, contains, containsAll, remove, removeAll, retainAll, toArray, toShortArray, toShortArray, toStringaddAll, containsAll, isEmpty, removeAll, retainAll, toArray, toArrayclone, finalize, getClass, notify, notifyAll, wait, wait, waitfirst, headSet, last, subSet, tailSetadd, contains, rem, remove, removeadd, addAll, containsAll, removeAll, removeIf, removeIf, retainAll, toArray, toShortArray, toShortArrayforEach, forEachspliteratoraddAll, containsAll, equals, hashCode, isEmpty, removeAll, retainAll, toArray, toArrayparallelStream, streampublic boolean contains(short k)
AbstractShortCollectiontrue if this collection contains the specified element.
This implementation iterates over the elements in the collection, looking for the specified element.
contains in interface ShortCollectioncontains in class AbstractShortCollectionCollection.contains(Object)public int size()
size in interface Collection<Short>size in interface Set<Short>size in class AbstractCollection<Short>public void clear()
clear in interface Collection<Short>clear in interface Set<Short>clear in class AbstractCollection<Short>public ShortComparator comparator()
ShortSortedSetNote that this specification strengthens the one given in SortedSet.comparator().
public short firstShort()
ShortSortedSetSortedSet.first()public short lastShort()
ShortSortedSetSortedSet.last()public ShortSortedSet headSet(short to)
ShortSortedSettoElement.
Note that this specification strengthens the one given in SortedSet.headSet(Object).
SortedSet.headSet(Object)public ShortSortedSet tailSet(short from)
ShortSortedSetfromElement.
Note that this specification strengthens the one given in SortedSet.headSet(Object).
SortedSet.tailSet(Object)public ShortSortedSet subSet(short from, short to)
ShortSortedSetfromElement, inclusive, to toElement, exclusive.
Note that this specification strengthens the one given in SortedSet.subSet(Object,Object).
SortedSet.subSet(Object,Object)public ShortBidirectionalIterator iterator(short from)
ShortSortedSetBidirectionalIterator 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 ShortBidirectionalIterator iterator()
ShortCollectionNote 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 ShortBidirectionalIterableiterator in interface ShortCollectioniterator in interface ShortIterableiterator in interface ShortSetiterator in interface ShortSortedSetiterator in interface Iterable<Short>iterator in interface Collection<Short>iterator in interface Set<Short>iterator in class AbstractShortSortedSetIterable.iterator()Copyright © 2020. All rights reserved.