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

Re^3: Sorting Multilevel Hashes

by hippo (Parson)
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.

Comment on Re^3: Sorting Multilevel Hashes
Download Code

Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://1083755]
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others avoiding work at the Monastery: (11)
As of 2015-11-30 12:31 GMT
Find Nodes?
    Voting Booth?

    What would be the most significant thing to happen if a rope (or wire) tied the Earth and the Moon together?

    Results (770 votes), past polls