Why use Map.entrySet() instead of Map.keySet()?

(From http://www.coderanch.com/t/382487/Java-General/java/Why-use-Map-entrySet)

 

If you just need keys, use keySet(). If you just need values, use values(). If you're going to use keys and values in your subsequent code, then you're best off using entrySet().

I frequently see people do this without entrySet(), and it usually looks something like this:

1. for (Iterator it = map.keySet().iterator(); it.hasNext(); ) {  
2.     Foo key = (Foo) it.next();  
3.     Bar value = (Bar) map.get(key);  
4.     // now do something with key and value  
5. }  

This works, but it's making the JVM do extra work for no good reason. Every time you call get() you're making the JVM spend time doing a hashcode lookup, or navigating a tree and evaluating a comparator. These operations may be fast, or not, but why do them if you don't have to? A Map.Entry gives you both key and value,   together, in the most efficient manner possible.

1. for (Iterator it = map.entrySet().iterator(); it.hasNext(); ) {  
2.     Map.Entry e = (Map.Entry) it.next();  
3.     Foo key = (Foo) e.getKey();  
4.     Bar value = (Bar) e.getValue();  
5.     // now do something with key and value  
6. } 

Under JDK 5 and later it's a little nicer:

1. for (Map.Entry<Foo,Bar> e : map.entrySet()) {  
2.     Foo key = e.getKey();  
3.     Bar value = e.getValue();  
4.     // now do something with key and value  
5. }

4:19 PM | Add a comment | Read comments (1) | Permalink | Blog it | Play Java