Beefy Boxes and Bandwidth Generously Provided by pair Networks RobOMonk
Perl: the Markov chain saw
 
PerlMonks  

Re: general hash questions

by davido (Cardinal)
on Dec 16, 2005 at 00:59 UTC ( [id://517151]=note: print w/replies, xml ) Need Help??

This is an archived low-energy page for bots and other anonmyous visitors. Please sign up if you are a human and want to interact.


in reply to general hash questions

Perl doesn't impose artificial restrictions on such things as how big a data structure can grow. In fact, it places very few artifical restrictions, period. It might be considered an artifical restriction that the regular expression engine is not re-entrant, but that's a stretch. And there is a warning that gets spit out if you dive too deep into recurision, unless you turn off the warning. That's somewhat contrived. But generally, no you don't have to worry about Perl preventing you from consuming 100% of your memory and swapfile space with gigantic datastructures.

As for storing your hashes, you might also look at using a data serializer such as Storable. But in the immediate, your problem seems to have already been solved by remembering not to expect lexicals to behave like package globals.


Dave

Log In?
Username:
Password:

What's my password?
Create A New User
Domain Nodelet?
Node Status?
node history
Node Type: note [id://517151]
help
Sections?
Information?
Find Nodes?
Leftovers?
    Notices?
    hippoepoptai's answer Re: how do I set a cookie and redirect was blessed by hippo!
    erzuuliAnonymous Monks are no longer allowed to use Super Search, due to an excessive use of this resource by robots.