List implementation with a ListIterator that allows concurrent modifications to the underlying list. This implementation supports all of the optional {@link List} operations.It extends AbstractLinkedList and thus provides the stack/queue/dequeue operations available in {@link java.util.LinkedList}. The main feature of this class is the ability to modify the list and the iterator at the same time. Both the {@link #listIterator()} and {@link #cursor()}methods provides access to a Cursor instance which extends ListIterator. The cursor allows changes to the list concurrent with changes to the iterator. Note that the {@link #iterator()} method andsublists do not provide this cursor behaviour. The Cursor class is provided partly for backwards compatibility and partly because it allows the cursor to be directly closed. Closing the cursor is optional because references are held via a WeakReference. For most purposes, simply modify the iterator and list at will, and then let the garbage collector to the rest. Note that this implementation is not synchronized.
@author Rodney Waldhoff
@author Janek Bogucki
@author Simon Kitching
@author Matt Hall, John Watkinson, Stephen Colebourne
@version $Revision: 1.1 $ $Date: 2005/10/11 17:05:32 $
@see java.util.LinkedList
@since Commons Collections 1.0
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |