Lines Matching full:elements

44  * A singly-linked list is headed by a single forward pointer. The elements
46  * the expense of O(n) removal for arbitrary elements. New elements can be
48  * Elements being removed from the head of the list should use the explicit
55  * head of the list and the other to the tail of the list. The elements are
57  * expense of O(n) removal for arbitrary elements. New elements can be added
59  * end of the list. Elements being removed from the head of the tail queue
66  * pointers for a hash table header). The elements are doubly linked
68  * traverse the list. New elements can be added to the list before
73  * list and the other to the tail of the list. The elements are doubly
75  * traverse the list. New elements can be added to the list before or
80  * list and the other to the tail of the list. The elements are doubly
82  * traverse the list. New elements can be added to the list before or after