On Tue, 8 Apr 2025 08:50:37 GMT, kabutz <d...@openjdk.org> wrote: > One of the features of the LinkedBlockingDeque is that it is a doubly-linked > node queue, with pointers in each node to "prev" and "next", which allows > remove() in the Iterator to remove the node in constant time. However, in the > JavaDoc of the class, it lists Iterator.remove() as an example of a method > that takes linear time.
This seems to date from JDK 6 when LBD was added. The list of methods in the class description that don't run in constant time isn't fully exhaustive, but doing a CSR would do no harm here. ------------- PR Comment: https://git.openjdk.org/jdk/pull/24500#issuecomment-2789611312
