Lines Matching refs:tmp
46 node* tmp; variable
50 Map() : head( NULL ), tail ( NULL ),tmp(head),size_of_list(0) {} in Map()
79 tmp = head; in find()
81 while (tmp) { in find()
82 if (tmp->data == d1) { in find()
83 return tmp->data2; in find()
86 tmp = tmp->next; in find()
95 tmp = head; in find_ele()
97 while (tmp) { in find_ele()
98 if (tmp->data == d1) { in find_ele()
99 return tmp->data; in find_ele()
102 tmp = tmp->next; in find_ele()
111 tmp = head; in begin()
113 if (tmp) { in begin()
114 return (tmp->data2); in begin()
123 tmp = head; in show()
125 while (tmp) { in show()
126 printf("%d-->%d\n",tmp->data,tmp->data2); in show()
127 tmp = tmp->next; in show()
135 tmp = head; in size()
137 while (tmp) { in size()
138 tmp = tmp->next; in size()
155 tmp=head; in insert()
158 tmp = head; in insert()
166 tmp = head; in erase()
167 node* prevnode = tmp; in erase()
170 while (tmp) { in erase()
179 if ((tmp ==head) && (tmp->data ==d)) { in erase()
181 tempnode = tmp; in erase()
182 tmp = tmp->next; in erase()
183 tmp->prev = NULL; in erase()
184 head = tmp; in erase()
190 if ((tmp == tail) && (tmp->data ==d)) { in erase()
192 tempnode = tmp; in erase()
194 tmp->prev = NULL; in erase()
200 if (tmp->data == d) { in erase()
202 prevnode->next = tmp->next; in erase()
203 tmp->next->prev = prevnode->next; in erase()
204 tempnode = tmp; in erase()
210 prevnode = tmp; in erase()
211 tmp = tmp->next; in erase()
223 tmp = head; in eraseall()