Beefy Boxes and Bandwidth Generously Provided by pair Networks
good chemistry is complicated,
and a little bit messy -LW
 
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

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://46211]
help
Chatterbox?
and nobody stirs...

How do I use this? | Other CB clients
Other Users?
Others wandering the Monastery: (6)
As of 2016-12-09 20:28 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    On a regular basis, I'm most likely to spy upon:













    Results (157 votes). Check out past polls.