Java: Compact a HashMap (analogue of ArrayList#trimToSize)

Is there开发者_运维问答 a way to compact a HashMap in the sense that you can with an ArrayList through its trimToSize() method?

One way I can think of is to iterate through all of the entries in the present map and populate a new one, then replace the original with the new one.

Is there a better way to accomplish this?

Well you don't need to go through iterating manually - you can just use:

map = new HashMap<String, String>(map); // Adjust type arguments as necessary

I believe that will do all the iteration for you. It's possible that clone() will do the same thing, but I don't know for sure.

Either way, I don't believe you're missing anything - I don't think there's any way of performing a "trim" operation in the current API. Unlike ArrayList, such an operation would be reasonably complex anyway (as expansion is) - it's not just a case of creating a new array and performing a single array copy. The entries need to be redistributed. The benefit of getting HashMap to do this itself internally would probably just be that the hash codes wouldn't need recomputing.

If you use the trove library instead this has support for hash map and hash set trimming (see THashMap object, compact method) and best of all, automatically trims on removal of objects when the map becomes too sparse. This should be quicker than building a new map using the standard java HashMap implementation as (presumably) it doesn't have to reorder the objects according to their hashcode, but can just use the order it already knows.