98     int          _count;     variable
107         _count = 0;
115         _count = 0;  in ~HeapList()
146         return _count;  in HeapSize()
150         return (_count > 0) ? _list[1] : NULL;  in HeapTop()
156         return (_count >= _max);  in HeapFull()
161         return (_count == 0);  in HeapEmpty()
173     for (int pos = _count; pos > 0; pos = pos/2)    in HeapUp()
200     for (int pos = index; pos <= _count;  pos = min_son)  in HeapDown()
202         if  (pos*2 > _count)  // pos is a leaf node.  in HeapDown()
206         else if (pos*2 == _count)  in HeapDown()
251     _count++;  in HeapPush()
252     _list[_count] = item;  in HeapPush()
253     item->SetIndex(_count);  in HeapPush()
269     _list[1] = _list[_count];  in HeapPop()
271     _list[_count] = 0;  in HeapPop()
273     _count--;  in HeapPop()
288     if  ((pos > _count)  ||(pos <= 0))  in HeapDelete()
295     _list[pos] = _list[_count];  in HeapDelete()
298     _list[_count] = 0;  in HeapDelete()
299     _count--;  in HeapDelete()
311     for (int i = 1; i <= _count; i++)  in HeapForeach()