96     HeapEntry**  _list;
104         _list = (HeapEntry**)malloc (sizeof(HeapEntry*) * (_max+1));
105         heap_assert(_list);
106         memset(_list, 0, sizeof(HeapEntry*) * (_max+1));
110         if (_list) {  in ~HeapList()
111             free(_list);  in ~HeapList()
112             _list = NULL;  in ~HeapList()
128         memcpy(new_list, _list, sizeof(HeapEntry*) * (_max+1));  in HeapResize()
129         free(_list);  in HeapResize()
130         _list = new_list;  in HeapResize()
150         return (_count > 0) ? _list[1] : NULL;  in HeapTop()
180         if (_list[pos]->HeapValueCmp(_list[pos/2]) < 0)  in HeapUp()
182             HeapEntry* tmp = _list[pos/2];  in HeapUp()
183             _list[pos/2] = _list[pos];  in HeapUp()
184             _list[pos] = tmp;  in HeapUp()
186             _list[pos]->SetIndex(pos);  in HeapUp()
187             _list[pos/2]->SetIndex(pos/2);  in HeapUp()
212             if (_list[pos*2+1]->HeapValueCmp(_list[pos*2]) < 0)  in HeapDown()
222         if  (_list[pos]->HeapValueCmp(_list[min_son]) > 0)  in HeapDown()
224             HeapEntry* tmp = _list[min_son];  in HeapDown()
225             _list[min_son] = _list[pos];  in HeapDown()
226             _list[pos] = tmp;  in HeapDown()
228             _list[pos]->SetIndex(pos);  in HeapDown()
229             _list[min_son]->SetIndex(min_son);  in HeapDown()
252     _list[_count] = item;  in HeapPush()
267     HeapEntry* top = _list[1];    // 0 reserved.  in HeapPop()
269     _list[1] = _list[_count];  in HeapPop()
270     _list[1]->SetIndex(1);  in HeapPop()
271     _list[_count] = 0;  in HeapPop()
294     HeapEntry* del = _list[pos];  in HeapDelete()
295     _list[pos] = _list[_count];  in HeapDelete()
296     _list[pos]->SetIndex(pos);  in HeapDelete()
298     _list[_count] = 0;  in HeapDelete()
318         printf("%llu ", _list[i]->HeapValue());  in HeapForeach()
320         _list[i]->HeapIterate();  in HeapForeach()