Function Heap_poll

src/util/heap.c:228–246

remove the item with the top priority return top item

// remove the item with the top priority
// return top item
void *Heap_poll
(
	heap_t *hp
) {
	if(0 == Heap_count(hp)) {
		return NULL;
	}

	void *item = hp->array[0];

	hp->array[0] = hp->array[hp->count - 1];
	hp->count--;

	if(hp->count > 1) {
		__pushdown(hp, 0);
	}

	return item;
}

// return top item of the heap
void *Heap_peek