my @keys =
    sort { $bdry{ $b->[0] }{ $b->[1] } <=> $bdry{ $a->[0] }{ $a->[1] }
+ }
     map { my $k = $_; map { [$k, $_] } keys %{ $bdry{$k} } }
    keys %bdry;

print "my greatest key-pair is: $bdry{$keys[0][0]}{$keys[0][1]}\n\n";

print "key-pair(@$_) is: $bdry{$_->[0]}{$_->[1]}\n" for @keys;
[download]

UPDATE: I'm glad this is was exactly what you wanted. Normally I try not to answer the entire question with code, as that takes a lot of the fun out of it; but in this case there wasn't really an easier way to say it.

that's exactly what I was looking for. Cheers

of course, jettero posted already a very compact working solution, but I found the topic interesting enough to try that one too. In contrast to the solution already given, one could solve these problems per 'hash flipping'. This would trace down the hashes of hashes and at the end of the way would put the keys of the chain plus the value into an array. This array would then be a 'flipped hash representation'. This could then be handled simply by a loop:

 ...
 my @flipped_hash = reverse sort {$a->[0] <=> $b->[0] } flippout %bdry
+;
  ...
[download]

(reverse sort - to get your desired order). This may be printed via:

 ...
 for my $k ( @flipped_hash ) {
    print " \$bdry{$k->[1]}{$k->[2]} = $k->[0];\n",
 }
 ...
[download]

which would print the desired output:

 $bdry{1}{2} = 3;
 $bdry{3}{4} = 2;
 $bdry{2}{3} = 1;
[download]

How would such a flippout() subroutine look like? A straightforward implementation would read like:

 ...
 sub flippout {
  my %h = @_;
  my @f;
  while( my ($k,$v) = each %h ) {
     while( my ($vk,$vv) = each %$v) {
        push @f, [$vv, $k, $vk]
     }
  }
  return @f
 }
 ...
[download]

This seems to be something like an explicit version of jettero's code.

Regards

mwa

Definitely less compact, arguably more readable — although I tend to read the compact stuff more easily.

But which is faster? I know I was expecting a speedup from using each instead of keying each by hand. But does the sub slow it down?

Read more... (1307 Bytes)

-Paul