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

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.

-Ted


Comment on Optimized Previous and Next Accessors
Select or Download Code

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others pondering the Monastery: (11)
As of 2014-09-23 19:47 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    How do you remember the number of days in each month?











    Results (240 votes), past polls