HashMap performance improvements in Java 8

HashMap<K, V> is fast, versatile and ubiquitous data structure in every Java program. First some basics. As you probably know,…

Read More »

Oracle Drops Collection Literals in JDK 8

In a posting on the OpenJDK JEP 186 Oracle’s Brian Goetz informs that Oracle will not be pursuing collection literals…

Read More »

How HashMap works in java

Most common interview questions are “How HashMap works in java”, “How get and put method of HashMap work internally”. Here…

Read More »

Java, Scala, Guava and Trove Collections – How Much Data Can They Hold?

 One of the fascinating things about our data structures is that even though we’re so familiar with them, it’s still…

Read More »

On Java Collection Waste

This article is about overhead posed by one of the most popular frameworks used – I bet there is close…

Read More »

ArrayList vs LinkedList

I must confess the title of this post is a little bit catchy. I have recently read this blog post…

Read More »

Would you dare to change HashMap implementation?

There are bold engineers working for the Oracle nowadays. I came to this conclusion when trying to nail down a…

Read More »

Most efficient way to increment a Map value in Java – Only search the key once

This question may be considered too basic, but is frequently asked in the forums. In this post, I will discuss…

Read More »

Arrays.sort versus Arrays.parallelSort

We all have used Arrays.sort to sort objects and primitive arrays. This API used merge sort OR Tim Sort underneath…

Read More »