ViewVC Help

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

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

Comparing jsr166/src/jdk7/java/util/PriorityQueue.java (file contents):
Revision 1.3 by jsr166, Sat Jan 19 18:19:46 2013 UTC vs.
Revision 1.4 by jsr166, Fri Apr 11 21:15:44 2014 UTC

#	Line 98 | Line 98 | public class PriorityQueue<E> extends Ab
98		/**
99		* The number of elements in the priority queue.
100		*/
101	<	private int size = 0;
101	>	private int size;
102
103		/**
104		* The comparator, or null if priority queue uses elements'
#	Line 110 | Line 110 | public class PriorityQueue<E> extends Ab
110		* The number of times this priority queue has been
111		* <i>structurally modified</i>.  See AbstractList for gory details.
112		*/
113	<	private transient int modCount = 0;
113	>	private transient int modCount;
114
115		/**
116		* Creates a {@code PriorityQueue} with the default initial
#	Line 473 | Line 473 | public class PriorityQueue<E> extends Ab
473		* Index (into queue array) of element to be returned by
474		* subsequent call to next.
475		*/
476	<	private int cursor = 0;
476	>	private int cursor;
477
478		/**
479		* Index of element returned by most recent call to next,
#	Line 493 | Line 493 | public class PriorityQueue<E> extends Ab
493		* We expect that most iterations, even those involving removals,
494		* will not need to store elements in this field.
495		*/
496	<	private ArrayDeque<E> forgetMeNot = null;
496	>	private ArrayDeque<E> forgetMeNot;
497
498		/**
499		* Element returned by the most recent call to next iff that
500		* element was drawn from the forgetMeNot list.
501		*/
502	<	private E lastRetElt = null;
502	>	private E lastRetElt;
503
504		/**
505		* The modCount value that the iterator believes that the backing

Diff Legend

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