Method HeapDown

adapter/micro_thread/heap.h:197–236

inline void HeapList::HeapDown(int index)
{
    int  min_son;    
    for (int pos = index; pos <= _count;  pos = min_son)
    {
        if  (pos*2 > _count)  // pos is a leaf node.
        {
            break;
        }
        else if (pos*2 == _count)
        {
            min_son = pos*2;
        }
        else 
        {
            if (_list[pos*2+1]->HeapValueCmp(_list[pos*2]) < 0)
            {
                min_son = pos*2+1;
            }
            else
            {
                min_son = pos*2;
            }
        }

        if  (_list[pos]->HeapValueCmp(_list[min_son]) > 0)
        {
            HeapEntry* tmp = _list[min_son];
            _list[min_son] = _list[pos];
            _list[pos] = tmp;

            _list[pos]->SetIndex(pos);
            _list[min_son]->SetIndex(min_son);
        }
        else
        {
            break;
        }
    }
}


inline int HeapList::HeapPush(HeapEntry*  item)