Beefy Boxes and Bandwidth Generously Provided by pair Networks
Clear questions and runnable code
get the best and fastest answer
 
PerlMonks  

Re: Dereferencing a Hash of Hashes of Hashes?

by pKai (Priest)
on Dec 04, 2007 at 21:06 UTC ( #654947=note: print w/ replies, xml ) Need Help??


in reply to Dereferencing a Hash of Hashes of Hashes?

perldoc perldsc will give you lots of information how to deal with that kind of structures. It's not that hard.

Update: expanding more directly on you bulleted list:

is it possible to step through the hashref and return the data with some sort of magic/test to see what's there?
For the 1st part see perldsc. For the second part: ref
How can one tell if these keys would be returned in the same order every time from this (or similar) module?
There are modules that implement ordered hashes. But plain vanilla Perl hashes are unordered by design.
Is this type of data structure encountered other times, with other modules?
If this is just a one-off occurrence, perhaps it's not even worth bothering with figuring out how to do this.
This is a weird question in my perception. This kind of structure is the bread and butter of every day perl programming.


Comment on Re: Dereferencing a Hash of Hashes of Hashes?

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others avoiding work at the Monastery: (10)
As of 2014-08-30 17:43 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    The best computer themed movie is:











    Results (293 votes), past polls