Function test_heapFuzz

tests/unit/test_heap.c:339–409

}

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

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

	int n                = 500;
	int *elements        = array_new(int, n);  // all elements ever introduced
	int *synced_elements = array_new(int, n);  // elements synced with heap

	// perform random operations:
	// 1. introduce a new random element
	// 2. remove a random element
	// 3. remove head
	// 
	// after each operation perform validation against head of heap
	for(int i = 0; i < 500; i++) {
		int idx;              // index of element to remove
		int *top;             // head of heap
		int elem;             // element to add
		int op = rand() % 3;  // operation to perform

		switch(op) {
			case 0:
				// introduce a new random element
				elem = rand() % 100;
				array_append(elements, elem);
				array_append(synced_elements, elem);
				Heap_offer(&heap, elements + (array_len(elements)-1));
				break;
			case 1:
				// remove random element
				if(Heap_count(heap) > 0) {
					// remove a random element
					idx = rand() % array_len(elements);

					if(Heap_remove_item(heap, elements + idx) != NULL) {
						remove_value(synced_elements, elements[idx]);
					}
				}
				break;
			case 2:
				// pop heap head
				top = (int*)Heap_poll(heap);
				if(top != NULL) {
					remove_value(synced_elements, *top);
				}
				break;
			default:
				break;
		}

		//----------------------------------------------------------------------
		// validate head of heap contains the lowest value in elements array
		//----------------------------------------------------------------------
		int heap_count = Heap_count(heap);
		int arr_count  = array_len(synced_elements);