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>

Field Summary

Fields
Modifier and Type Field Description

(package private) E cursor

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()`

Methods inherited from class java.lang.Object
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Methods inherited from interface java.util.Iterator
forEachRemaining

- Field Detail
  - cursor
```
E extends Linked<E> cursor
```
- 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()
```
    Specified by:
    
    hasNext in interface java.util.Iterator<E extends Linked<E>>
  - next
```
public E next()
```
    Specified by:
    
    next in interface java.util.Iterator<E extends Linked<E>>
  - remove
```
public void remove()
```
    Specified by:
    
    remove in interface java.util.Iterator<E extends Linked<E>>
  - computeNext
```
abstract E computeNext()
```
    Retrieves the next element to traverse to or null if there are no more elements.