| 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 java.util.TreeSet} and {@link java.util.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. |
| 9 |
> |
* according to a {@link java.util.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 |
