diff options
| author | 2026-03-28 17:40:02 +0000 | |
|---|---|---|
| committer | 2026-03-28 17:40:02 +0000 | |
| commit | 06583274fa64ad6677773bf4ca54f69226388203 (patch) | |
| tree | 66354bf972d267bf7ee5135eb7e5b90c31f9fe4d /commitquery/priority_queue.go | |
| parent | format/commitgraph/read: Lifetime (diff) | |
| signature | No signature | |
commitquery: Make a reusable engine thingy
Diffstat (limited to 'commitquery/priority_queue.go')
| -rw-r--r-- | commitquery/priority_queue.go | 6 |
1 files changed, 3 insertions, 3 deletions
diff --git a/commitquery/priority_queue.go b/commitquery/priority_queue.go index 0d948c64..8651ea0b 100644 --- a/commitquery/priority_queue.go +++ b/commitquery/priority_queue.go @@ -4,12 +4,12 @@ import "container/heap" // priorityQueue orders internal nodes using one query context's comparator. type priorityQueue struct { - query *Query + query *query items []nodeIndex } // newPriorityQueue builds one empty priority queue over one query context. -func newPriorityQueue(query *Query) *priorityQueue { +func newPriorityQueue(query *query) *priorityQueue { queue := &priorityQueue{query: query} heap.Init(queue) @@ -67,7 +67,7 @@ func (queue *priorityQueue) PopNode() nodeIndex { return idx } -func (query *Query) queueHasNonStale(queue *priorityQueue) bool { +func (query *query) queueHasNonStale(queue *priorityQueue) bool { // TODO for _, idx := range queue.items { if !query.hasAnyMarks(idx, markStale) { |
