Method HeapPush

adapter/micro_thread/heap.h:239–258

inline int HeapList::HeapPush(HeapEntry*  item)
{
    if (HeapFull()) {
        heap_assert(0); // it's possible in theory but not in fact.
        return -1;
    }
    
    if (item->GetIndex() != 0) {
        heap_assert(0); // duplicated insertion.
        return -2;
    }     
    
    _count++;
    _list[_count] = item;
    item->SetIndex(_count);

    HeapUp();

    return 0;
}


inline HeapEntry* HeapList::HeapPop()