Lines Matching full:elements

37  * A singly-linked list is headed by a single forward pointer. The elements
39  * the expense of O(n) removal for arbitrary elements. New elements can be
41  * Elements being removed from the head of the list should use the explicit
48  * head of the list and the other to the tail of the list. The elements are
50  * expense of O(n) removal for arbitrary elements. New elements can be added
52  * end of the list. Elements being removed from the head of the tail queue
59  * pointers for a hash table header). The elements are doubly linked
61  * traverse the list. New elements can be added to the list before
66  * list and the other to the tail of the list. The elements are doubly
68  * traverse the list. New elements can be added to the list before or
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 after