Hi, I have this List/Deque data structure:
https://github.com/coderodde/IndexedLinkedList In a versatile benchmark, it outperforms the O(log n) TreeList easily by the factor of 2. (Also, it requires less memory than TreeList.) What do you think? Does it deserve to be included in collections? Best regards, rodde
