Function test_heapPopulateRand

tests/unit/test_heap.c:209–266

}

static void test_heapPopulateRand(void) {
	// seed random
	srand(time(NULL));

	// create a new heap
	heap_t *heap = Heap_new(cmp, NULL);

	int n = 100;
	int elements[n];
	int sorted_elements[n];

	//--------------------------------------------------------------------------
	// generate n random numbers within the range 0..999
	//--------------------------------------------------------------------------

	// insert elements 0..n
	for(int i = 0; i < n; i++) {
		elements[i] = rand() % 1000;
		sorted_elements[i] = elements[i];
		TEST_ASSERT(Heap_offer(&heap, elements + i) == 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, elements + i) == 1);
	}

	//--------------------------------------------------------------------------
	// sort elements
	//--------------------------------------------------------------------------

	qsort(sorted_elements, n, sizeof(int), qsort_cmp);

	//--------------------------------------------------------------------------
	// validate heap poll ordering
	//--------------------------------------------------------------------------

	int *elem;
	for(int i = 0; i < n; i++) {
		elem = (int*)Heap_peek(heap);
		TEST_ASSERT(*elem == sorted_elements[i]);

		elem = Heap_poll(heap);
		TEST_ASSERT(*elem == sorted_elements[i]);
	}

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

	TEST_ASSERT(Heap_count(heap) == 0);

	// free heap
	Heap_free(heap);
}