56 |
|
* the priority queue in any particular order. If you need ordered |
57 |
|
* traversal, consider using {@code Arrays.sort(pq.toArray())}. |
58 |
|
* |
59 |
< |
* <p> <strong>Note that this implementation is not synchronized.</strong> |
59 |
> |
* <p><strong>Note that this implementation is not synchronized.</strong> |
60 |
|
* Multiple threads should not access a {@code PriorityQueue} |
61 |
|
* instance concurrently if any of the threads modifies the queue. |
62 |
|
* Instead, use the thread-safe {@link |
63 |
|
* java.util.concurrent.PriorityBlockingQueue} class. |
64 |
|
* |
65 |
|
* <p>Implementation note: this implementation provides |
66 |
< |
* O(log(n)) time for the enqueing and dequeing methods |
66 |
> |
* O(log(n)) time for the enqueuing and dequeuing methods |
67 |
|
* ({@code offer}, {@code poll}, {@code remove()} and {@code add}); |
68 |
|
* linear time for the {@code remove(Object)} and {@code contains(Object)} |
69 |
|
* methods; and constant time for the retrieval methods |