Hi,
Thanks for sharing.
I browsed through the code (not a review) and gave it a test drive, generally
it looks of good quality.
Over time, since LinkedList was added, there are less reasons to use it,
thereby making such improvements you propose less impactful. CPU caches have
got much better
Oh, just fyi, remember to send to core-libs-dev@openjdk.java.net as well;
gmail removes the mailing list when you reply by default, so our discussion
like these are not shared there.
We might need to check the common use cases of linked list in other places
(since jdk has largely eliminated it); I
-- Forwarded message -
From: -
Date: Wed, Aug 18, 2021 at 11:34 PM
Subject: Re: [(Much) faster java.util.LinkedList]
To: Rodion Efremov
The main drawback is that this linked list now runs at O(sqrt(N)) than O(1)
time complexity for single-element head/tail modifications, which
Hello,
I have implemented a heuristic, indexed doubly-linked list data structure
[1][2] implementing java.util.List and java.util.Deque interfaces that has
superior performance compared to java.util.LinkedList and
java.util.ArrayList.
I would like to propose it into the upcoming versions of OpenJ
