--- jsr166/src/jdk8/java/util/PriorityQueue.java	2016/03/26 06:22:49	1.1
+++ jsr166/src/jdk8/java/util/PriorityQueue.java	2016/12/18 21:53:44	1.4
@@ -337,11 +337,8 @@ public class PriorityQueue<E> extends Ab
         int i = size;
         if (i >= queue.length)
             grow(i + 1);
+        siftUp(i, e);
         size = i + 1;
-        if (i == 0)
-            queue[0] = e;
-        else
-            siftUp(i, e);
         return true;
     }
 
@@ -633,7 +630,7 @@ public class PriorityQueue<E> extends Ab
      * promoting x up the tree until it is greater than or equal to
      * its parent, or is the root.
      *
-     * To simplify and speed up coercions and comparisons. the
+     * To simplify and speed up coercions and comparisons, the
      * Comparable and Comparator versions are separated into different
      * methods that are otherwise identical. (Similarly for siftDown.)
      *
@@ -752,11 +749,11 @@ public class PriorityQueue<E> extends Ab
     /**
      * Saves this queue to a stream (that is, serializes it).
      *
+     * @param s the stream
+     * @throws java.io.IOException if an I/O error occurs
      * @serialData The length of the array backing the instance is
      *             emitted (int), followed by all of its elements
      *             (each an {@code Object}) in the proper order.
-     * @param s the stream
-     * @throws java.io.IOException if an I/O error occurs
      */
     private void writeObject(java.io.ObjectOutputStream s)
         throws java.io.IOException {