13481548301

Committed 23 Feb 2025 09:06AM UTC coverage: 4.031% (-54.8%) from 58.825%

Build # 13481548301

Build Type

Pull #9521

github

Committed by

web-flow

Commit Message

Merge 1ffbe99fe into 5fe900d18

Pull Request Pull Request #9521: unit: remove GOACC, use Go 1.20 native coverage functionality

Run Details

2852 of 70750 relevant lines covered (4.03%)

0.92 hits per line

Source File
Press 'n' to go to next uncovered line, 'b' for previous

0.0

/queue/priority_queue.go

package queue

import (
        "container/heap"
)

// PriorityQueueItem is an interface that represents items in a PriorityQueue.
// Users of PriorityQueue will need to define a Less function such that
// PriorityQueue will be able to use that to build and restore an underlying
// heap.
type PriorityQueueItem interface {
        // Less must return true if this item is ordered before other and false
        // otherwise.
        Less(other PriorityQueueItem) bool
}

type priorityQueue []PriorityQueueItem

// Len returns the length of the priorityQueue.
func (pq priorityQueue) Len() int { return len(pq) }

// Less is used to order PriorityQueueItem items in the queue.
func (pq priorityQueue) Less(i, j int) bool {
        return pq[i].Less(pq[j])
}

// Swap swaps two items in the priorityQueue. Swap is used by heap.Interface.
func (pq priorityQueue) Swap(i, j int) {
        pq[i], pq[j] = pq[j], pq[i]
}

// Push adds a new item the priorityQueue.
func (pq *priorityQueue) Push(x interface{}) {
        item := x.(PriorityQueueItem)
        *pq = append(*pq, item)
}

// Pop removes the top item from the priorityQueue.
func (pq *priorityQueue) Pop() interface{} {
        old := *pq
        n := len(old)
        item := old[n-1]
        old[n-1] = nil
        *pq = old[0 : n-1]
        return item
}

// PriorityQueue wraps a standard heap into a self contained class.
type PriorityQueue struct {
        queue priorityQueue
}

// Len returns the length of the queue.
func (pq *PriorityQueue) Len() int {
        return len(pq.queue)
}

// Empty returns true if the queue is empty.
func (pq *PriorityQueue) Empty() bool {
        return len(pq.queue) == 0
}

// Push adds an item to the priority queue.
func (pq *PriorityQueue) Push(item PriorityQueueItem) {
        heap.Push(&pq.queue, item)
}

// Pop removes the top most item from the queue.
func (pq *PriorityQueue) Pop() PriorityQueueItem {
        return heap.Pop(&pq.queue).(PriorityQueueItem)
}

// Top returns the top most item from the queue without removing it.
func (pq *PriorityQueue) Top() PriorityQueueItem {
        return pq.queue[0]
}

1	package queue
2
3	import (
4	"container/heap"
5	)
6
7	// PriorityQueueItem is an interface that represents items in a PriorityQueue.
8	// Users of PriorityQueue will need to define a Less function such that
9	// PriorityQueue will be able to use that to build and restore an underlying
10	// heap.
11	type PriorityQueueItem interface {
12	// Less must return true if this item is ordered before other and false
13	// otherwise.
14	Less(other PriorityQueueItem) bool
15	}
16
17	type priorityQueue []PriorityQueueItem
18
19	// Len returns the length of the priorityQueue.
20	func (pq priorityQueue) Len() int { return len(pq) }	×
21
22	// Less is used to order PriorityQueueItem items in the queue.
23	func (pq priorityQueue) Less(i, j int) bool {	×
24	return pq[i].Less(pq[j])	×
25	}	×
26
27	// Swap swaps two items in the priorityQueue. Swap is used by heap.Interface.
28	func (pq priorityQueue) Swap(i, j int) {	×
29	pq[i], pq[j] = pq[j], pq[i]	×
30	}	×
31
32	// Push adds a new item the priorityQueue.
33	func (pq *priorityQueue) Push(x interface{}) {	×
34	item := x.(PriorityQueueItem)	×
35	pq = append(pq, item)	×
36	}	×
37
38	// Pop removes the top item from the priorityQueue.
39	func (pq *priorityQueue) Pop() interface{} {	×
40	old := *pq	×
41	n := len(old)	×
42	item := old[n-1]	×
43	old[n-1] = nil	×
44	*pq = old[0 : n-1]	×
45	return item	×
46	}	×
47
48	// PriorityQueue wraps a standard heap into a self contained class.
49	type PriorityQueue struct {
50	queue priorityQueue
51	}
52
53	// Len returns the length of the queue.
54	func (pq *PriorityQueue) Len() int {	×
55	return len(pq.queue)	×
56	}	×
57
58	// Empty returns true if the queue is empty.
59	func (pq *PriorityQueue) Empty() bool {	×
60	return len(pq.queue) == 0	×
61	}	×
62
63	// Push adds an item to the priority queue.
64	func (pq *PriorityQueue) Push(item PriorityQueueItem) {	×
65	heap.Push(&pq.queue, item)	×
66	}	×
67
68	// Pop removes the top most item from the queue.
69	func (pq *PriorityQueue) Pop() PriorityQueueItem {	×
70	return heap.Pop(&pq.queue).(PriorityQueueItem)	×
71	}	×
72
73	// Top returns the top most item from the queue without removing it.
74	func (pq *PriorityQueue) Top() PriorityQueueItem {	×
75	return pq.queue[0]	×
76	}	×

lightningnetwork / lnd / 13481548301

Source File Press 'n' to go to next uncovered line, 'b' for previous

Source File
Press 'n' to go to next uncovered line, 'b' for previous