ti 14.6.2022 klo 18.49 Rodion Efremov kirjoitti:
> Hi community,
>
> > One use case I've had in the past was for a list that is
> always sorted but also allows index based access when displaying a
> window into the list.
>
> I suppose you are talking about an order s
Hello,
I have this List/Deque implementation [1] that (in a versatile benchmark)
runs much faster than ArrayList/LinkedList. Under mild assumptions, it
accesses an element in O(sqrt(N)) time.
Now, if all we want to do is to add at the tail and read via get(int
index), you are better of using java
Hello,
I was kindly directed to this mailing list in order to discuss this data
structure:
https://github.com/coderodde/LinkedList
The README of that repository contains a table of running times for
different methods and different List implementations (ArrayList,
LinkedList, my version of the Li
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
