60 |
|
* the priority queue in any particular order. If you need ordered |
61 |
|
* traversal, consider using {@code Arrays.sort(pq.toArray())}. |
62 |
|
* |
63 |
< |
* <p> <strong>Note that this implementation is not synchronized.</strong> |
63 |
> |
* <p><strong>Note that this implementation is not synchronized.</strong> |
64 |
|
* Multiple threads should not access a {@code PriorityQueue} |
65 |
|
* instance concurrently if any of the threads modifies the queue. |
66 |
|
* Instead, use the thread-safe {@link |
783 |
|
} |
784 |
|
|
785 |
|
// wrapping constructor in method avoids transient javac problems |
786 |
< |
final PriorityQueueSpliterator<E> spliterator(int origin, int fence, |
786 |
> |
final PriorityQueueSpliterator<E> spliterator(int origin, int fence, |
787 |
|
int expectedModCount) { |
788 |
< |
return new PriorityQueueSpliterator(this, origin, fence, |
788 |
> |
return new PriorityQueueSpliterator(this, origin, fence, |
789 |
|
expectedModCount); |
790 |
|
} |
791 |
|
|