Beefy Boxes and Bandwidth Generously Provided by pair Networks
P is for Practical
 
PerlMonks  

Re: Converting HoA into AoH

by robin (Chaplain)
on Oct 31, 2005 at 18:10 UTC ( #504383=note: print w/ replies, xml ) Need Help??


in reply to Converting HoA into AoH

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.


Comment on Re: Converting HoA into AoH
Download Code

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://504383]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others scrutinizing the Monastery: (9)
As of 2014-12-21 15:58 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    Is guessing a good strategy for surviving in the IT business?





    Results (106 votes), past polls