Beefy Boxes and Bandwidth Generously Provided by pair Networks
Clear questions and runnable code
get the best and fastest answer

Re: Printing keys from a hash by value?

by aaron_baugher (Curate)
on Jan 30, 2012 at 15:58 UTC ( #950793=note: print w/replies, xml ) Need Help??

in reply to Printing keys from a hash by value?

That's a pretty unusual way to use reverse. You'll get away with it as long as your values are all unique, but if any two values are the same, one will get clobbered. Also, since you swapped the keys and values that way before doing your sort, your sort is actually sorting by your words, which used to be your keys and are now your values.

So in my opinion, reversing the hash, even if you know your values are unique, is confusing and unnecessary. Just sort your original hash by the values, and stop after the 20th one.

my %top_words; $top_words{chr(64+$_)x4} = $_ for (1..26); # fill hash with some word/ +number pairs my $counter = 1; for my $word (sort {$top_words{$b} <=> $top_words{$a}} keys %top_words +){ print "$word\n"; last if $counter++ == 20; }

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

Replies are listed 'Best First'.
Re^2: Printing keys from a hash by value?
by ricDeez (Scribe) on Jan 30, 2012 at 16:47 UTC

    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;

      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')

      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.

Re^2: Printing keys from a hash by value?
by jms53 (Monk) on Jan 30, 2012 at 16:38 UTC

    That is very interesting. I can surely use this to benchmark the different algorithms.

    However, could you enlighten me on how the first part works? perldoc has nothing on chr... Thanks!

      chr gives the character corresponding to an ASCII value. 65 = 'A', 66 = 'B', and so on. In retrospect, I could have made my loop 65..90, but I think 1..26 makes it more obvious that I'm spanning the alphabet. Putting x4 after it just turns 'A' into 'AAAA' and so on, to make it more obvious that they're words.

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

Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://950793]
and all is quiet...

How do I use this? | Other CB clients
Other Users?
Others cooling their heels in the Monastery: (4)
As of 2017-12-15 20:28 GMT
Find Nodes?
    Voting Booth?
    What programming language do you hate the most?

    Results (443 votes). Check out past polls.