/
node_selector_highest_head.go
41 lines (35 loc) · 1.1 KB
/
node_selector_highest_head.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
package client
import (
"math"
"github.com/smartcontractkit/chainlink/v2/common/types"
)
type highestHeadNodeSelector[
CHAIN_ID types.ID,
HEAD Head,
RPC NodeClient[CHAIN_ID, HEAD],
] []Node[CHAIN_ID, HEAD, RPC]
func NewHighestHeadNodeSelector[
CHAIN_ID types.ID,
HEAD Head,
RPC NodeClient[CHAIN_ID, HEAD],
](nodes []Node[CHAIN_ID, HEAD, RPC]) NodeSelector[CHAIN_ID, HEAD, RPC] {
return highestHeadNodeSelector[CHAIN_ID, HEAD, RPC](nodes)
}
func (s highestHeadNodeSelector[CHAIN_ID, HEAD, RPC]) Select() Node[CHAIN_ID, HEAD, RPC] {
var highestHeadNumber int64 = math.MinInt64
var highestHeadNodes []Node[CHAIN_ID, HEAD, RPC]
for _, n := range s {
state, currentHeadNumber, _ := n.StateAndLatest()
if state == nodeStateAlive && currentHeadNumber >= highestHeadNumber {
if highestHeadNumber < currentHeadNumber {
highestHeadNumber = currentHeadNumber
highestHeadNodes = nil
}
highestHeadNodes = append(highestHeadNodes, n)
}
}
return firstOrHighestPriority(highestHeadNodes)
}
func (s highestHeadNodeSelector[CHAIN_ID, HEAD, RPC]) Name() string {
return NodeSelectionModeHighestHead
}