Lines Matching full:linked

40  * This file defines four types of data structures: singly-linked lists,
41  * singly-linked tail queues, lists and tail queues.
43  * A singly-linked list is headed by a single forward pointer. The elements
44  * are singly linked for minimum space and pointer manipulation overhead at
48  * macro for this purpose for optimum efficiency. A singly-linked list may
49  * only be traversed in the forward direction.  Singly-linked lists are ideal
53  * A singly-linked tail queue is headed by a pair of pointers, one to the
55  * singly linked for minimum space and pointer manipulation overhead at the
60  * A singly-linked tail queue may only be traversed in the forward direction.
61  * Singly-linked tail queues are ideal for applications with large datasets
65  * pointers for a hash table header). The elements are doubly linked
73  * linked so that an arbitrary element can be removed without a need to
138  * Singly-linked List declarations.
154  * Singly-linked List functions.
210  * Singly-linked Tail queue declarations.
227  * Singly-linked Tail queue functions.