Lines Matching full:linked

45  * This file defines five types of data structures: singly-linked lists,
48  * A singly-linked list is headed by a single forward pointer. The
49  * elements are singly linked for minimum space and pointer manipulation
54  * efficiency. A singly-linked list may only be traversed in the forward
55  * direction.  Singly-linked lists are ideal for applications with large
59  * pointers for a hash table header). The elements are doubly linked
67  * linked to save space, so elements can only be removed from the
74  * linked so that an arbitrary element can be removed without a need to
81  * linked so that an arbitrary element can be removed without a need to
161  * Singly-linked List definitions.
177  * Singly-linked List functions.
224  * Singly-linked List access methods.
232  * Singly-linked Tail queue declarations.
249  * Singly-linked Tail queue functions.
317  * Singly-linked Tail queue access methods.