ZlR has asked for the wisdom of the Perl Monks concerning the following question:

Hello monks,

I know i'm being a little lazy here, but i'm still working on cleaning my HoHoH script and it makes my head hurt !

I now have the following hash :

'card' => { 'mac1' => { 'fa' => ' +9A', 'port' => + '0' }, 'mac2' => { 'fa' => ' +8A', 'port' => + '0' } }

I want to sort the keys according to val, ie get : (item2, item1) since 8A < 9A

I've done that before but can find it back, i'm sure you have a gazillion ways of doing it :)

Replies are listed 'Best First'.
Re: Sorting hash keys by sub hash values
by Corion (Patriarch) on Mar 31, 2010 at 13:28 UTC
      ok, ok, so it wasn't so difficult to find a way to do it :
      my $ref = $hash->{'card'} ; my @keys = sort { hex $ref->{$a}{'fa'} <=> hex $ref->{$b}{'fa'} } key +s % { $ref } ;
      Thanks !
Re: Sorting hash keys by sub hash values
by moritz (Cardinal) on Mar 31, 2010 at 13:28 UTC
    See perlfaq4 for answers to very similar problems.
    Perl 6 - links to (nearly) everything that is Perl 6.