internal/priorityqueue/sift_up.go


1
2
3
4
5
6
7
8
9
10
11
12
13

package priorityqueue

func (queue *Queue[T]) siftUp(idx int) {
	for idx > 0 {
		parent := (idx - 1) / 2
		if !queue.less(queue.items[idx], queue.items[parent]) {
			return
		}

		queue.items[idx], queue.items[parent] = queue.items[parent], queue.items[idx]
		idx = parent
	}
}