Beefy Boxes and Bandwidth Generously Provided by pair Networks
Don't ask to ask, just ask

Re^3: Sorting Multilevel Hashes

by hippo (Abbot)
on Apr 25, 2014 at 08:23 UTC ( #1083755=note: print w/replies, xml ) Need Help??

in reply to Re^2: Sorting Multilevel Hashes
in thread Sorting Multilevel Hashes

Here's an example of sorting by key using recursion.

#!/usr/bin/perl -Tw # # Multi-level hash sort use strict; use warnings; my %timing1 = initmyhash(); printsortedhash (\%timing1, ''); exit; sub initmyhash { # Obviously, put whatever sets up your hash here. return ( dog => 'rover', cat => { name => 'sandy', age => 10 } ); } sub printsortedhash { my ($this, $report) = @_; for my $key (sort keys %$this) { if (ref $this->{$key} eq 'HASH') { printsortedhash ($this->{$key}, $report . "\t $key") } else { print $report . "\t $key\t $this->{$key}\n"; } } }

The FAQ linked above shows how to sort by value instead/also. Take your pick.

Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://1083755]
[erix]: ambysinistral ;)
[Discipulus]: the fun is the mother used to say ' two left hand' to describe people unabel to manual work..

How do I use this? | Other CB clients
Other Users?
Others musing on the Monastery: (5)
As of 2018-02-19 12:19 GMT
Find Nodes?
    Voting Booth?
    When it is dark outside I am happiest to see ...

    Results (264 votes). Check out past polls.