Talk:Doubly-linked list/Element definition: Difference between revisions

(note: efficient doubly linked list?)
Line 8:
===Doubly linked list===
In my experience on the AmigaOS, doubly linked list are implemented in a rather different way: there's a List header that also works like a special ''mark the end element'' of the list (implemented considering the List header like a partial superposition of two nodes, one ''shifted'' with respect to the other); so the list can be traversed in both directions, we know which is the first and the last element, and we can add fastly nodes to the head '''and''' to the tail in a rather smart and fast way. I have implemented the code (anyway it surely can be found somewhere, done better: normally it is implemented as macros, I've used functions), but I suppose that creating a new task for that will clashes with this one. --[[User:ShinTakezou|ShinTakezou]] 23:57, 8 December 2008 (UTC)
:That sounds like a double ended queue to me rather than just a linked list. I may be wrong though. I haven't looked into efficiently implementing collections much since most languages just have them already. --[[User:Mwn3d|Mwn3d]] 03:17, 9 December 2008 (UTC)
Anonymous user