mirror of
https://github.com/luxfi/node.git
synced 2026-10-30 15:24:05 +00:00
zeekay
7cf87b230b
The module already called itself github.com/luxfi/node while containing no node in Go: cmd/luxd was twenty-one lines that printed the size of a few types, and the Go column of the matrix measured a VM plugin. A repo that fetches the thing it claims to be has not replaced it, so the Go sources move in — 1515 files, the daemon and everything under it — and the build reaches outside this module for nothing. Rust and C++ sit beside it unchanged and are still measured against it by the differential. That is the point of one repo: the reference implementation and the two ports are the same checkout, so parity is a thing you can run rather than a thing you assert. Verified: builds, and the closure carries no lux-private — checked at build time rather than believed. The daemon starts twelve chains on a local network (P X C Q Z A B G K M F, plus D through its plugin) and reports healthy.
65 lines
2.0 KiB
Go
65 lines
2.0 KiB
Go
// Copyright (C) 2019-2025, Lux Industries Inc. All rights reserved.
|
|
// See the file LICENSE for licensing terms.
|
|
|
|
package math
|
|
|
|
import (
|
|
"github.com/luxfi/ids"
|
|
"github.com/luxfi/node/utils/heap"
|
|
)
|
|
|
|
var _ AveragerHeap = (*averagerHeap)(nil)
|
|
|
|
// AveragerHeap maintains a heap of the averagers.
|
|
type AveragerHeap interface {
|
|
// Add the average to the heap. If [nodeID] is already in the heap, the
|
|
// average will be replaced and the old average will be returned. If there
|
|
// was not an old average, false will be returned.
|
|
Add(nodeID ids.NodeID, averager Averager) (Averager, bool)
|
|
// Remove attempts to remove the average that was added with the provided
|
|
// [nodeID], if none is contained in the heap, [false] will be returned.
|
|
Remove(nodeID ids.NodeID) (Averager, bool)
|
|
// Pop attempts to remove the node with either the largest or smallest
|
|
// average, depending on if this is a max heap or a min heap, respectively.
|
|
Pop() (ids.NodeID, Averager, bool)
|
|
// Peek attempts to return the node with either the largest or smallest
|
|
// average, depending on if this is a max heap or a min heap, respectively.
|
|
Peek() (ids.NodeID, Averager, bool)
|
|
// Len returns the number of nodes that are currently in the heap.
|
|
Len() int
|
|
}
|
|
|
|
type averagerHeap struct {
|
|
heap heap.Map[ids.NodeID, Averager]
|
|
}
|
|
|
|
// NewMaxAveragerHeap returns a new empty max heap. The returned heap is not
|
|
// thread safe.
|
|
func NewMaxAveragerHeap() AveragerHeap {
|
|
return averagerHeap{
|
|
heap: heap.NewMap[ids.NodeID, Averager](func(a, b Averager) bool {
|
|
return a.Read() > b.Read()
|
|
}),
|
|
}
|
|
}
|
|
|
|
func (h averagerHeap) Add(nodeID ids.NodeID, averager Averager) (Averager, bool) {
|
|
return h.heap.Push(nodeID, averager)
|
|
}
|
|
|
|
func (h averagerHeap) Remove(nodeID ids.NodeID) (Averager, bool) {
|
|
return h.heap.Remove(nodeID)
|
|
}
|
|
|
|
func (h averagerHeap) Pop() (ids.NodeID, Averager, bool) {
|
|
return h.heap.Pop()
|
|
}
|
|
|
|
func (h averagerHeap) Peek() (ids.NodeID, Averager, bool) {
|
|
return h.heap.Peek()
|
|
}
|
|
|
|
func (h averagerHeap) Len() int {
|
|
return h.heap.Len()
|
|
}
|