Beefy Boxes and Bandwidth Generously Provided by pair Networks
Keep It Simple, Stupid
 
PerlMonks  

Re: Efficient Linked Lists

by YuckFoo (Abbot)
on Jan 31, 2003 at 20:50 UTC ( #231718=note: print w/replies, xml ) Need Help??


in reply to Efficient Linked Lists

Go ahead, link the whole list, then delete the previous entry of the first and the next entry of the last.

LinkFoo

for my $fileindex (0..$#filenames) { $next{$filenames[$fileindex]} = $filenames[$fileindex + 1]; $prev{$filenames[$fileindex]} = $filenames[$fileindex - 1]; } delete($prev{$filenames[0]}); delete($next{$filenames[-1]});

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others taking refuge in the Monastery: (6)
As of 2017-11-23 00:03 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    In order to be able to say "I know Perl", you must have:













    Results (327 votes). Check out past polls.

    Notices?