Interface OrderedIterator<E>
- Type Parameters:
E
- the type of elements returned by this iterator
- All Superinterfaces:
Iterator<E>
- All Known Subinterfaces:
OrderedMapIterator<K,
,V> ResettableListIterator<E>
- All Known Implementing Classes:
AbstractLinkedMap.EntrySetIterator
,AbstractLinkedMap.KeySetIterator
,AbstractLinkedMap.LinkMapIterator
,AbstractLinkedMap.ValuesIterator
,AbstractSortedMapDecorator.SortedMapIterator
,DualTreeBidiMap.BidiOrderedMapIterator
,EmptyOrderedIterator
,EmptyOrderedMapIterator
,ListIteratorWrapper
,UnmodifiableOrderedMapIterator
Defines an iterator that operates over an ordered container. Subset of
ListIterator
.
This iterator allows both forward and reverse iteration through the container.
- Since:
- 3.0
-
Method Details
-
hasPrevious
boolean hasPrevious()Checks to see if there is a previous element that can be iterated to.- Returns:
true
if the iterator has a previous element
-
previous
E previous()Gets the previous element from the container.- Returns:
- the previous element in the iteration
- Throws:
NoSuchElementException
- if the iteration is finished
-