Re^2: how to loop through hash tables more efficiently

So you don't need the second loop... You can use the exists function

he is already using exists, your code doesn't map well to his example , his faux hash of arrays

Comment on Re^2: how to loop through hash tables more efficiently

Replies are listed 'Best First'.
Re^3: how to loop through hash tables more efficiently by roboticus (Chancellor) on Sep 18, 2012 at 15:32 UTC
Oh, yes, I seem to have glossed over that. When I read it, I thought he was comparing keys with keys, rather than keys and values. ...roboticus When your only tool is a hammer, all problems look like your thumb.	[reply]