Beefy Boxes and Bandwidth Generously Provided by pair Networks
laziness, impatience, and hubris
 
PerlMonks  

Re: tuning hash memory usage

by tedv (Pilgrim)
on Nov 21, 2000 at 00:44 UTC ( #42584=note: print w/replies, xml ) Need Help??


in reply to tuning hash memory usage

Although it's not clear to me from the problem description, often times you don't need the full data structure throughout the algorithm. If possible, try doing your work as soon as you put an entry into the hash and then delete the entry when you're done. The total data size might be 5000, but if you only have 200 entries in your hash at any given time, that's much more acceptable.

-Ted

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://42584]
help
Chatterbox?
talexb wonders about dividing developers in those born before the Unix timestamp of zero .. and after. Spoiler: I'm before.
chacham remebers I am a mad scientist
[stevieb]: talexb I'm after by a few years, but we can still be friends because you live in my hometown ;)
[LanX]: White House
[LanX]: next inauguration ?

How do I use this? | Other CB clients
Other Users?
Others browsing the Monastery: (8)
As of 2017-08-18 13:29 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    Who is your favorite scientist and why?



























    Results (303 votes). Check out past polls.

    Notices?