Very nice piece of code. However, it is actually more expensive than doing it with recursion, because you are really implementing the stack handling that recursion does, but in Perl (instead of C, in which Perl is written).

Using the code below, I get the following: 

Benchmark: timing 10000 iterations of ZZamboni, chromatic...
  ZZamboni: 12 wallclock secs ( 5.64 usr +  0.00 sys =  5.64 CPU)
 chromatic: 19 wallclock secs ( 8.10 usr +  0.01 sys =  8.11 CPU)

[download]
I don't know how to benchmark memory usage of each subroutine, but that would be interesting because for a very large data structure, doing it non-recursively may actually be good in terms of memory use.

Here's the code: 

#!/usr/bin/perl -w
   use strict;
   use Benchmark;
   my $tree = '';
   my %hash = (
           1 => 1,
           2 => { 3 => 4,
                   5 => {
                           6 => 7 },
                   },
           8 => 9,
           10 => {},
   );

sub ZZamboni {
  my %hash=%{$_[0]};
  my $level=$_[1];
  my $tree='';
  my $key;
  foreach $key (sort { $a <=> $b } keys %hash) {
     $tree .= "\t" x $level . "$key => ";
     if (ref($hash{$key})) {
        $tree .= "\n" . ZZamboni($hash{$key}, $level+1);
     }
     else {
        $tree .= $hash{$key} . "\n";
     }
  }
  return $tree;
}

sub chromatic {
   my %hash=%{$_[0]};
   my @stack;
   push @stack, \%hash;
   my $level = 0;
   my $tree='';

   while (@stack) {
           my ($hash_ref, $keys_ref);
           if (ref($stack[-1]) eq 'ARRAY') {
                   ($hash_ref, $keys_ref) = @{ pop @stack };
                   $level--;
           } else {
                   $hash_ref = pop @stack;
                   $keys_ref = [ sort { $b <=> $a } (keys %$hash_ref) 
+];
           }
           while (my $key = pop @{ $keys_ref }) {
                   my $value = $hash_ref->{$key};
                   if (ref($value) eq 'HASH') {
                           $tree .= "\t" x $level . "$key => \n";
                           push @stack, ([ $hash_ref, $keys_ref ], $va
+lue);
                           $level++;
                           last;
                   } else {
                           $tree .= "\t" x $level . "$key => $value\n"
+;
   #                       print "on key $key, stack is ", $level, " l
+evels deep.\n";
                   }
           }
   }
   return $tree;
}

timethese(10000, {
        'ZZamboni' => sub { ZZamboni(\%hash, 0) },
        'chromatic' => sub { chromatic(\%hash) },
        });

[download]

--ZZamboni

In reply to RE: Iterate over HoH without Recursion by ZZamboni
in thread Iterate over HoH without Recursion by chromatic

Title:
Use:  <p> text here (a paragraph) </p>
and:  <code> code here </code>
to format your post, it's "PerlMonks-approved HTML":


  • Posts are HTML formatted. Put <p> </p> tags around your paragraphs. Put <code> </code> tags around your code and data!
  • Titles consisting of a single word are discouraged, and in most cases are disallowed outright.
  • Read Where should I post X? if you're not absolutely sure you're posting in the right place.
  • Please read these before you post! —
  • Posts may use any of the Perl Monks Approved HTML tags:
    a, abbr, b, big, blockquote, br, caption, center, col, colgroup, dd, del, details, div, dl, dt, em, font, h1, h2, h3, h4, h5, h6, hr, i, ins, li, ol, p, pre, readmore, small, span, spoiler, strike, strong, sub, summary, sup, table, tbody, td, tfoot, th, thead, tr, tt, u, ul, wbr
  • You may need to use entities for some characters, as follows. (Exception: Within code tags, you can put the characters literally.)
            For:     Use:
    & &amp;
    < &lt;
    > &gt;
    [ &#91;
    ] &#93;
  • Link using PerlMonks shortcuts! What shortcuts can I use for linking?
  • See Writeup Formatting Tips and other pages linked from there for more info.