Beefy Boxes and Bandwidth Generously Provided by pair Networks
"be consistent"
 
PerlMonks  

Re: Re^3: Autovivification with hash of hashes

by trs80 (Priest)
on Jan 26, 2003 at 23:14 UTC ( #230071=note: print w/ replies, xml ) Need Help??


in reply to Re^3: Autovivification with hash of hashes
in thread Autovivification with hash of hashes

Thank you, that is what I was trying to convey.

I think the most important thing to do when working with structures that may contain anonymous hash refereneces is to avoid using tests that access a possibly non existent hash reference key by name, which, as far as I know, is the only way to cause autovivification. I am not sure what, other then ref could even be used. This link provides some extended examples on the subject.
Autovivification Explained


Comment on Re: Re^3: Autovivification with hash of hashes
Download Code

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others musing on the Monastery: (5)
As of 2014-07-31 01:47 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    My favorite superfluous repetitious redundant duplicative phrase is:









    Results (244 votes), past polls