|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Objectjava.util.AbstractCollection<K>
it.unimi.dsi.fastutil.objects.AbstractObjectCollection<K>
it.unimi.dsi.fastutil.objects.AbstractObjectSet<K>
it.unimi.dsi.fastutil.objects.AbstractObjectSortedSet<K>
it.unimi.dsi.fastutil.objects.AbstractObject2FloatSortedMap.KeySet
protected class AbstractObject2FloatSortedMap.KeySet
A wrapper exhibiting the keys of a map.
Constructor Summary | |
---|---|
protected |
AbstractObject2FloatSortedMap.KeySet()
|
Method Summary | |
---|---|
void |
clear()
|
Comparator<? super K> |
comparator()
|
boolean |
contains(Object k)
|
K |
first()
|
ObjectSortedSet<K> |
headSet(K to)
Returns a view of the portion of this sorted set whose elements are strictly less than toElement . |
ObjectBidirectionalIterator<K> |
iterator()
Returns a type-specific iterator on the elements of this collection. |
ObjectBidirectionalIterator<K> |
iterator(K from)
Returns a type-specific BidirectionalIterator on the elements in
this set, starting from a given element of the domain (optional operation). |
K |
last()
|
int |
size()
|
ObjectSortedSet<K> |
subSet(K from,
K to)
Returns a view of the portion of this sorted set whose elements range from fromElement , inclusive, to toElement , exclusive. |
ObjectSortedSet<K> |
tailSet(K from)
Returns a view of the portion of this sorted set whose elements are greater than or equal to fromElement . |
Methods inherited from class it.unimi.dsi.fastutil.objects.AbstractObjectSortedSet |
---|
objectIterator |
Methods inherited from class it.unimi.dsi.fastutil.objects.AbstractObjectSet |
---|
equals, hashCode, remove |
Methods inherited from class it.unimi.dsi.fastutil.objects.AbstractObjectCollection |
---|
add, addAll, containsAll, isEmpty, removeAll, retainAll, toArray, toArray, toString |
Methods inherited from class java.lang.Object |
---|
clone, finalize, getClass, notify, notifyAll, wait, wait, wait |
Methods inherited from interface it.unimi.dsi.fastutil.objects.ObjectSet |
---|
remove |
Methods inherited from interface it.unimi.dsi.fastutil.objects.ObjectCollection |
---|
toArray |
Methods inherited from interface java.util.Set |
---|
add, addAll, containsAll, equals, hashCode, isEmpty, removeAll, retainAll, toArray, toArray |
Constructor Detail |
---|
protected AbstractObject2FloatSortedMap.KeySet()
Method Detail |
---|
public boolean contains(Object k)
contains
in interface Collection<K>
contains
in interface Set<K>
contains
in class AbstractCollection<K>
public int size()
size
in interface Collection<K>
size
in interface Set<K>
size
in class AbstractCollection<K>
public void clear()
clear
in interface Collection<K>
clear
in interface Set<K>
clear
in class AbstractCollection<K>
public Comparator<? super K> comparator()
public K first()
public K last()
public ObjectSortedSet<K> headSet(K to)
ObjectSortedSet
toElement
.
Note that this specification strengthens the one given in SortedSet.headSet(Object)
.
SortedSet.headSet(Object)
public ObjectSortedSet<K> tailSet(K from)
ObjectSortedSet
fromElement
.
Note that this specification strengthens the one given in SortedSet.tailSet(Object)
.
SortedSet.tailSet(Object)
public ObjectSortedSet<K> subSet(K from, K to)
ObjectSortedSet
fromElement
, inclusive, to toElement
, exclusive.
Note that this specification strengthens the one given in SortedSet.subSet(Object,Object)
.
SortedSet.subSet(Object,Object)
public ObjectBidirectionalIterator<K> iterator(K from)
ObjectSortedSet
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.
from
- an element to start from.
public ObjectBidirectionalIterator<K> iterator()
ObjectCollection
Note 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 ObjectCollection<K>
iterator
in interface ObjectIterable<K>
iterator
in interface ObjectSet<K>
iterator
in interface ObjectSortedSet<K>
iterator
in interface Iterable<K>
iterator
in interface Collection<K>
iterator
in interface Set<K>
iterator
in class AbstractObjectSortedSet<K>
|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |