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.
84 lines
1.7 KiB
Go
84 lines
1.7 KiB
Go
// Copyright (C) 2019-2025, Lux Industries Inc. All rights reserved.
|
|
// See the file LICENSE for licensing terms.
|
|
|
|
package iterator_test
|
|
|
|
import (
|
|
"testing"
|
|
"time"
|
|
|
|
"github.com/google/btree"
|
|
"github.com/stretchr/testify/require"
|
|
|
|
"github.com/luxfi/ids"
|
|
"github.com/luxfi/node/utils/iterator"
|
|
"github.com/luxfi/node/vms/platformvm/state"
|
|
)
|
|
|
|
var defaultTreeDegree = 2
|
|
|
|
func TestTree(t *testing.T) {
|
|
require := require.New(t)
|
|
stakers := []*state.Staker{
|
|
{
|
|
TxID: ids.GenerateTestID(),
|
|
NextTime: time.Unix(0, 0),
|
|
},
|
|
{
|
|
TxID: ids.GenerateTestID(),
|
|
NextTime: time.Unix(1, 0),
|
|
},
|
|
{
|
|
TxID: ids.GenerateTestID(),
|
|
NextTime: time.Unix(2, 0),
|
|
},
|
|
}
|
|
|
|
tree := btree.NewG(defaultTreeDegree, (*state.Staker).Less)
|
|
for _, staker := range stakers {
|
|
require.Nil(tree.ReplaceOrInsert(staker))
|
|
}
|
|
|
|
it := iterator.FromTree(tree)
|
|
for _, staker := range stakers {
|
|
require.True(it.Next())
|
|
require.Equal(staker, it.Value())
|
|
}
|
|
require.False(it.Next())
|
|
it.Release()
|
|
}
|
|
|
|
func TestTreeNil(t *testing.T) {
|
|
it := iterator.FromTree[*state.Staker](nil)
|
|
require.False(t, it.Next())
|
|
it.Release()
|
|
}
|
|
|
|
func TestTreeEarlyRelease(t *testing.T) {
|
|
require := require.New(t)
|
|
stakers := []*state.Staker{
|
|
{
|
|
TxID: ids.GenerateTestID(),
|
|
NextTime: time.Unix(0, 0),
|
|
},
|
|
{
|
|
TxID: ids.GenerateTestID(),
|
|
NextTime: time.Unix(1, 0),
|
|
},
|
|
{
|
|
TxID: ids.GenerateTestID(),
|
|
NextTime: time.Unix(2, 0),
|
|
},
|
|
}
|
|
|
|
tree := btree.NewG(defaultTreeDegree, (*state.Staker).Less)
|
|
for _, staker := range stakers {
|
|
require.Nil(tree.ReplaceOrInsert(staker))
|
|
}
|
|
|
|
it := iterator.FromTree(tree)
|
|
require.True(it.Next())
|
|
it.Release()
|
|
require.False(it.Next())
|
|
}
|