Class LinkedTransferQueue.Itr

java.lang.Object

com.google.code.yanf4j.util.LinkedTransferQueue.Itr

All Implemented Interfaces:

Iterator<E>

Enclosing class:

LinkedTransferQueue<E>

class LinkedTransferQueue.Itr
extends Object
implements Iterator<E>

Iterators. Basic strategy is to traverse list, treating non-data (i.e., request) nodes as terminating list. Once a valid data node is found, the item is cached so that the next call to next() will return it even if subsequently removed.

Field Summary

Fields

Modifier and Type	Field	Description
(package private) LinkedTransferQueue.QNode	currentNode
(package private) E	nextItem
(package private) LinkedTransferQueue.QNode	nextNode
(package private) LinkedTransferQueue.QNode	prevNode

Constructor Summary

Constructors

Constructor	Description
Itr()

Method Summary

Modifier and Type	Method	Description
(package private) E	advance()
boolean	hasNext()
E	next()
void	remove()

Methods inherited from class Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Methods inherited from interface Iterator

forEachRemaining

Field Details

nextNode

LinkedTransferQueue.QNode nextNode

currentNode

LinkedTransferQueue.QNode currentNode

prevNode

LinkedTransferQueue.QNode prevNode

nextItem

E nextItem

Constructor Details

Itr

Itr()

Method Details

advance

E advance()

hasNext

public boolean hasNext()

Specified by:

hasNext in interface Iterator<E>

next

public E next()

Specified by:

next in interface Iterator<E>

remove

public void remove()

Specified by:

remove in interface Iterator<E>