448 |
|
final ReentrantLock lock = this.lock; |
449 |
|
lock.lock(); |
450 |
|
int n, cap; |
451 |
< |
Object[] array; |
452 |
< |
while ((n = size) >= (cap = (array = queue).length)) |
453 |
< |
tryGrow(array, cap); |
451 |
> |
Object[] es; |
452 |
> |
while ((n = size) >= (cap = (es = queue).length)) |
453 |
> |
tryGrow(es, cap); |
454 |
|
try { |
455 |
|
final Comparator<? super E> cmp; |
456 |
|
if ((cmp = comparator) == null) |
457 |
< |
siftUpComparable(n, e, array); |
457 |
> |
siftUpComparable(n, e, es); |
458 |
|
else |
459 |
< |
siftUpUsingComparator(n, e, array, cmp); |
459 |
> |
siftUpUsingComparator(n, e, es, cmp); |
460 |
|
size = n + 1; |
461 |
|
notEmpty.signal(); |
462 |
|
} finally { |