Beefy Boxes and Bandwidth Generously Provided by pair Networks
Think about Loose Coupling
 
PerlMonks  

Re: Fast seeking in a large array of hashes to generate a report.

by rev_1318 (Chaplain)
on Jun 23, 2005 at 07:23 UTC ( #469308=note: print w/ replies, xml ) Need Help??


in reply to Fast seeking in a large array of hashes to generate a report.

Why would you store all your records in a hash and then drop all you don't need? Wouldn't it be faster to query the database based on the match-requirements? That saves you the trouble of walking through the array.

If the database queries aren't an option, to could look for a unique key and transform the array into a hash, based on that key. That can save you a lot of time.
HTH

Paul


Comment on Re: Fast seeking in a large array of hashes to generate a report.

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others making s'mores by the fire in the courtyard of the Monastery: (11)
As of 2014-12-19 21:44 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    Is guessing a good strategy for surviving in the IT business?





    Results (92 votes), past polls