minheap_test.go

package astar

import (
	"slices"
	"testing"
)

func TestMinHeap_Peek(t *testing.T) {
	t.Parallel()
	cases := []struct {
		name string
		data []int
	}{
		{
			name: "case 1",
			data: []int{5, 7, 3, 9, 1, 6},
		},
		{
			name: "case 2",
			data: []int{4, 3, 2, 1},
		},
	}
	for _, c := range cases {
		t.Run(c.name, func(t *testing.T) {
			t.Parallel()
			heap := &minHeap{}
			for _, n := range c.data {
				heap.push(heapNode{f: n})
			}

			want := make([]int, len(c.data))
			copy(want, c.data)
			slices.Sort(want)

			got := heap.peek()

			if got.f != want[0] {
				t.Errorf("want %v got %v", want[0], got.f)
			}
		})
	}
}

func TestMinHeap_Pop(t *testing.T) {
	t.Parallel()
	cases := []struct {
		name string
		data []int
	}{
		{
			name: "case 1",
			data: []int{5, 7, 3, 9, 1, 6},
		},
		{
			name: "case 2",
			data: []int{4, 3, 2, 1},
		},
	}
	for _, c := range cases {
		t.Run(c.name, func(t *testing.T) {
			t.Parallel()
			heap := &minHeap{}
			for _, n := range c.data {
				heap.push(heapNode{f: n})
			}

			want := make([]int, len(c.data))
			copy(want, c.data)
			slices.Sort(want)

			for _, n := range want {
				got := heap.pop()
				if got.f != n {
					t.Errorf("want %v got %v", n, got.f)
				}
			}
		})
	}
}