Beefy Boxes and Bandwidth Generously Provided by pair Networks
No such thing as a small change
 
PerlMonks  

Re^3: finding next key in db_file

by bobf (Monsignor)
on Aug 16, 2006 at 04:55 UTC ( [id://567603]=note: print w/replies, xml ) Need Help??


in reply to Re^2: finding next key in db_file
in thread finding next key in db_file

This approach could work, but it becomes less efficient as the number of gaps increase in both frequency and size. More importantly, it is also much trickier to insert a new element or change the order of the elements. I realize that neither insertion nor reordering were specified requirements in the OP, but I was trying to generalize the solution and anticipate future needs*. A linked list would handle those requirements easily.

*I've never been part of a project that hasn't had some degree of feature creep, and this one seems likely. "Oh, good - we can delete pictures. Hey, can we add them, too?"

Replies are listed 'Best First'.
Re^4: finding next key in db_file
by sulfericacid (Deacon) on Aug 16, 2006 at 05:04 UTC
    All in all, this sounds more like a job for MySQL for the fun sorting and data integrity. I think this would work just fine if the user always checked what the last element was before creating a new element.

    You're right, it's not the most efficient way of going about it if there are large gaps.



    "Age is nothing more than an inaccurate number bestowed upon us at birth as just another means for others to judge and classify us"

    sulfericacid

Log In?
Username:
Password:

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

How do I use this?Last hourOther CB clients
Other Users?
Others romping around the Monastery: (1)
As of 2024-04-24 16:20 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found