Re^2: Printing keys from a hash by value?

I'm confused! How is sort {$top_words{$b} <=> $top_words{$a}} different from reverse sort {$top_words{$a} <=> $top_words{$b}}?

Also how are the values being clobbered? I would understand this if we were 'reversing' the hash by creating a new hash where the values of the original hash were the keys of the derived hash. However I applied a reverse to a sort based on the values in the original hash. This is different from something like my %top_words = reverse %words;

Comment on Re^2: Printing keys from a hash by value? Select or Download Code

Replies are listed 'Best First'.
Re^3: Printing keys from a hash by value? by aaron_baugher (Curate) on Jan 30, 2012 at 20:28 UTC
It's not different, but that's not what he did. First he passed his hash, which presumably had words as keys and numbers as values, to `reverse`, which happily treated it as a list and reversed the list, which he assigned to another hash, turning the reversed list back into a hash. For example: `my %hash = ('one' => 1, 'two' => 2, 'three' => 3, 'four-minus-one' => +3); my %newhash = reverse %hash; # %newhash now contains (1 => 'one', 2 => 'two', 3 => 'four-minus-one' +) # or # (1 => 'one', 2 => 'two', 3 => 'three')` [download] See, it turned the original hash into a list and reversed it. Since the last item in the list was a value, that became the first item in the reversed list, becoming a key, with the next-to-last item in the original list (that value's key) becoming its value, and so on. And if any value appeared twice in the original list, it can't appear more than once as a key in the new hash, so all but one of its matching keys will be clobbered. Also, you can't know which key/value pairs will get clobbered, since a hash is unordered by definition. Aaron B. My Woefully Neglected Blog, where I occasionally mention Perl.	[reply] [d/l] [select]

Replies are listed 'Best First'.

Re^3: Printing keys from a hash by value?
by aaron_baugher (Curate) on Jan 30, 2012 at 20:28 UTC

It's not different, but that's not what he did. First he passed his hash, which presumably had words as keys and numbers as values, to reverse, which happily treated it as a list and reversed the list, which he assigned to another hash, turning the reversed list back into a hash. For example:

my %hash = ('one' => 1, 'two' => 2, 'three' => 3, 'four-minus-one' => 
+3);
my %newhash = reverse %hash;
# %newhash now contains (1 => 'one', 2 => 'two', 3 => 'four-minus-one'
+)
# or
# (1 => 'one', 2 => 'two', 3 => 'three')
[download]

See, it turned the original hash into a list and reversed it. Since the last item in the list was a value, that became the first item in the reversed list, becoming a key, with the next-to-last item in the original list (that value's key) becoming its value, and so on. And if any value appeared twice in the original list, it can't appear more than once as a key in the new hash, so all but one of its matching keys will be clobbered. Also, you can't know which key/value pairs will get clobbered, since a hash is unordered by definition.

Aaron B.
My Woefully Neglected Blog, where I occasionally mention Perl.

[reply]
[d/l]
[select]