Map.entrySet()

enough said!

Please look at the API before complaining that it lacks something. Map.entrySet() has been there since Maps came out.

check out java.util.Map.Entry

for (java.util.Iterator iter = map.entrySet().iterator(); iter.hasNext(); ) {
java.util.Map.Entry entry = (java.util.Map.Entry) iter.next();
Object key = entry.getKey();
Object value = entry.getValue();
}

Hi and by the way to everyone my previous post has a little sarcasm in it and there are equally smalltalk zealots, java zealots, python zealots, ruby zealots, lisp zealots etc etc There will always be :)

but for people wanting to look at an open Smalltalk platform and other smalltalky things go to: [visit link] , [visit link] , [visit link]

Hi

I'm a long time Java developer but have been moving over to Smalltalk wherever I can.
Other people (Java zealots) reading this article may get the wrong impression of Smalltalkers when they read your article because its incorrect.

They'll jump all over you and think that Smalltalk is showing its age.

A Map does have the ability to return a 'pair' of key-value bindings, it always has. It's an EntrySet that holds a key and value that can be obtained via a call such as map.entrySet().

Cheers

I've used the map to store things in a keyed fashion and want to iterate over the keys and the value for each. Problem is, each time I do it I find myself thinking how inefficient it must be. The keys iterator returns the keys so it has to walk the keys, however the get(key) has to lookup the key each time.Internally implementations like HashMap store keys and values as linked list pairs

I've used the map to store things in a keyed fashion and want to iterate over the keys and the value for each. Problem is, each time I do it I find myself thinking how inefficient it must be. The keys iterator returns the keys so it has to walk the keys, however the get(key) has to lookup the key each time.Internally implementations like HashMap store keys and values as linked list pairs