--- jsr166/src/main/java/util/LinkedList.java	2005/06/18 01:56:01	1.36
+++ jsr166/src/main/java/util/LinkedList.java	2005/12/05 02:56:59	1.42
@@ -1,12 +1,12 @@
 /*
  * %W% %E%
  *
- * Copyright 2005 Sun Microsystems, Inc. All rights reserved.
+ * Copyright 2006 Sun Microsystems, Inc. All rights reserved.
  * SUN PROPRIETARY/CONFIDENTIAL. Use is subject to license terms.
  */
 
 package java.util;
-import java.util.*; // for javadoc
+import java.util.*; // for javadoc (till 6280605 is fixed)
 
 /**
  * Linked list implementation of the <tt>List</tt> interface.  Implements all
@@ -26,18 +26,20 @@ import java.util.*; // for javadoc
  * list.  Operations that index into the list will traverse the list from
  * the beginning or the end, whichever is closer to the specified index.<p>
  *
- * <b>Note that this implementation is not synchronized.</b> If multiple
- * threads access a list concurrently, and at least one of the threads
- * modifies the list structurally, it <i>must</i> be synchronized
- * externally.  (A structural modification is any operation that adds or
- * deletes one or more elements; merely setting the value of an element is not
- * a structural modification.)  This is typically accomplished by
- * synchronizing on some object that naturally encapsulates the list.  If no
- * such object exists, the list should be "wrapped" using the
- * Collections.synchronizedList method.  This is best done at creation time,
- * to prevent accidental unsynchronized access to the list: <pre>
- *     List list = Collections.synchronizedList(new LinkedList(...));
- * </pre>
+ * <p><strong>Note that this implementation is not synchronized.</strong>
+ * If multiple threads access a linked list concurrently, and at least
+ * one of the threads modifies the list structurally, it <i>must</i> be
+ * synchronized externally.  (A structural modification is any operation
+ * that adds or deletes one or more elements; merely setting the value of
+ * an element is not a structural modification.)  This is typically
+ * accomplished by synchronizing on some object that naturally
+ * encapsulates the list.
+ *
+ * If no such object exists, the list should be "wrapped" using the
+ * {@link Collections#synchronizedList Collections.synchronizedList}
+ * method.  This is best done at creation time, to prevent accidental
+ * unsynchronized access to the list:<pre>
+ *   List list = Collections.synchronizedList(new LinkedList(...));</pre>
  *
  * <p>The iterators returned by this class's <tt>iterator</tt> and
  * <tt>listIterator</tt> methods are <i>fail-fast</i>: if the list is
@@ -66,7 +68,6 @@ import java.util.*; // for javadoc
  * @see	    List
  * @see	    ArrayList
  * @see	    Vector
- * @see	    Collections#synchronizedList(List)
  * @since 1.2
  * @param <E> the type of elements held in this collection
  */
@@ -192,7 +193,7 @@ public class LinkedList<E>
      * <p>This method is equivalent to {@link #addLast}.
      *
      * @param e element to be appended to this list
-     * @return <tt>true</tt> (as per the spec for {@link Collection#add})
+     * @return <tt>true</tt> (as specified by {@link Collection#add})
      */
     public boolean add(E e) {
 	addBefore(e, header);
@@ -485,7 +486,7 @@ public class LinkedList<E>
      * Adds the specified element as the tail (last element) of this list.
      *
      * @param e the element to add
-     * @return <tt>true</tt> (as per the spec for {@link Queue#offer})
+     * @return <tt>true</tt> (as specified by {@link Queue#offer})
      * @since 1.5
      */
     public boolean offer(E e) {
@@ -497,7 +498,7 @@ public class LinkedList<E>
      * Inserts the specified element at the front of this list.
      *
      * @param e the element to insert
-     * @return <tt>true</tt> (as per the spec for {@link Deque#offerFirst})
+     * @return <tt>true</tt> (as specified by {@link Deque#offerFirst})
      * @since 1.6
      */
     public boolean offerFirst(E e) {
@@ -509,7 +510,7 @@ public class LinkedList<E>
      * Inserts the specified element at the end of this list.
      *
      * @param e the element to insert
-     * @return <tt>true</tt> (as per the spec for {@link Deque#offerLast})
+     * @return <tt>true</tt> (as specified by {@link Deque#offerLast})
      * @since 1.6
      */
     public boolean offerLast(E e) {
@@ -546,8 +547,8 @@ public class LinkedList<E>
     }
 
     /**
-     * Retrieves and removes the first element of this list, or
-     * <tt>null</tt> if this list is empty.
+     * Retrieves and removes the first element of this list,
+     * or returns <tt>null</tt> if this list is empty.
      *
      * @return the first element of this list, or <tt>null</tt> if
      *     this list is empty
@@ -560,8 +561,8 @@ public class LinkedList<E>
     }
 
     /**
-     * Retrieves and removes the last element of this list, or
-     * <tt>null</tt> if this list is empty.
+     * Retrieves and removes the last element of this list,
+     * or returns <tt>null</tt> if this list is empty.
      *
      * @return the last element of this list, or <tt>null</tt> if
      *     this list is empty
@@ -797,6 +798,24 @@ public class LinkedList<E>
         return result;
     }
 
+    public Iterator<E> descendingIterator() {
+        return new DescendingIterator();
+    }
+
+    /** Adapter to provide descending iterators via ListItr.previous */
+    private class DescendingIterator implements Iterator {
+        final ListItr itr = new ListItr(size());
+	public boolean hasNext() {
+	    return itr.hasPrevious();
+	}
+	public E next() {
+            return itr.previous();
+        }
+	public void remove() {
+            itr.remove();
+        }
+    }
+
     /**
      * Returns a shallow copy of this <tt>LinkedList</tt>. (The elements
      * themselves are not cloned.)