--- jsr166/src/main/java/util/PriorityQueue.java	2005/11/28 23:53:32	1.58
+++ jsr166/src/main/java/util/PriorityQueue.java	2006/02/07 20:54:24	1.61
@@ -1,12 +1,11 @@
 /*
  * %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 (till 6280605 is fixed)
 
 /**
  * An unbounded priority {@linkplain Queue queue} based on a priority
@@ -311,10 +310,10 @@ public class PriorityQueue<E> extends Ab
 
     /**
      * Version of remove using reference equality, not equals.
-     * Needed by iterator.remove
+     * Needed by iterator.remove.
      *
      * @param o element to be removed from this queue, if present
-     * @return <tt>true</tt> if removed.
+     * @return <tt>true</tt> if removed
      */
     boolean removeEq(Object o) {
 	for (int i = 0; i < size; i++) {
@@ -346,7 +345,7 @@ public class PriorityQueue<E> extends Ab
      * maintained by this list.  (In other words, this method must allocate
      * a new array).  The caller is thus free to modify the returned array.
      *
-     * @return an array containing all of the elements in this queue.
+     * @return an array containing all of the elements in this queue
      */
     public Object[] toArray() {
         return Arrays.copyOf(queue, size);