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.
105 lines
1.9 KiB
Go
105 lines
1.9 KiB
Go
// Copyright (C) 2019-2025, Lux Industries Inc. All rights reserved.
|
|
// See the file LICENSE for licensing terms.
|
|
|
|
package math
|
|
|
|
import (
|
|
"testing"
|
|
"time"
|
|
|
|
"github.com/stretchr/testify/require"
|
|
|
|
"github.com/luxfi/ids"
|
|
)
|
|
|
|
func TestAveragerHeap(t *testing.T) {
|
|
n0 := ids.GenerateTestNodeID()
|
|
n1 := ids.GenerateTestNodeID()
|
|
n2 := ids.GenerateTestNodeID()
|
|
|
|
tests := []struct {
|
|
name string
|
|
h AveragerHeap
|
|
a []Averager
|
|
}{
|
|
{
|
|
name: "max heap",
|
|
h: NewMaxAveragerHeap(),
|
|
a: []Averager{
|
|
NewAverager(0, time.Second, time.Now()),
|
|
NewAverager(-1, time.Second, time.Now()),
|
|
NewAverager(-2, time.Second, time.Now()),
|
|
},
|
|
},
|
|
}
|
|
|
|
for _, test := range tests {
|
|
t.Run(test.name, func(t *testing.T) {
|
|
require := require.New(t)
|
|
|
|
_, _, ok := test.h.Pop()
|
|
require.False(ok)
|
|
|
|
_, _, ok = test.h.Peek()
|
|
require.False(ok)
|
|
|
|
l := test.h.Len()
|
|
require.Zero(l)
|
|
|
|
_, ok = test.h.Add(n1, test.a[1])
|
|
require.False(ok)
|
|
|
|
n, a, ok := test.h.Peek()
|
|
require.True(ok)
|
|
require.Equal(n1, n)
|
|
require.Equal(test.a[1], a)
|
|
|
|
l = test.h.Len()
|
|
require.Equal(1, l)
|
|
|
|
a, ok = test.h.Add(n1, test.a[1])
|
|
require.True(ok)
|
|
require.Equal(test.a[1], a)
|
|
|
|
l = test.h.Len()
|
|
require.Equal(1, l)
|
|
|
|
_, ok = test.h.Add(n0, test.a[0])
|
|
require.False(ok)
|
|
|
|
_, ok = test.h.Add(n2, test.a[2])
|
|
require.False(ok)
|
|
|
|
n, a, ok = test.h.Pop()
|
|
require.True(ok)
|
|
require.Equal(n0, n)
|
|
require.Equal(test.a[0], a)
|
|
|
|
l = test.h.Len()
|
|
require.Equal(2, l)
|
|
|
|
a, ok = test.h.Remove(n1)
|
|
require.True(ok)
|
|
require.Equal(test.a[1], a)
|
|
|
|
l = test.h.Len()
|
|
require.Equal(1, l)
|
|
|
|
_, ok = test.h.Remove(n1)
|
|
require.False(ok)
|
|
|
|
l = test.h.Len()
|
|
require.Equal(1, l)
|
|
|
|
a, ok = test.h.Add(n2, test.a[0])
|
|
require.True(ok)
|
|
require.Equal(test.a[2], a)
|
|
|
|
n, a, ok = test.h.Pop()
|
|
require.True(ok)
|
|
require.Equal(n2, n)
|
|
require.Equal(test.a[0], a)
|
|
})
|
|
}
|
|
}
|