| # | Line 408 | Line 408 | public class PriorityBlockingQueue<E> ex | |
|---|---|---|
| 408 | */ | |
| 409 | private void heapify() { | |
| 410 | Object[] array = queue; | |
| 411 | < | int n = size; |
| 412 | < | int half = (n >>> 1) - 1; |
| 411 | > | int n = size, i = (n >>> 1) - 1; |
| 412 | Comparator<? super E> cmp = comparator; | |
| 413 | if (cmp == null) { | |
| 414 | < | for (int i = half; i >= 0; i--) |
| 414 | > | for (; i >= 0; i--) |
| 415 | siftDownComparable(i, (E) array[i], array, n); | |
| 416 | } | |
| 417 | else { | |
| 418 | < | for (int i = half; i >= 0; i--) |
| 418 | > | for (; i >= 0; i--) |
| 419 | siftDownUsingComparator(i, (E) array[i], array, n, cmp); | |
| 420 | } | |
| 421 | } | |
| – | Removed lines |
| + | Added lines |
| < | Changed lines |
| > | Changed lines |