--- jsr166/src/main/java/util/PriorityQueue.java	2003/08/06 01:57:53	1.23
+++ jsr166/src/main/java/util/PriorityQueue.java	2003/08/24 23:31:53	1.29
@@ -28,6 +28,18 @@
  * elements are added to a priority queue, its capacity grows
  * automatically.  The details of the growth policy are not specified.
  *
+ * <p>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
+ * <tt>Arrays.sort(pq.toArray())</tt>.
+ *
+ * <p> <strong>Note that this implementation is not synchronized.</strong>
+ * Multiple threads should not access a <tt>PriorityQueue</tt>
+ * instance concurrently if any of the threads modifies the list
+ * structurally. Instead, use the thread-safe {@link
+ * java.util.concurrent.BlockingPriorityQueue} class.
+ *
+ * 
  * <p>Implementation note: this implementation provides O(log(n)) time
  * for the insertion methods (<tt>offer</tt>, <tt>poll</tt>,
  * <tt>remove()</tt> and <tt>add</tt>) methods; linear time for the
@@ -81,7 +93,7 @@ public class PriorityQueue<E> extends Ab
     /**
      * Creates a <tt>PriorityQueue</tt> with the default initial capacity
      * (11) that orders its elements according to their natural
-     * ordering (using <tt>Comparable</tt>.)
+     * ordering (using <tt>Comparable</tt>).
      */
     public PriorityQueue() {
         this(DEFAULT_INITIAL_CAPACITY, null);
@@ -90,7 +102,7 @@ public class PriorityQueue<E> extends Ab
     /**
      * Creates a <tt>PriorityQueue</tt> with the specified initial capacity
      * that orders its elements according to their natural ordering
-     * (using <tt>Comparable</tt>.)
+     * (using <tt>Comparable</tt>).
      *
      * @param initialCapacity the initial capacity for this priority queue.
      * @throws IllegalArgumentException if <tt>initialCapacity</tt> is less
@@ -159,7 +171,7 @@ public class PriorityQueue<E> extends Ab
      * specified collection.  The priority queue has an initial
      * capacity of 110% of the size of the specified collection or 1
      * if the collection is empty.  If the specified collection is an
-     * instance of a {@link SortedSet} or is another
+     * instance of a {@link java.util.SortedSet} or is another
      * <tt>PriorityQueue</tt>, the priority queue will be sorted
      * according to the same comparator, or according to its elements'
      * natural order if the collection is sorted according to its
@@ -176,17 +188,16 @@ public class PriorityQueue<E> extends Ab
      */
     public PriorityQueue(Collection<? extends E> c) {
         initializeArray(c);
-        if (c instanceof SortedSet<? extends E>) {
-            SortedSet<? extends E> s = (SortedSet<? extends E>) c;
+        if (c instanceof SortedSet) {
+            // @fixme double-cast workaround for compiler
+            SortedSet<? extends E> s = (SortedSet<? extends E>) (SortedSet)c;
             comparator = (Comparator<? super E>)s.comparator();
             fillFromSorted(s);
-        }
-        else if (c instanceof PriorityQueue<? extends E>) {
+        } else if (c instanceof PriorityQueue) {
             PriorityQueue<? extends E> s = (PriorityQueue<? extends E>) c;
             comparator = (Comparator<? super E>)s.comparator();
             fillFromSorted(s);
-        }
-        else {
+        } else {
             comparator = null;
             fillFromUnsorted(c);
         }
@@ -531,7 +542,7 @@ public class PriorityQueue<E> extends Ab
     /**
      * Returns the comparator used to order this collection, or <tt>null</tt>
      * if this collection is sorted according to its elements natural ordering
-     * (using <tt>Comparable</tt>.)
+     * (using <tt>Comparable</tt>).
      *
      * @return the comparator used to order this collection, or <tt>null</tt>
      * if this collection is sorted according to its elements natural ordering.