| 3 |
|
/** |
| 4 |
|
* An unbounded priority queue based on a priority heap. This queue orders |
| 5 |
|
* elements according to an order specified at construction time, which is |
| 6 |
< |
* specified in the same manner as {@link TreeSet} and {@link TreeMap}: |
| 6 |
> |
* specified in the same manner as {@link TreeSet} and {@link TreeMap}: |
| 7 |
|
* elements are ordered |
| 8 |
|
* either according to their <i>natural order</i> (see {@link Comparable}), or |
| 9 |
|
* according to a {@link Comparator}, depending on which constructor is used. |
| 10 |
|
* The <em>head</em> of this queue is the least element with respect to the |
| 11 |
< |
* specified ordering. If multiple elements are tied for least value, the |
| 12 |
< |
* head is one of those elements. A priority queue does not permit |
| 11 |
> |
* specified ordering. If multiple elements are tied for least value, the |
| 12 |
> |
* head is one of those elements. A priority queue does not permit |
| 13 |
|
* <tt>null</tt> elements. |
| 14 |
< |
* |
| 14 |
> |
* |
| 15 |
|
* <p>The {@link #remove()} and {@link #poll()} methods remove and |
| 16 |
|
* return the head of the queue. |
| 17 |
|
* |
| 199 |
|
return super.add(element); |
| 200 |
|
} |
| 201 |
|
|
| 202 |
< |
// /** |
| 203 |
< |
// * @throws NullPointerException if any element is <tt>null</tt>. |
| 204 |
< |
// */ |
| 205 |
< |
// public boolean addAll(Collection c) { |
| 206 |
< |
// return super.addAll(c); |
| 207 |
< |
// } |
| 202 |
> |
/** |
| 203 |
> |
* @throws NullPointerException if any element is <tt>null</tt>. |
| 204 |
> |
*/ |
| 205 |
> |
public boolean addAll(Collection<? extends E> c) { |
| 206 |
> |
return super.addAll(c); |
| 207 |
> |
} |
| 208 |
|
|
| 209 |
|
/** |
| 210 |
|
* @throws NullPointerException if the specified element is <tt>null</tt>. |
