Beefy Boxes and Bandwidth Generously Provided by pair Networks
Don't ask to ask, just ask
 
PerlMonks  

Re^4: Optimizing Iterating over a giant hash

by chromatic (Archbishop)
on Dec 26, 2009 at 19:28 UTC ( #814441=note: print w/ replies, xml ) Need Help??


in reply to Re^3: Optimizing Iterating over a giant hash
in thread Optimizing Iterating over a giant hash

I understand that 'out of memory!' would flash when the buffer is not autoflushed in such cases....

I'm not aware of any such cases. That doesn't mean that they don't exist, merely that I've never heard of any.

Buffers tend to be something like 4k on modern Linux-style systems. I have trouble imagining a system on which saving 4k is the difference between completing a task and running out of memory, at least with Perl. (If I had to write such a program, I'd use C and forbid dynamic allocation.)


Comment on Re^4: Optimizing Iterating over a giant hash

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others contemplating the Monastery: (10)
As of 2015-07-31 18:57 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    The top three priorities of my open tasks are (in descending order of likelihood to be worked on) ...









    Results (280 votes), past polls