Here is a confusing but concise recursive function that does what I think you want.
sub hoa2aoh {
my ($h, @r) = shift; keys %$h;
my ($k,$v) = each %$h or return [{}];
delete $h->{$k}, return hoa2aoh($h) if !@$v;
my $hd = shift @$v; my $r = hoa2aoh($h);
(exists $_->{$k} ? push(@r, {%$_, $k=>$hd}) : ($_->{$k} = $hd))
foreach @$r;
push @$r, @r; return $r;
}
It destroys the input, so you might need to make a deep copy of it first.
I would explain how it works, but it’s quite a fun puzzle like this. :-)
Update: Roy Johnson (above) has just posted a nicer implementation of the same idea.
-
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.
|
