Beefy Boxes and Bandwidth Generously Provided by pair Networks
Syntactic Confectionery Delight

•Re: Re^2: Efficient Linked Lists

by merlyn (Sage)
on Jan 31, 2003 at 23:46 UTC ( #231756=note: print w/replies, xml ) Need Help??

in reply to Re^2: Efficient Linked Lists
in thread Efficient Linked Lists

I think a reverse lookup table will do the job nicely. Thanks.
A whuh?

Sounds like just a simple list, again. As four or five answers in this thread have already said. What requirement prevents you from using the code that has been posted four or five times?

Do not construct a doubly linked list. People build those things because they don't have perlfunc:splice, so in Perl, it's almost always the wrong way to go.

-- Randal L. Schwartz, Perl hacker
Be sure to read my standard disclaimer if this is a reply.

Replies are listed 'Best First'.
Re^4: Efficient Linked Lists
by Ionizor (Pilgrim) on Feb 01, 2003 at 04:49 UTC

    What I currently have is a function using jdporter's code above (which he described as a lookup table) that will look up the previous or next filename. Is this the code you're talking about or am I missing something?

    Grant me the wisdom to shut my mouth when I don't know what I'm talking about.

Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://231756]
and all is quiet...

How do I use this? | Other CB clients
Other Users?
Others making s'mores by the fire in the courtyard of the Monastery: (3)
As of 2018-05-25 22:46 GMT
Find Nodes?
    Voting Booth?