ViewVC Help

View File | Revision Log | Show Annotations | Download File | Root Listing

root/jsr166/jsr166/src/main/java/util/PriorityQueue.java

Comparing jsr166/src/main/java/util/PriorityQueue.java (file contents):
Revision 1.98 by jsr166, Tue Oct 22 15:21:30 2013 UTC vs.
Revision 1.99 by jsr166, Fri Apr 11 21:15:44 2014 UTC

#	Line 99 | Line 99 | public class PriorityQueue<E> extends Ab
99		/**
100		* The number of elements in the priority queue.
101		*/
102	<	private int size = 0;
102	>	private int size;
103
104		/**
105		* The comparator, or null if priority queue uses elements'
#	Line 476 | Line 476 | public class PriorityQueue<E> extends Ab
476		* Index (into queue array) of element to be returned by
477		* subsequent call to next.
478		*/
479	<	private int cursor = 0;
479	>	private int cursor;
480
481		/**
482		* Index of element returned by most recent call to next,
#	Line 496 | Line 496 | public class PriorityQueue<E> extends Ab
496		* We expect that most iterations, even those involving removals,
497		* will not need to store elements in this field.
498		*/
499	<	private ArrayDeque<E> forgetMeNot = null;
499	>	private ArrayDeque<E> forgetMeNot;
500
501		/**
502		* Element returned by the most recent call to next iff that
503		* element was drawn from the forgetMeNot list.
504		*/
505	<	private E lastRetElt = null;
505	>	private E lastRetElt;
506
507		/**
508		* The modCount value that the iterator believes that the backing

Diff Legend

–	Removed lines
+	Added lines
<	Changed lines
>	Changed lines