Greetings Monks,
I wanted to sort an array of hashes based on the size of each hash (i.e., the number of the key/value pairs in each hash) using something like:
#!/usr/bin/perl
use strict;
my @AoH = (
{a => 1, b => 2, c => 3},
{a => 1, b => 2},
{a => 1, b => 2, c => 3, d => 4},
{a => 1}
);
my @AoH_sorted = sort { keys(%{$AoH[$b]}) <=> keys(%{$AoH[$a]}) } @AoH
+;
foreach my $i (0 .. $#AoH_sorted) {
print "$i\t";
if (exists $AoH_sorted[$i]) {
my %hash = %{$AoH_sorted[$i]};
foreach my $key (keys %hash) {
print "$key\t";
}
}
print "\n";
}
However the above script produces the following output which obviously has not been sorted:
0 c a b
1 a b
2 c a b d
3 a
Any ideas on how to get this sort to work? Thanks!
-
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.
|