it.unimi.dsi.fastutil.objects
Class AbstractReference2IntSortedMap.KeySetIterator<K>
java.lang.Object
it.unimi.dsi.fastutil.objects.AbstractObjectIterator<K>
it.unimi.dsi.fastutil.objects.AbstractObjectBidirectionalIterator<K>
it.unimi.dsi.fastutil.objects.AbstractReference2IntSortedMap.KeySetIterator<K>
- All Implemented Interfaces:
- BidirectionalIterator<K>, ObjectBidirectionalIterator<K>, ObjectIterator<K>, Iterator<K>
- Enclosing class:
- AbstractReference2IntSortedMap<K>
protected static class AbstractReference2IntSortedMap.KeySetIterator<K>
- extends AbstractObjectBidirectionalIterator<K>
A wrapper exhibiting a map iterator as an iterator on keys.
To provide an iterator on keys, just create an instance of this
class using the corresponding iterator on entries.
Method Summary |
boolean |
hasNext()
|
boolean |
hasPrevious()
Returns whether there is a previous element. |
K |
next()
|
K |
previous()
Returns the previous element from the collection. |
Methods inherited from class java.lang.Object |
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
i
protected final ObjectBidirectionalIterator<Map.Entry<K,Integer>> i
AbstractReference2IntSortedMap.KeySetIterator
public AbstractReference2IntSortedMap.KeySetIterator(ObjectBidirectionalIterator<Map.Entry<K,Integer>> i)
next
public K next()
previous
public K previous()
- Description copied from interface:
BidirectionalIterator
- Returns the previous element from the collection.
- Returns:
- the previous element from the collection.
- See Also:
ListIterator.previous()
hasNext
public boolean hasNext()
hasPrevious
public boolean hasPrevious()
- Description copied from interface:
BidirectionalIterator
- Returns whether there is a previous element.
- Returns:
- whether there is a previous element.
- See Also:
ListIterator.hasPrevious()
Copyright © 2011. All Rights Reserved.