47     node* tmp;  variable
51     Map() : head( NULL ), tail ( NULL ),tmp(head),size_of_list(0) {}  in Map()
80     tmp = head;  in find()
82     while (tmp) {  in find()
83         if (tmp->data == d1) {  in find()
84             return tmp->data2;  in find()
87         tmp = tmp->next;  in find()
96     tmp = head;  in find_ele()
98     while (tmp) {  in find_ele()
99         if (tmp->data == d1) {  in find_ele()
100             return tmp->data;  in find_ele()
103         tmp = tmp->next;  in find_ele()
112     tmp = head;  in begin()
114     if (tmp) {  in begin()
115         return (tmp->data2);  in begin()
124     tmp = head;  in show()
126     while (tmp) {  in show()
127         printf("%d-->%d\n",tmp->data,tmp->data2);  in show()
128         tmp = tmp->next;  in show()
136     tmp = head;  in size()
138     while (tmp) {  in size()
139         tmp = tmp->next;  in size()
156         tmp=head;  in insert()
159     tmp = head;  in insert()
167     tmp = head;  in erase()
168     node* prevnode = tmp;  in erase()
171     while (tmp) {  in erase()
180         if ((tmp ==head) && (tmp->data ==d)) {  in erase()
182             tempnode = tmp;  in erase()
183             tmp = tmp->next;  in erase()
184             tmp->prev = NULL;  in erase()
185             head = tmp;  in erase()
191         if ((tmp == tail) && (tmp->data ==d)) {  in erase()
193             tempnode = tmp;  in erase()
195             tmp->prev = NULL;  in erase()
201         if (tmp->data == d) {  in erase()
203             prevnode->next = tmp->next;  in erase()
204             tmp->next->prev = prevnode->next;  in erase()
205             tempnode = tmp;  in erase()
211         prevnode = tmp;  in erase()
212         tmp = tmp->next;  in erase()
224     tmp = head;  in eraseall()