protected class AbstractFloat2BooleanSortedMap.KeySet extends AbstractFloatSortedSet
| Modifier | Constructor and Description |
|---|---|
protected |
KeySet() |
| Modifier and Type | Method and Description |
|---|---|
void |
clear() |
FloatComparator |
comparator() |
boolean |
contains(float k)
Returns
true if this collection contains the specified element. |
float |
firstFloat()
Returns the first (lowest) element currently in this set.
|
FloatSortedSet |
headSet(float to)
Returns a view of the portion of this sorted set whose elements are strictly less than
toElement. |
FloatBidirectionalIterator |
iterator()
Returns a type-specific iterator on the elements of this collection.
|
FloatBidirectionalIterator |
iterator(float from)
Returns a type-specific
BidirectionalIterator on the elements in
this set, starting from a given element of the domain (optional operation). |
float |
lastFloat()
Returns the last (highest) element currently in this set.
|
int |
size() |
FloatSortedSet |
subSet(float from,
float to)
Returns a view of the portion of this sorted set whose elements range from
fromElement, inclusive, to toElement, exclusive. |
FloatSortedSet |
tailSet(float 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, toFloatArray, toFloatArray, 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, toFloatArray, toFloatArrayforEach, forEachspliteratoraddAll, containsAll, equals, hashCode, isEmpty, removeAll, retainAll, toArray, toArrayparallelStream, streampublic boolean contains(float k)
AbstractFloatCollectiontrue if this collection contains the specified element.
This implementation iterates over the elements in the collection, looking for the specified element.
contains in interface FloatCollectioncontains in class AbstractFloatCollectionCollection.contains(Object)public int size()
size in interface Collection<Float>size in interface Set<Float>size in class AbstractCollection<Float>public void clear()
clear in interface Collection<Float>clear in interface Set<Float>clear in class AbstractCollection<Float>public FloatComparator comparator()
FloatSortedSetNote that this specification strengthens the one given in SortedSet.comparator().
public float firstFloat()
FloatSortedSetSortedSet.first()public float lastFloat()
FloatSortedSetSortedSet.last()public FloatSortedSet headSet(float to)
FloatSortedSettoElement.
Note that this specification strengthens the one given in SortedSet.headSet(Object).
SortedSet.headSet(Object)public FloatSortedSet tailSet(float from)
FloatSortedSetfromElement.
Note that this specification strengthens the one given in SortedSet.headSet(Object).
SortedSet.tailSet(Object)public FloatSortedSet subSet(float from, float to)
FloatSortedSetfromElement, inclusive, to toElement, exclusive.
Note that this specification strengthens the one given in SortedSet.subSet(Object,Object).
SortedSet.subSet(Object,Object)public FloatBidirectionalIterator iterator(float from)
FloatSortedSetBidirectionalIterator 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 FloatBidirectionalIterator iterator()
FloatCollectionNote 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 FloatBidirectionalIterableiterator in interface FloatCollectioniterator in interface FloatIterableiterator in interface FloatSetiterator in interface FloatSortedSetiterator in interface Iterable<Float>iterator in interface Collection<Float>iterator in interface Set<Float>iterator in class AbstractFloatSortedSetIterable.iterator()Copyright © 2020. All rights reserved.