331 |
|
} |
332 |
|
|
333 |
|
public E peek() { |
334 |
< |
if (size == 0) |
335 |
< |
return null; |
336 |
< |
return (E) queue[0]; |
334 |
> |
return (size == 0) ? null : (E) queue[0]; |
335 |
|
} |
336 |
|
|
337 |
|
private int indexOf(Object o) { |
432 |
|
* The following code can be used to dump the queue into a newly |
433 |
|
* allocated array of <tt>String</tt>: |
434 |
|
* |
435 |
< |
* <pre> |
438 |
< |
* String[] y = x.toArray(new String[0]);</pre> |
435 |
> |
* <pre> {@code String[] y = x.toArray(new String[0]);}</pre> |
436 |
|
* |
437 |
|
* Note that <tt>toArray(new Object[0])</tt> is identical in function to |
438 |
|
* <tt>toArray()</tt>. |
589 |
|
* avoid missing traversing elements. |
590 |
|
*/ |
591 |
|
private E removeAt(int i) { |
592 |
< |
assert i >= 0 && i < size; |
592 |
> |
// assert i >= 0 && i < size; |
593 |
|
modCount++; |
594 |
|
int s = --size; |
595 |
|
if (s == i) // removed last element |