--- jsr166/src/main/java/util/PriorityQueue.java	2003/08/06 18:22:09	1.24
+++ jsr166/src/main/java/util/PriorityQueue.java	2003/08/12 11:11:58	1.27
@@ -159,7 +159,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 +176,15 @@ public class PriorityQueue<E> extends Ab
      */
     public PriorityQueue(Collection<? extends E> c) {
         initializeArray(c);
-        if (c instanceof SortedSet<? extends E>) {
+        if (c instanceof SortedSet) {
             SortedSet<? extends E> s = (SortedSet<? extends E>) 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);
         }