Beefy Boxes and Bandwidth Generously Provided by pair Networks
Problems? Is your data what you think it is?

Re: foward/backward within hashes

by BazB (Priest)
on Jan 26, 2004 at 20:42 UTC ( #324268=note: print w/replies, xml ) Need Help??

in reply to foward/backward within hashes

Create an array of hashrefs, sorted by the time.

Retrieve the next/previous array element as required, dereference the hash and display the information.

Update: Maybe I should explain why: hashes are effectively randomly ordered. By creating the datastructure I suggest, you sort only once, can figure out where in the sort order you are (the current array indice) and can easy retrieve other records with minimal processing (and thought).

If the information in this post is inaccurate, or just plain wrong, don't just downvote - please post explaining what's wrong.
That way everyone learns.

Log In?

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

How do I use this? | Other CB clients
Other Users?
Others romping around the Monastery: (14)
As of 2016-10-24 18:46 GMT
Find Nodes?
    Voting Booth?
    How many different varieties (color, size, etc) of socks do you have in your sock drawer?

    Results (309 votes). Check out past polls.