get the best and fastest answer
|
|
|
|
Clear questions and runnable code get the best and fastest answer |
|
| 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?? |
|
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. Paul
In Section
Seekers of Perl Wisdom
|
|
||||||||||||||||||||