interna/priorityqueue: Fix lints

3 files changed, 3 insertions, 1 deletions

diff --git a/internal/priorityqueue/queue.go b/internal/priorityqueue/queue.go
index 57c895b8..d57e4791 100644
--- a/internal/priorityqueue/queue.go
+++ b/internal/priorityqueue/queue.go
@@ -2,7 +2,7 @@ package priorityqueue
 
 // Queue is one slice-backed priority queue.
 //
-// Labels: MT-Unsafe
+// Labels: MT-Unsafe.
 type Queue[T any] struct {
 	items []T
 	less  func(left, right T) bool
diff --git a/internal/priorityqueue/queue_test.go b/internal/priorityqueue/queue_test.go
index acb4f3e8..f6ab7833 100644
--- a/internal/priorityqueue/queue_test.go
+++ b/internal/priorityqueue/queue_test.go
@@ -19,6 +19,7 @@ func TestQueueAscending(t *testing.T) {
 	}
 
 	var got []int
+
 	for queue.Len() > 0 {
 		value, ok := queue.Pop()
 		if !ok {
diff --git a/internal/priorityqueue/sift_down.go b/internal/priorityqueue/sift_down.go
index 83e3fd40..f14fe93b 100644
--- a/internal/priorityqueue/sift_down.go
+++ b/internal/priorityqueue/sift_down.go
@@ -8,6 +8,7 @@ func (queue *Queue[T]) siftDown(idx int) {
 		}
 
 		best := left
+
 		right := left + 1
 		if right < len(queue.items) && queue.less(queue.items[right], queue.items[left]) {
 			best = right