Beefy Boxes and Bandwidth Generously Provided by pair Networks
No such thing as a small change

Re: Re: flattening Complex Datastructures

by jdporter (Canon)
on Feb 11, 2003 at 17:43 UTC ( #234470=note: print w/replies, xml ) Need Help??

in reply to Re: flattening Complex Datastructures
in thread flattening Complex Datastructures

Your approach is really good if, all in all, what you need is to always reach the leaves of the tree
Yep. How many times have we seen this question:
I have a vector of keys, @keys = qw( foo bar none ); How can I easily get at the HoHoH element $h{foo}{bar}{none} ???
If we use the perl4 approach to multidimensional hashes, instead of true nested hashes, it's simple:
$h{@keys} that you could tie your hashes to: you keep working with HoH on the front-end, and get with a flat hash on the back-end.
Yes, that sounds very much like the Tie::Multidim module.

The 6th Rule of Perl Club is -- There is no Rule #6.

Replies are listed 'Best First'.
Re: Re: Re: flattening Complex Datastructures
by Ctrl-z (Friar) on Feb 11, 2003 at 17:56 UTC
    Ah!, now i get your original post. This is pretty cool.

    time was, I could move my arms like a bird and...

Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://234470]
[Eily]: I just wrote a oneliner to solve a (non perl) colleague's problem, and it worked on the first try

How do I use this? | Other CB clients
Other Users?
Others imbibing at the Monastery: (7)
As of 2017-04-26 14:58 GMT
Find Nodes?
    Voting Booth?
    I'm a fool:

    Results (482 votes). Check out past polls.