Lines Matching full:tail
47 node* tail;
52 Map() : head( NULL ), tail ( NULL ),tmp(head),size_of_list(0) {}
53 bool empty() const { return ( !head || !tail ); }
144 tail = new node(data, data2,tail, NULL);
145 if( tail->prev )
146 tail->prev->next = tail;
150 head = tail;
167 if((head == tail) && (head->data == d))
171 head = tail = NULL;
186 if((tmp == tail) && (tmp->data ==d))
192 tail = prevnode;
225 tail = head = NULL;
