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.111 by jsr166, Wed Nov 23 20:36:31 2016 UTC vs.
Revision 1.112 by jsr166, Tue Nov 29 18:11:28 2016 UTC

#	Line 727 | Line 727 | public class PriorityQueue<E> extends Ab
727		/**
728		* Establishes the heap invariant (described above) in the entire tree,
729		* assuming nothing about the order of the elements prior to the call.
730	+	* This classic algorithm due to Floyd (1964) is known to be O(size).
731		*/
732		@SuppressWarnings("unchecked")
733		private void heapify() {

Diff Legend

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