Home » Tip Bank » Java
  • Email Article
  • Comment on this Article
  • Share Article
    • Digg
    • del.icio.us
    • Newvine
    • furl
    • StumbleUpon
    • BlinkList
    • Newsvine
    • Magnolia
    • Facebook
    • Tailrank
    • Slashdot
    • Technorati
    • Google Bookmarks
    • Yahoo Favorites
    • Windows Live
    • Ask
Language: Java
Expertise: Beginner
Jan 17, 2018

WEBINAR:

Live

Full Text Search: The Key to Better Natural Language Queries for NoSQL in Node.js


Date: 1/31/2018 @ 2 p.m. ET

Watch

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));
Octavia Anghel
 
Submit a Tip
Browse "Java" Tips
Browse All Tips
enable-javascript.com
activatejavascript.org