devxlogo

Avoiding the HashMap Size Trap

Avoiding the HashMap Size Trap

Map map = new HashMap(collection.size());for (Object obj : collection) {       map.put(obj.key, obj.value);}

The code above wants to make sure that the HashMap doesn’t need to be resized, so its sets the initial size to the number of elements that it will use. But, the HashMap implementation doesn’t behave like this, it sets its internal threshold to threshold = (int)(capacity * loadFactor), this means that it will resize after 75% of the collection has been inserted into the map, causing extra garbage. Avoid this using the code below:

Map map = new HashMap(1+ (int) (collection.size() / 0.75));
devxblackblue

About Our Editorial Process

At DevX, we’re dedicated to tech entrepreneurship. Our team closely follows industry shifts, new products, AI breakthroughs, technology trends, and funding announcements. Articles undergo thorough editing to ensure accuracy and clarity, reflecting DevX’s style and supporting entrepreneurs in the tech sphere.

See our full editorial policy.

About Our Journalist