| 
|
Quote: use pointer-difference for a memory-efficient doubly linked list; efficient
Topic:
lists
Quotation Skeleton
We define a [doubly linked] node of pointer distance … struct listnode * ptrdiff; … The ptrdiff pointer field holds the difference between … captured by using exclusive OR. Any instance of … By definition, the previous node of the StartNode … [p. 40] On 20,000 nodes the memory being used … On 30,000 nodes it takes 37 seconds to … the deletion of the whole list. … For the conventional implementation … Total memory taken for 20,000 nodes is 240,000 … second to run the traversal and deletion. … A memory-efficient implementation of a doubly-linked list is … Google-1 Google-2
Copyright clearance needed for quotation.
Topic: lists (8 items)