+1 -1

internal/priorityqueue/queue.go

reviewed

··· 2 2 3 3 // Queue is one slice-backed priority queue. 4 4 // 5 5 - // Labels: MT-Unsafe 5 5 + // Labels: MT-Unsafe. 6 6 type Queue[T any] struct { 7 7 items []T 8 8 less func(left, right T) bool

+1

internal/priorityqueue/queue_test.go

reviewed

··· 19 19 } 20 20 21 21 var got []int 22 22 + 22 23 for queue.Len() > 0 { 23 24 value, ok := queue.Pop() 24 25 if !ok {

+1

internal/priorityqueue/sift_down.go

reviewed

··· 8 8 } 9 9 10 10 best := left 11 11 + 11 12 right := left + 1 12 13 if right < len(queue.items) && queue.less(queue.items[right], queue.items[left]) { 13 14 best = right