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.
-
Are you posting in the right place? Check out Where do I post X? to know for sure.
-
Posts may use any of the Perl Monks Approved HTML tags. Currently these include the following:
<code> <a> <b> <big>
<blockquote> <br /> <dd>
<dl> <dt> <em> <font>
<h1> <h2> <h3> <h4>
<h5> <h6> <hr /> <i>
<li> <nbsp> <ol> <p>
<small> <strike> <strong>
<sub> <sup> <table>
<td> <th> <tr> <tt>
<u> <ul>
-
Snippets of code should be wrapped in
<code> tags not
<pre> tags. In fact, <pre>
tags should generally be avoided. If they must
be used, extreme care should be
taken to ensure that their contents do not
have long lines (<70 chars), in order to prevent
horizontal scrolling (and possible janitor
intervention).
-
Want more info? How to link
or How to display code and escape characters
are good places to start.
|