# | Line 406 | Line 406 | public class PriorityBlockingQueue<E> ex | |
---|---|---|
406 | /** | |
407 | * Establishes the heap invariant (described above) in the entire tree, | |
408 | * assuming nothing about the order of the elements prior to the call. | |
409 | + | * This classic algorithm due to Floyd (1964) is known to be O(size). |
410 | */ | |
411 | private void heapify() { | |
412 | Object[] array = queue; |
– | Removed lines |
+ | Added lines |
< | Changed lines |
> | Changed lines |