Lines Matching full:linked
34 * This file defines five types of data structures: singly-linked lists,
35 * singly-linked tail queues, lists, tail queues, and circular queues.
37 * A singly-linked list is headed by a single forward pointer. The elements
38 * are singly linked for minimum space and pointer manipulation overhead at
42 * macro for this purpose for optimum efficiency. A singly-linked list may
43 * only be traversed in the forward direction. Singly-linked lists are ideal
47 * A singly-linked tail queue is headed by a pair of pointers, one to the
49 * singly linked for minimum space and pointer manipulation overhead at the
54 * A singly-linked tail queue may only be traversed in the forward direction.
55 * Singly-linked tail queues are ideal for applications with large datasets
59 * pointers for a hash table header). The elements are doubly linked
67 * linked so that an arbitrary element can be removed without a need to
74 * linked so that an arbitrary element can be removed without a need to
105 * Singly-linked List declarations.
121 * Singly-linked List functions.
166 * Singly-linked Tail queue declarations.
183 * Singly-linked Tail queue functions.