81 |
|
/** |
82 |
|
* Creates a <tt>PriorityQueue</tt> with the default initial capacity |
83 |
|
* (11) that orders its elements according to their natural |
84 |
< |
* ordering (using <tt>Comparable</tt>.) |
84 |
> |
* ordering (using <tt>Comparable</tt>). |
85 |
|
*/ |
86 |
|
public PriorityQueue() { |
87 |
|
this(DEFAULT_INITIAL_CAPACITY, null); |
90 |
|
/** |
91 |
|
* Creates a <tt>PriorityQueue</tt> with the specified initial capacity |
92 |
|
* that orders its elements according to their natural ordering |
93 |
< |
* (using <tt>Comparable</tt>.) |
93 |
> |
* (using <tt>Comparable</tt>). |
94 |
|
* |
95 |
|
* @param initialCapacity the initial capacity for this priority queue. |
96 |
|
* @throws IllegalArgumentException if <tt>initialCapacity</tt> is less |
159 |
|
* specified collection. The priority queue has an initial |
160 |
|
* capacity of 110% of the size of the specified collection or 1 |
161 |
|
* if the collection is empty. If the specified collection is an |
162 |
< |
* instance of a {@link SortedSet} or is another |
162 |
> |
* instance of a {@link java.util.SortedSet} or is another |
163 |
|
* <tt>PriorityQueue</tt>, the priority queue will be sorted |
164 |
|
* according to the same comparator, or according to its elements' |
165 |
|
* natural order if the collection is sorted according to its |
531 |
|
/** |
532 |
|
* Returns the comparator used to order this collection, or <tt>null</tt> |
533 |
|
* if this collection is sorted according to its elements natural ordering |
534 |
< |
* (using <tt>Comparable</tt>.) |
534 |
> |
* (using <tt>Comparable</tt>). |
535 |
|
* |
536 |
|
* @return the comparator used to order this collection, or <tt>null</tt> |
537 |
|
* if this collection is sorted according to its elements natural ordering. |