| 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 |
| 176 |
|
*/ |
| 177 |
|
public PriorityQueue(Collection<? extends E> c) { |
| 178 |
|
initializeArray(c); |
| 179 |
< |
if (c instanceof SortedSet<? extends E>) { |
| 180 |
< |
SortedSet<? extends E> s = (SortedSet<? extends E>) c; |
| 179 |
> |
if (c instanceof SortedSet) { |
| 180 |
> |
// @fixme double-cast workaround for compiler |
| 181 |
> |
SortedSet<? extends E> s = (SortedSet<? extends E>) (SortedSet)c; |
| 182 |
|
comparator = (Comparator<? super E>)s.comparator(); |
| 183 |
|
fillFromSorted(s); |
| 184 |
< |
} |
| 184 |
< |
else if (c instanceof PriorityQueue<? extends E>) { |
| 184 |
> |
} else if (c instanceof PriorityQueue) { |
| 185 |
|
PriorityQueue<? extends E> s = (PriorityQueue<? extends E>) c; |
| 186 |
|
comparator = (Comparator<? super E>)s.comparator(); |
| 187 |
|
fillFromSorted(s); |
| 188 |
< |
} |
| 189 |
< |
else { |
| 188 |
> |
} else { |
| 189 |
|
comparator = null; |
| 190 |
|
fillFromUnsorted(c); |
| 191 |
|
} |
