<div dir="ltr">Hi,<br><div><br></div><div>Data structure: <a href="https://github.com/coderodde/IndexedLinkedList" target="_blank">IndexedLinkedList</a></div><div>Benchmark: <a href="https://github.com/coderodde/IndexedLinkedListBenchmark">IndexedLinkedListBenchmark</a></div><div><br></div><div>Benchmark output: <a href="https://github.com/coderodde/indexedLinkedList/#benchmark-output">https://github.com/coderodde/indexedLinkedList/#benchmark-output</a></div><div><br></div><div>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. </div><div><br></div><div>Basically, I would expect the IndexedLinkedList to beat the ArrayList where we have a lot of following operations:</div><div><ul><li>addFirst(E)</li><li>add(int, E)</li><li>remove(int)</li></ul><div>So, what do you think? I am getting anywhere with that?</div></div><div><br></div><div>Best regards,</div><div>rodde</div></div>