Function test_heapRemoveElement

tests/unit/test_heap.c:268–337

}

static void test_heapRemoveElement(void) {
	// create a new heap
	heap_t *heap = Heap_new(cmp, NULL);

	//--------------------------------------------------------------------------
	// populate heap
	//--------------------------------------------------------------------------

	int n = 10;
	int elements[n];

	// insert elements 0..9
	for(int i = 0; i < n; i++) {
		elements[i] = i;
		TEST_ASSERT(Heap_offer(&heap, elements + i) == 0);
	}

	// validate number of elements in heap
	TEST_ASSERT(Heap_count(heap) == n);

	//--------------------------------------------------------------------------
	// remove heap head
	//--------------------------------------------------------------------------

	int elem;
	elem = *(int*)Heap_remove_item(heap, elements + 0);

	TEST_ASSERT(elem == elements[0]);

	// validate new head
	elem = *(int*)Heap_peek(heap);
	TEST_ASSERT(elem == 1);

	//--------------------------------------------------------------------------
	// remove 2 from heap
	//--------------------------------------------------------------------------

	elem = *(int*)Heap_remove_item(heap, elements + 2);
	TEST_ASSERT(elem == elements[2]);

	// remove heap head
	elem = *(int*)Heap_poll(heap);
	TEST_ASSERT(elem == 1);

	// validate new head
	elem = *(int*)Heap_peek(heap);
	TEST_ASSERT(elem == 3);

	//--------------------------------------------------------------------------
	// remove last element
	//--------------------------------------------------------------------------

	elem = *(int*)Heap_remove_item(heap, elements + 9);
	TEST_ASSERT(elem == elements[9]);

	// validate new head
	elem = *(int*)Heap_peek(heap);
	TEST_ASSERT(elem == 3);