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 pull request has now been integrated. Changeset: c7b70a13 Author: Dr Heinz M. Kabutz <he...@javaspecialists.eu> Committer: Chen Liang <li...@openjdk.org> URL: https://git.openjdk.org/jdk/commit/c7b70a138ff592fdf1cd4f1d063103491a8aa7db Stats: 2 lines in 1 file changed: 0 ins; 0 del; 2 mod 8354111: JavaDoc states that Iterator.remove() is linear in the LinkedBlockingDeque Reviewed-by: liach, smarks ------------- PR: https://git.openjdk.org/jdk/pull/24500
