Beefy Boxes and Bandwidth Generously Provided by pair Networks
Perl: the Markov chain saw

Optimized Previous and Next Accessors

by tedv (Pilgrim)
on Dec 12, 2000 at 08:26 UTC ( #46211=note: print w/ replies, xml ) Need Help??

in reply to Re: Finding Previous and Next in a HASH
in thread Finding Previous and Next in a HASH

You can get away with $keys[$index-1] and $keys[($index+1) % @keys] because the first array access, should it be negative, will access from the back of the array, and the last array access is guaranteed to be in range. So no extra checking is needed for boundaries.


Comment on Optimized Previous and Next Accessors
Select or Download Code

Log In?

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

How do I use this? | Other CB clients
Other Users?
Others about the Monastery: (7)
As of 2015-11-26 09:55 GMT
Find Nodes?
    Voting Booth?

    What would be the most significant thing to happen if a rope (or wire) tied the Earth and the Moon together?

    Results (696 votes), past polls