-
Notifications
You must be signed in to change notification settings - Fork 664
/
tx_heap.go
110 lines (88 loc) · 1.89 KB
/
tx_heap.go
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
// Copyright (C) 2019-2021, Ava Labs, Inc. All rights reserved.
// See the file LICENSE for licensing terms.
package platformvm
import (
"container/heap"
"github.com/ava-labs/avalanchego/ids"
)
var _ TxHeap = &txHeap{}
type TxHeap interface {
Add(tx *Tx)
Get(txID ids.ID) *Tx
Remove(txID ids.ID) *Tx
Peek() *Tx
RemoveTop() *Tx
Len() int
}
type heapTx struct {
tx *Tx
index int
age int
}
type txHeap struct {
self heap.Interface
txIDToIndex map[ids.ID]int
txs []*heapTx
currentAge int
}
func (h *txHeap) initialize(self heap.Interface) {
h.self = self
h.txIDToIndex = make(map[ids.ID]int)
}
func (h *txHeap) Add(tx *Tx) { heap.Push(h.self, tx) }
func (h *txHeap) Get(txID ids.ID) *Tx {
index, exists := h.txIDToIndex[txID]
if !exists {
return nil
}
return h.txs[index].tx
}
func (h *txHeap) Remove(txID ids.ID) *Tx {
index, exists := h.txIDToIndex[txID]
if !exists {
return nil
}
return heap.Remove(h.self, index).(*Tx)
}
func (h *txHeap) Peek() *Tx { return h.txs[0].tx }
func (h *txHeap) RemoveTop() *Tx { return heap.Pop(h.self).(*Tx) }
func (h *txHeap) Len() int { return len(h.txs) }
func (h *txHeap) Swap(i, j int) {
// The follow "i"s and "j"s are intentionally swapped to perform the actual
// swap
iTx := h.txs[j]
jTx := h.txs[i]
iTx.index = i
jTx.index = j
h.txs[i] = iTx
h.txs[j] = jTx
iTxID := iTx.tx.ID()
jTxID := jTx.tx.ID()
h.txIDToIndex[iTxID] = i
h.txIDToIndex[jTxID] = j
}
func (h *txHeap) Push(x interface{}) {
tx := x.(*Tx)
txID := tx.ID()
_, exists := h.txIDToIndex[txID]
if exists {
return
}
htx := &heapTx{
tx: tx,
index: len(h.txs),
age: h.currentAge,
}
h.currentAge++
h.txIDToIndex[txID] = htx.index
h.txs = append(h.txs, htx)
}
func (h *txHeap) Pop() interface{} {
newLen := len(h.txs) - 1
htx := h.txs[newLen]
h.txs = h.txs[:newLen]
tx := htx.tx
txID := tx.ID()
delete(h.txIDToIndex, txID)
return tx
}