Beefy Boxes and Bandwidth Generously Provided by pair Networks
Keep It Simple, Stupid
 
PerlMonks  

Re^3: Iterating through Two Arrays. Is there a better use of memory?

by DentArthurDent (Monk)
on Oct 13, 2011 at 17:29 UTC ( #931336=note: print w/ replies, xml ) Need Help??


in reply to Re^2: Iterating through Two Arrays. Is there a better use of memory?
in thread Iterating through Two Arrays. Is there a better use of memory?

Back in the day, I made a traveling salesman problem solver which used Perl hashes to reduce the search space. The script started using gigabytes of memory once you got above a few million hash keys. If you're dealing with thousands of items, I wouldn't worry unless you're in a low-memory environment.

My mission: To boldy split infinitives that have never been split before!


Comment on Re^3: Iterating through Two Arrays. Is there a better use of memory?
Re^4: Iterating through Two Arrays. Is there a better use of memory?
by Jeri (Scribe) on Oct 13, 2011 at 17:32 UTC
    Great! I will use a hash!

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others pondering the Monastery: (9)
As of 2014-09-02 08:49 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    My favorite cookbook is:










    Results (20 votes), past polls