--- jsr166/src/main/java/util/LinkedList.java 2005/05/17 06:36:47 1.30 +++ jsr166/src/main/java/util/LinkedList.java 2005/07/18 19:14:17 1.38 @@ -6,6 +6,7 @@ */ package java.util; +import java.util.*; // for javadoc (till 6280605 is fixed) /** * Linked list implementation of the List interface. Implements all @@ -25,18 +26,20 @@ package java.util; * list. Operations that index into the list will traverse the list from * the beginning or the end, whichever is closer to the specified index.
* - * Note that this implementation is not synchronized. If multiple - * threads access a list concurrently, and at least one of the threads - * modifies the list structurally, it must 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:
- * List list = Collections.synchronizedList(new LinkedList(...)); - *+ *
Note that this implementation is not synchronized. + * If multiple threads access a linked list concurrently, and at least + * one of the threads modifies the list structurally, it must 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:
+ * List list = Collections.synchronizedList(new LinkedList(...));* *
The iterators returned by this class's iterator and
* listIterator methods are fail-fast: if the list is
@@ -65,7 +68,6 @@ package java.util;
* @see List
* @see ArrayList
* @see Vector
- * @see Collections#synchronizedList(List)
* @since 1.2
* @param This method is equivalent to {@link #add}.
*
- * @param e the element to be inserted at the end of this list
+ * @param e the element to add
*/
public void addLast(E e) {
addBefore(e, header);
@@ -187,8 +190,10 @@ public class LinkedList This method is equivalent to {@link #addLast}.
+ *
* @param e element to be appended to this list
- * @return true (as per the spec for {@link Collection#add})
+ * @return true (as specified by {@link Collection#add})
*/
public boolean add(E e) {
addBefore(e, header);
@@ -232,10 +237,10 @@ public class LinkedList The returned array will be "safe" in that no references to it are
* maintained by this list. (In other words, this method must allocate
* a new array). The caller is thus free to modify the returned array.
- *
+ *
* This method acts as bridge between array-based and collection-based
* APIs.
*