Beefy Boxes and Bandwidth Generously Provided by pair Networks
We don't bite newbies here... much

Re^3: shift vs @_

by Tanktalus (Canon)
on Oct 02, 2006 at 23:24 UTC ( #575975=note: print w/ replies, xml ) Need Help??

in reply to Re^2: shift vs @_
in thread shift vs @_

This has been covered a few times. Check out:

The bottom line? Perl implements arrays by creating a block of memory, and then pointing the beginning of the array as an offset into that block. When you try to unshift too much onto the beginning of the array such that we run out of room at that end of the chunk of memory, perl goes to allocate more memory, and, again, keeps a chunk free at the beginning. However, if you're shifting off the array until it's empty, perl just keeps incrementing the "beginning" pointer until the beginning and end point at the same place, meaning a length of zero. There is no copying here whatsoever.

Comment on Re^3: shift vs @_
Replies are listed 'Best First'.
Re^4: shift vs @_
by Zadeh (Beadle) on Oct 03, 2006 at 19:35 UTC
    Thankyou. The statement in that second link about it being an O(1) operation is exactly what I was looking for--I was afraid it might be O(n).

Log In?

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

How do I use this? | Other CB clients
Other Users?
Others cooling their heels in the Monastery: (5)
As of 2015-10-10 11:45 GMT
Find Nodes?
    Voting Booth?

    Does Humor Belong in Programming?

    Results (255 votes), past polls