Beefy Boxes and Bandwidth Generously Provided by pair Networks
Clear questions and runnable code
get the best and fastest answer

Some solutions I've implemented

by Kozz (Friar)
on Jul 23, 2000 at 19:00 UTC ( #23980=note: print w/replies, xml ) Need Help??

in reply to Efficiency and Large Arrays

My dear monks:
Thank you so much for all the input and opinions. I'm learning more every day! Since reading all these comments, I've re-written my script to parse one record at a time ("paragraph mode" as suggested by Splinky) from each file, and then discarding that record when it's been printed to STDOUT. I've also created a smaller hash to store only a few needed bits of info. I've also taken the suggestion to simply re-assign the SERIAL numbers as I encounter each record, starting from zero and incrementing once per loop, since it's not necessary that these are sorted in any fashion (Why didn't I think of that before??). I think I'm also going to use some multiple hashes such that the key is the phone, as suggested above -- this should help things along as well. While the script is still slow, despite some of the changes I've made, I'll make some more modifications and even perhaps write to a hash tied to a DBM as suggested by lhoward. Thanks again, most wise monks!

Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://23980]
[erix]: ( it /might/ just be able to emulate my tpyo's )
belg4mit goes back to playing with Enju

How do I use this? | Other CB clients
Other Users?
Others musing on the Monastery: (13)
As of 2017-04-25 17:02 GMT
Find Nodes?
    Voting Booth?
    I'm a fool:

    Results (460 votes). Check out past polls.