Lines Matching full:linked

65  * This file defines three types of data structures: singly-linked lists,
66  * singly-linked tail queues and lists.
68  * A singly-linked list is headed by a single forward pointer. The elements
69  * are singly linked for minimum space and pointer manipulation overhead at
73  * macro for this purpose for optimum efficiency. A singly-linked list may
74  * only be traversed in the forward direction.  Singly-linked lists are ideal
78  * A singly-linked tail queue is headed by a pair of pointers, one to the
80  * singly linked for minimum space and pointer manipulation overhead at the
85  * A singly-linked tail queue may only be traversed in the forward direction.
86  * Singly-linked tail queues are ideal for applications with large datasets
90  * pointers for a hash table header). The elements are doubly linked
124  * Singly-linked List declarations.
140  * Singly-linked List functions.
233  * Singly-linked Tail queue declarations.
250  * Singly-linked Tail queue functions.