--- jsr166/src/main/java/util/PriorityQueue.java 2003/08/04 01:48:39 1.18 +++ jsr166/src/main/java/util/PriorityQueue.java 2003/08/04 16:14:48 1.19 @@ -3,13 +3,13 @@ /** * A priority queue based on a priority heap. This queue orders * elements according to an order specified at construction time, which is - * specified in the same manner as {@link java.util.TreeSet} and + * specified in the same manner as {@link java.util.TreeSet} and * {@link java.util.TreeMap}: elements are ordered * either according to their natural order (see {@link Comparable}), or - * according to a {@link java.util.Comparator}, depending on which + * according to a {@link java.util.Comparator}, depending on which * constructor is used. - *
The head of this queue is the least element with - * respect to the specified ordering. + *
The head of this queue is the least element with + * respect to the specified ordering. * If multiple elements are tied for least value, the * head is one of those elements. A priority queue does not permit * null elements. @@ -22,7 +22,7 @@ * *
A priority queue has a capacity. The capacity is the
* size of the array used internally to store the elements on the
- * queue, and is limited to Integer.MAX_VALUE-1.
+ * queue, and is limited to Integer.MAX_VALUE-1.
* It is always at least as large as the queue size. As
* elements are added to a priority queue, its capacity grows
* automatically. The details of the growth policy are not specified.
@@ -118,8 +118,8 @@ public class PriorityQueue