(elib.info)Doubly Linked List

---

Next: Binary tree Prev: Queue Up: Container data types

---

Enter node , (file) or (file)node

2.3 The Doubly Linked List Data Type
====================================

The doubly linked list is an efficient data structure if you need to
traverse the elements on the list in two directions, and maybe insert
new elements in the middle of the list.  You can efficiently delete any
element, and insert new elements, anywhere on the list.

   A doubly linked list ("dll" for short) consists of a number of
"nodes", each containing exactly one "element".  Some of the functions
operate directly on the elements, while some manipulate nodes.  For
instance, all of the functions that let you step forward and backwards
in the list handle nodes.  Use the function "dll-element" to extract
the element of a node.

   To use the doubly linked list provided by Elib you must put the line

     (require 'dll)

   in your elisp source file.

Creating a dll

Creating a Doubly Linked List

Entering elements

Entering elements in a dll

Accessing elements

Accessing elements of a dll

Removing nodes

Removing nodes from a dll

Predicates

Predicates on a dll

Maps and Filters

Maps and Filters on a dll

Misc dll operations

Miscellaneous dll operations

Debugging dll applications

Debugging dll applications