Lines Matching full:elements
43 * A singly-linked list is headed by a single forward pointer. The elements
45 * the expense of O(n) removal for arbitrary elements. New elements can be
47 * Elements being removed from the head of the list should use the explicit
54 * pointers for a hash table header). The elements are doubly linked
56 * traverse the list. New elements can be added to the list before
61 * list and the other to the tail of the list. The elements are singly
62 * linked to save space, so elements can only be removed from the
63 * head of the list. New elements can be added to the list before or after
68 * list and the other to the tail of the list. The elements are doubly
70 * traverse the list. New elements can be added to the list before or
75 * list and the other to the tail of the list. The elements are doubly
77 * traverse the list. New elements can be added to the list before or after
