Lines Matching full:linked

39  * This file defines five types of data structures: singly-linked lists,
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
54  * pointers for a hash table header). The elements are doubly linked
62  * linked to save space, so elements can only be removed from the
69  * linked so that an arbitrary element can be removed without a need to
76  * linked so that an arbitrary element can be removed without a need to
86  * Singly-linked List definitions.
104  * Singly-linked List access methods.
117  * Singly-linked List functions.