162 |
|
private void fillFromSorted(Collection<? extends E> c) { |
163 |
|
for (Iterator<? extends E> i = c.iterator(); i.hasNext(); ) { |
164 |
|
int k = ++size; |
165 |
< |
if (k >= queue.length) |
165 |
> |
if (k >= queue.length) |
166 |
|
grow(k); |
167 |
|
queue[k] = i.next(); |
168 |
|
} |
176 |
|
private void fillFromUnsorted(Collection<? extends E> c) { |
177 |
|
for (Iterator<? extends E> i = c.iterator(); i.hasNext(); ) { |
178 |
|
int k = ++size; |
179 |
< |
if (k >= queue.length) |
179 |
> |
if (k >= queue.length) |
180 |
|
grow(k); |
181 |
|
queue[k] = i.next(); |
182 |
|
} |
273 |
|
if (newlen >= Integer.MAX_VALUE / 2) // avoid overflow |
274 |
|
newlen = Integer.MAX_VALUE; |
275 |
|
else |
276 |
< |
newlen <<= 2; |
276 |
> |
newlen <<= 1; |
277 |
|
} |
278 |
|
queue = Arrays.copyOf(queue, newlen); |
279 |
|
} |