Re^2: Efficient Linked Lists

The goal is to create a set of static HTML pages with previous and next links to move from file to file, so it's not straight iteration (Note to self: Think while typing). I need to print out the filename, then a link to the previous filename, then a link to the next filename.

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

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

Comment on Re^2: Efficient Linked Lists

Replies are listed 'Best First'.
•Re: Re^2: Efficient Linked Lists by merlyn (Sage) on Jan 31, 2003 at 23:46 UTC
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.	[reply]
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.	[reply]