> Added a fast path for `PriorityQueue#addAll` when adding elements to an > empty, exact `PriorityQueue` instance. > > Instead of inserting each element one by one through `AbstractQueue#addAll`, > the implementation now copies the source collection into the backing array > and calls `heapify()`. > This reduces the construction cost for bulk insertion into an empty queue > from repeated per-element sift-up work to linear-time heap construction. > > --------- > - [x] I confirm that I make this contribution in accordance with the [OpenJDK > Interim AI Policy](https://openjdk.org/legal/ai).
Daisuke Yamazaki has updated the pull request incrementally with one additional commit since the last revision: Add checks for non-Comparable elements ------------- Changes: - all: https://git.openjdk.org/jdk/pull/31701/files - new: https://git.openjdk.org/jdk/pull/31701/files/3a56296f..eae6835a Webrevs: - full: https://webrevs.openjdk.org/?repo=jdk&pr=31701&range=08 - incr: https://webrevs.openjdk.org/?repo=jdk&pr=31701&range=07-08 Stats: 47 lines in 2 files changed: 37 ins; 6 del; 4 mod Patch: https://git.openjdk.org/jdk/pull/31701.diff Fetch: git fetch https://git.openjdk.org/jdk.git pull/31701/head:pull/31701 PR: https://git.openjdk.org/jdk/pull/31701
