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 |
725 |
|
} |
726 |
|
|
727 |
|
/** |
728 |
< |
* Saves the state of the instance to a stream (that |
729 |
< |
* is, serializes it). |
728 |
> |
* Saves this queue to a stream (that is, serializes it). |
729 |
|
* |
730 |
|
* @serialData The length of the array backing the instance is |
731 |
|
* emitted (int), followed by all of its elements |
732 |
|
* (each an {@code Object}) in the proper order. |
734 |
– |
* @param s the stream |
733 |
|
*/ |
734 |
|
private void writeObject(java.io.ObjectOutputStream s) |
735 |
|
throws java.io.IOException { |
745 |
|
} |
746 |
|
|
747 |
|
/** |
748 |
< |
* Reconstitutes the {@code PriorityQueue} instance from a stream |
751 |
< |
* (that is, deserializes it). |
752 |
< |
* |
753 |
< |
* @param s the stream |
748 |
> |
* Reconstitutes this queue from a stream (that is, deserializes it). |
749 |
|
*/ |
750 |
|
private void readObject(java.io.ObjectInputStream s) |
751 |
|
throws java.io.IOException, ClassNotFoundException { |