Re^4: Obtaining number of counts per each name in hash

I really don't see anything wrong with jeffa's answer.

People who have not been exposed to hashes (or dictionaries or whatever other names they might have in other languages) often have difficulties understanding the power of these structures for many purposes (counters, removing duplicates, joins, etc.).

I had the case just this week. A new hire, almost 20 years of developing experience in various languages, but no prior experience with hashes or equivalent structures. Everything else tells me that he is very probably a good developer, but I had to explain him how to use hashes to do these powerful things.

OK, I found these things by myself, as far as I can remember, when I picked up Perl 11 or 12 years ago, but maybe I just was lucky enough at the time to pick up the right tutorial giving the right clues.

Comment on Re^4: Obtaining number of counts per each name in hash

Replies are listed 'Best First'.
Re^5: Obtaining number of counts per each name in hash by GotToBTru (Prior) on Jul 07, 2015 at 20:27 UTC
There is absolutely nothing wrong with his answer. Only a difference of opinion on pedagogy :) Dum Spiro Spero	[reply]