|
||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||
java.lang.Objectorg.apache.commons.collections.list.AbstractLinkedList.LinkedListIterator<E>
protected static class AbstractLinkedList.LinkedListIterator<E>
A list iterator over the linked list.
| Field Summary | |
|---|---|
protected AbstractLinkedList.Node<E> |
current
The last node that was returned by next() or previous(). |
protected int |
expectedModCount
The modification count that the list is expected to have. |
protected AbstractLinkedList.Node<E> |
next
The node that will be returned by next(). |
protected int |
nextIndex
The index of next. |
protected AbstractLinkedList<E> |
parent
The parent list |
| Constructor Summary | |
|---|---|
protected |
AbstractLinkedList.LinkedListIterator(AbstractLinkedList<E> parent,
int fromIndex)
Create a ListIterator for a list. |
| Method Summary | |
|---|---|
void |
add(E obj)
|
protected void |
checkModCount()
Checks the modification count of the list is the value that this object expects. |
protected AbstractLinkedList.Node<E> |
getLastNodeReturned()
Gets the last node returned. |
boolean |
hasNext()
|
boolean |
hasPrevious()
Checks to see if there is a previous entry that can be iterated to. |
E |
next()
|
int |
nextIndex()
|
E |
previous()
Gets the previous element from the collection. |
int |
previousIndex()
|
void |
remove()
|
void |
set(E obj)
|
| Methods inherited from class java.lang.Object |
|---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
| Field Detail |
|---|
protected final AbstractLinkedList<E> parent
protected AbstractLinkedList.Node<E> next
next(). If this is equal
to AbstractLinkedList.header then there are no more values to return.
protected int nextIndex
next.
protected AbstractLinkedList.Node<E> current
next() or previous(). Set to null if next() or previous() haven't been called, or if the node has been removed
with remove() or a new node added with add(Object).
Should be accessed through getLastNodeReturned() to enforce
this behaviour.
protected int expectedModCount
ConcurrentModificationException may be thrown by
the operations.
| Constructor Detail |
|---|
protected AbstractLinkedList.LinkedListIterator(AbstractLinkedList<E> parent,
int fromIndex)
throws IndexOutOfBoundsException
parent - the parent listfromIndex - the index to start at
IndexOutOfBoundsException| Method Detail |
|---|
protected void checkModCount()
ConcurrentModificationException - If the list's modification
count isn't the value that was expected.
protected AbstractLinkedList.Node<E> getLastNodeReturned()
throws IllegalStateException
IllegalStateException - If next() or
previous() haven't been called, or if the node has been removed
with remove() or a new node added with add(Object).public boolean hasNext()
hasNext in interface Iterator<E>hasNext in interface ListIterator<E>public E next()
next in interface Iterator<E>next in interface ListIterator<E>public boolean hasPrevious()
OrderedIterator
hasPrevious in interface ListIterator<E>hasPrevious in interface OrderedIterator<E>true if the iterator has a previous elementpublic E previous()
OrderedIterator
previous in interface ListIterator<E>previous in interface OrderedIterator<E>public int nextIndex()
nextIndex in interface ListIterator<E>public int previousIndex()
previousIndex in interface ListIterator<E>public void remove()
remove in interface Iterator<E>remove in interface ListIterator<E>public void set(E obj)
set in interface ListIterator<E>public void add(E obj)
add in interface ListIterator<E>
|
||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||