Good day, I would like to propose a Deque/List that is implemented as a doubly linked list with a sublinear index speeding up single-element operations to (likely) O(sqrt(n)). It passes a benchmark faster than TreeList by the factor of around 5.
The data structure is hosted in GitHub: https://github.com/coderodde/IndexedLinkedList Does it have potential to be included in Collections? Best regards, rodde
