77 |
|
* @author Josh Bloch, Doug Lea |
78 |
|
* @param <E> the type of elements held in this collection |
79 |
|
*/ |
80 |
+ |
@SuppressWarnings("unchecked") |
81 |
|
public class PriorityQueue<E> extends AbstractQueue<E> |
82 |
|
implements java.io.Serializable { |
83 |
|
|
332 |
|
} |
333 |
|
|
334 |
|
public E peek() { |
335 |
< |
if (size == 0) |
335 |
< |
return null; |
336 |
< |
return (E) queue[0]; |
335 |
> |
return (size == 0) ? null : (E) queue[0]; |
336 |
|
} |
337 |
|
|
338 |
|
private int indexOf(Object o) { |
433 |
|
* The following code can be used to dump the queue into a newly |
434 |
|
* allocated array of <tt>String</tt>: |
435 |
|
* |
436 |
< |
* <pre> |
438 |
< |
* String[] y = x.toArray(new String[0]);</pre> |
436 |
> |
* <pre> {@code String[] y = x.toArray(new String[0]);}</pre> |
437 |
|
* |
438 |
|
* Note that <tt>toArray(new Object[0])</tt> is identical in function to |
439 |
|
* <tt>toArray()</tt>. |
590 |
|
* avoid missing traversing elements. |
591 |
|
*/ |
592 |
|
private E removeAt(int i) { |
593 |
< |
assert i >= 0 && i < size; |
593 |
> |
// assert i >= 0 && i < size; |
594 |
|
modCount++; |
595 |
|
int s = --size; |
596 |
|
if (s == i) // removed last element |
734 |
|
* @param s the stream |
735 |
|
*/ |
736 |
|
private void writeObject(java.io.ObjectOutputStream s) |
737 |
< |
throws java.io.IOException{ |
737 |
> |
throws java.io.IOException { |
738 |
|
// Write out element count, and any hidden stuff |
739 |
|
s.defaultWriteObject(); |
740 |
|
|