Lines Matching full:linked
44 * This file defines four types of data structures: singly-linked lists,
45 * singly-linked tail queues, lists and tail queues.
47 * A singly-linked list is headed by a single forward pointer. The elements
48 * are singly linked for minimum space and pointer manipulation overhead at
52 * macro for this purpose for optimum efficiency. A singly-linked list may
53 * only be traversed in the forward direction. Singly-linked lists are ideal
57 * A singly-linked tail queue is headed by a pair of pointers, one to the
59 * singly linked for minimum space and pointer manipulation overhead at the
64 * A singly-linked tail queue may only be traversed in the forward direction.
65 * Singly-linked tail queues are ideal for applications with large datasets
69 * pointers for a hash table header). The elements are doubly linked
77 * linked so that an arbitrary element can be removed without a need to
107 * Singly-linked List declarations.
123 * Singly-linked List functions.
168 * Singly-linked Tail queue declarations.
185 * Singly-linked Tail queue functions.
