--- jsr166/src/main/java/util/PriorityQueue.java	2013/10/22 15:21:30	1.98
+++ jsr166/src/main/java/util/PriorityQueue.java	2014/08/29 21:42:37	1.100
@@ -99,7 +99,7 @@ public class PriorityQueue<E> extends Ab
     /**
      * The number of elements in the priority queue.
      */
-    private int size = 0;
+    private int size;
 
     /**
      * The comparator, or null if priority queue uses elements'
@@ -393,7 +393,7 @@ public class PriorityQueue<E> extends Ab
      * @return {@code true} if this queue contains the specified element
      */
     public boolean contains(Object o) {
-        return indexOf(o) != -1;
+        return indexOf(o) >= 0;
     }
 
     /**
@@ -476,7 +476,7 @@ public class PriorityQueue<E> extends Ab
          * Index (into queue array) of element to be returned by
          * subsequent call to next.
          */
-        private int cursor = 0;
+        private int cursor;
 
         /**
          * Index of element returned by most recent call to next,
@@ -496,13 +496,13 @@ public class PriorityQueue<E> extends Ab
          * We expect that most iterations, even those involving removals,
          * will not need to store elements in this field.
          */
-        private ArrayDeque<E> forgetMeNot = null;
+        private ArrayDeque<E> forgetMeNot;
 
         /**
          * Element returned by the most recent call to next iff that
          * element was drawn from the forgetMeNot list.
          */
-        private E lastRetElt = null;
+        private E lastRetElt;
 
         /**
          * The modCount value that the iterator believes that the backing