I have couple interesting Java collections in my hand such as:
I wonder what would be the best practices to test these API's, from a performance and scalability perspective, i.e. which one is fastest, most scalable, performant, etc. Should I set with million(s) of random elements and use timer or something else? Just wanted to satisfy my curiosity and see which one would win.
If you need fast access to elements using index, ArrayList should be choice. If you need fast access to elements using a key, use HashMap. If you need fast add and removal of elements, use LinkedList (but it has a very poor seeking performance).
Edit: updated links to point to automatically exported project on github
Check out Caliper. It will be having its 1.0 release this fall, but many people are already using it with good results (by building it from source; sorry).
Glance over some of the ScareText at https://github.com/google/caliper/wiki/JavaMicrobenchmarks, though.
There's a white paper on somebody benchmarking Java collections. I didn't see any source code, though.
If you love us? You can donate to us via Paypal or buy me a coffee so we can maintain and grow! Thank you!
Donate Us With