fuzz

fuzzheap.go

func FuzzHeap(f *testing.F) {
	var h *Heap = &Heap{}
	h.elements = []int{452, 23, 6515, 55, 313, 6}
	h.Build()

	testCases := []int{51, 634, 9, 8941, 354}
	for _, tc := range testCases {
		f.Add(tc)
	}

	f.Fuzz(func(t *testing.T, i int) {
		h.Push(i)
		// make a copy of the elements in the slice and sort it in descending order
		elements := make([]int, len(h.elements))
		copy(elements, h.elements)
		sort.Slice(elements, func(i, j int) bool {
			return elements[i] > elements[j]
		})
		// pop the heap and check if the top of heap is the largest element
		popped := h.Pop()
		if elements[0] != popped {
			t.Errorf("Top of heap %d is not the one popped %d\n heap is %v",
				elements[0], popped, elements)
		}
	})
}