Hi, Data structure: IndexedLinkedList <https://github.com/coderodde/IndexedLinkedList> Benchmark: IndexedLinkedListBenchmark <https://github.com/coderodde/IndexedLinkedListBenchmark>
Benchmark output: https://github.com/coderodde/indexedLinkedList/#benchmark-output >From the benchmark output, we can judge that IndexedLinkedList outperforms both java.util.LinkedList and the Apache Commons Collections TreeList. It, however, does not seem to supersede the java.util.ArrayList. Basically, I would expect the IndexedLinkedList to beat the ArrayList where we have a lot of following operations: - addFirst(E) - add(int, E) - remove(int) So, what do you think? I am getting anywhere with that? Best regards, rodde
