--- jsr166/src/main/java/util/PriorityQueue.java	2004/04/11 04:50:24	1.48
+++ jsr166/src/main/java/util/PriorityQueue.java	2004/06/02 23:45:46	1.50
@@ -32,8 +32,10 @@ package java.util;
  * grows automatically.  The details of the growth policy are not
  * specified.
  *
- * <p>This class implements all of the <em>optional</em> methods of
- * the {@link Collection} and {@link Iterator} interfaces.  The
+ * <p>This class and its iterator implement all of the
+ * <em>optional</em> methods of the {@link Collection} and {@link
+ * Iterator} interfaces. 
+ * The
  * Iterator provided in method {@link #iterator()} is <em>not</em>
  * guaranteed to traverse the elements of the PriorityQueue in any
  * particular order. If you need ordered traversal, consider using
@@ -325,6 +327,10 @@ public class PriorityQueue<E> extends Ab
         return offer(o);
     }
 
+    /**
+     * Removes a single instance of the specified element from this
+     * queue, if it is present.
+     */
     public boolean remove(Object o) {
         if (o == null)
             return false;
@@ -456,7 +462,8 @@ public class PriorityQueue<E> extends Ab
     }
 
     /**
-     * Remove all elements from the priority queue.
+     * Removes all elements from the priority queue.
+     * The queue will be empty after this call returns.
      */
     public void clear() {
         modCount++;