Function test_heapPopulateDup

tests/unit/test_heap.c:161–207

}

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

	int e = 7;     // duplicated value
	int n = 1000;  // number of duplicates

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

	// insert duplicated elements
	for(int i = 0; i < n; i++) {
		TEST_ASSERT(Heap_offer(&heap, &e) == 0);
	}

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

	// validate expected elements are indeed in heap
	for(int i = 0; i < n; i++) {
		TEST_ASSERT(Heap_contains_item(heap, &e) == 1);
	}

	//--------------------------------------------------------------------------
	// empty heap
	//--------------------------------------------------------------------------

	// empty heap by polling until empty
	int *elem;
	for(int i = 0; i < n; i++) {
		elem = (int*)Heap_peek(heap);
		TEST_ASSERT(*elem == e);

		elem = Heap_poll(heap);
		TEST_ASSERT(*elem == e);
	}

	//--------------------------------------------------------------------------
	// validate heap is empty
	//--------------------------------------------------------------------------

	TEST_ASSERT(Heap_count(heap) == 0);

	// free heap
	Heap_free(heap);
}

static void test_heapPopulateRand(void) {
	// seed random