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

Re: performance of huge array looping

by Abigail-II (Bishop)
on Aug 14, 2002 at 11:16 UTC ( [id://190028]=note: print w/replies, xml ) Need Help??


in reply to performance of huge array looping

As you describe it, the (memory) bottle neck is when you start processing the array. Shifting off the elements at each iteration will save memory - but the memory isn't released back to the OS - it just means that it takes longer before Perl needs to ask more memory from the OS. So, wether it helps to speed up the program depends on what else you do in the program - if you won't use much more memory, there's little gain. OTOH, shift is a fast operation, so there's not much reason to not do it.

If however you are looking for a real performance boost, look into an algorithm that doesn't require the entire array to exist at one time. The fact you don't need an element anymore after you process it suggests you may not need all the elements before processing the first one either.

Abigail

Replies are listed 'Best First'.
Re: Re: performance of huge array looping
by Anonymous Monk on Aug 14, 2002 at 14:13 UTC
    I need three elements at a time.
      The your array doesn't have to have more than 3 elements at a time.

      Abigail

Log In?
Username:
Password:

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

How do I use this?Last hourOther CB clients
Other Users?
Others cooling their heels in the Monastery: (4)
As of 2024-03-29 06:22 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found