Hello. Le mar. 21 juin 2022 à 13:21, Rodion Efremov <codero...@gmail.com> a écrit : > > 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?
Do you have use-cases? Could perhaps extend the benchmarks to all the JDK collections that could target the same use-cases? Also, it may be worth actually testing different sizes. [For easier reading, please make a table with the JMH results.] Thanks, Gilles --------------------------------------------------------------------- To unsubscribe, e-mail: dev-unsubscr...@commons.apache.org For additional commands, e-mail: dev-h...@commons.apache.org
