Class LinkedDeque.AbstractLinkedIterator
- java.lang.Object
-
- com.googlecode.concurrentlinkedhashmap.LinkedDeque.AbstractLinkedIterator
-
- All Implemented Interfaces:
java.util.Iterator<E>
- Enclosing class:
- LinkedDeque<E extends Linked<E>>
abstract class LinkedDeque.AbstractLinkedIterator extends java.lang.Object implements java.util.Iterator<E>
-
-
Constructor Summary
Constructors Constructor Description AbstractLinkedIterator(E start)
Creates an iterator that can can traverse the deque.
-
Method Summary
All Methods Instance Methods Abstract Methods Concrete Methods Modifier and Type Method Description (package private) abstract E
computeNext()
Retrieves the next element to traverse to or null if there are no more elements.boolean
hasNext()
E
next()
void
remove()
-
-
-
Constructor Detail
-
AbstractLinkedIterator
AbstractLinkedIterator(E start)
Creates an iterator that can can traverse the deque.- Parameters:
start
- the initial element to begin traversal from
-
-
Method Detail
-
hasNext
public boolean hasNext()
-
remove
public void remove()
-
computeNext
abstract E computeNext()
Retrieves the next element to traverse to or null if there are no more elements.
-
-