--- jsr166/src/main/java/util/PriorityQueue.java	2014/12/02 05:48:28	1.101
+++ jsr166/src/main/java/util/PriorityQueue.java	2015/02/27 19:01:11	1.105
@@ -24,8 +24,8 @@
  */
 
 package java.util;
+
 import java.util.function.Consumer;
-import java.util.stream.Stream;
 
 /**
  * An unbounded priority {@linkplain Queue queue} based on a priority heap.
@@ -111,7 +111,7 @@ public class PriorityQueue<E> extends Ab
      * The number of times this priority queue has been
      * <i>structurally modified</i>.  See AbstractList for gory details.
      */
-    transient int modCount = 0; // non-private to simplify nested class access
+    transient int modCount;     // non-private for nested class access
 
     /**
      * Creates a {@code PriorityQueue} with the default initial
@@ -435,7 +435,7 @@ public class PriorityQueue<E> extends Ab
      * The following code can be used to dump the queue into a newly
      * allocated array of {@code String}:
      *
-     *  <pre> {@code String[] y = x.toArray(new String[0]);}</pre>
+     * <pre> {@code String[] y = x.toArray(new String[0]);}</pre>
      *
      * Note that {@code toArray(new Object[0])} is identical in function to
      * {@code toArray()}.