Lines Matching full:tail
46 node* tail;
51 Map() : head( NULL ), tail ( NULL ),tmp(head),size_of_list(0) {}
53 return ( !head || !tail );
149 tail = new node(data, data2,tail, NULL);
151 if ( tail->prev )
152 tail->prev->next = tail;
155 head = tail;
172 if ((head == tail) && (head->data == d)) {
175 head = tail = NULL;
191 if ((tmp == tail) && (tmp->data ==d)) {
196 tail = prevnode;
233 tail = head = NULL;
