Interface OrderedMapIterator<K,V>
- Type Parameters:
K- the type of the keys in the mapV- the type of the values in the map
- All Superinterfaces:
Iterator<K>, MapIterator<K,V>, OrderedIterator<K>
- All Known Implementing Classes:
AbstractLinkedMap.LinkMapIterator, AbstractOrderedMapIteratorDecorator, AbstractSortedMapDecorator.SortedMapIterator, DualTreeBidiMap.BidiOrderedMapIterator, EmptyOrderedMapIterator, UnmodifiableOrderedMapIterator
Defines an iterator that operates over an ordered
Map.
This iterator allows both forward and reverse iteration through the map.
- Since:
- 3.0
-
Method Summary
Modifier and TypeMethodDescriptionbooleanChecks to see if there is a previous entry that can be iterated to.previous()Gets the previous key from theMap.Methods inherited from interface Iterator
forEachRemaining
-
Method Details
-
hasPrevious
boolean hasPrevious()Checks to see if there is a previous entry that can be iterated to.- Specified by:
hasPreviousin interfaceOrderedIterator<K>- Returns:
trueif the iterator has a previous element
-
previous
Gets the previous key from theMap.- Specified by:
previousin interfaceOrderedIterator<K>- Returns:
- the previous key in the iteration
- Throws:
NoSuchElementException- if the iteration is finished
-