Modifier and Type | Field and Description |
---|---|
private Iterator<T> |
baseIterator |
private long |
index |
private T |
next |
private T |
removable |
Modifier | Constructor and Description |
---|---|
private |
FastListIteratorImpl() |
Modifier and Type | Method and Description |
---|---|
private T |
getNext()
Find the next eligible node, null if there is none. skip over removed
nodes, and stop on reaching a Node that was added after this scan
started.
|
boolean |
hasNext() |
T |
next() |
void |
remove() |
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
forEachRemaining
private T extends FastList.Node removable
private T extends FastList.Node next
private final long index
private final Iterator<T extends FastList.Node> baseIterator
public boolean hasNext()
hasNext
in interface Iterator<T extends FastList.Node>
public T next()
next
in interface Iterator<T extends FastList.Node>
public void remove()
remove
in interface Iterator<T extends FastList.Node>
private T getNext()
Copyright 2007-2016, multiple authors.
Licensed under the Apache License, Version 2.0, see the NOTICE file for attributions.