Lines Matching full:linked

11  * This file defines four types of data structures: singly-linked lists,
12  * singly-linked tail queues, lists and tail queues.
14  * A singly-linked list is headed by a single forward pointer. The elements
15  * are singly linked for minimum space and pointer manipulation overhead at
19  * macro for this purpose for optimum efficiency. A singly-linked list may
20  * only be traversed in the forward direction.  Singly-linked lists are ideal
24  * A singly-linked tail queue is headed by a pair of pointers, one to the
26  * singly linked for minimum space and pointer manipulation overhead at the
31  * A singly-linked tail queue may only be traversed in the forward direction.
32  * Singly-linked tail queues are ideal for applications with large datasets
36  * pointers for a hash table header). The elements are doubly linked
44  * linked so that an arbitrary element can be removed without a need to
146  * Singly-linked List declarations.
172  * Singly-linked List functions.
278  * Singly-linked Tail queue declarations.
306  * Singly-linked Tail queue functions.