Java Doc for CursorableLinkedList.java in  » Library » Apache-common-Collections » org » apache » commons » collections » Java Source Code / Java DocumentationJava Source Code and Java Documentation

Implements all of the optional List operations, the stack/queue/dequeue operations available in java.util.LinkedList and supports a ListIterator that allows concurrent modifications to the underlying list (see CursorableLinkedList.cursor ).

Note that this implementation is not synchronized.
See Also:   java.util.LinkedList
since:
   Commons Collections 1.0
version:
   $Revision: 404858 $ $Date: 2006-05-07 22:40:39 +0100 (Sun, 07 May 2006) $
author:
   Rodney Waldhoff
author:
   Janek Bogucki
author:
   Simon Kitching

_head.next() points to the first element in the list, _head.prev() to the last.

_head.next() points to the first element in the list, _head.prev() to the last. Note that it is possible for _head.next().prev() and _head.prev().next() to be non-null, as when I am a sublist for some larger list. Use == _head.next() and == _head.prev() to determine if a given org.apache.commons.collections.CursorableLinkedList.Listable is the first or last element in the list.

Specifically, when elements are added to the list before or after the cursor, the cursor simply picks them up automatically. When the "current" (i.e., last returned by ListIterator.next or ListIterator.previous ) element of the list is removed, the cursor automatically adjusts to the change (invalidating the last returned value--i.e., it cannot be removed).

Note that the returned ListIterator does not support the ListIterator.nextIndex and ListIterator.previousIndex methods (they throw UnsupportedOperationException when invoked.

Historical Note: In previous versions of this class, the object returned from this method was required to be explicitly closed. This is no longer necessary.
See Also:   CursorableLinkedList.cursor(int)
See Also:   CursorableLinkedList.listIterator
See Also:   CursorableLinkedList.Cursor

 hashCode = 1;
 Iterator i = list.iterator();
 while (i.hasNext()) {
 Object obj = i.next();
 hashCode = 31*hashCode + (obj==null ? 0 : obj.hashCode());
 }