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.
64 lines
1.7 KiB
Go
64 lines
1.7 KiB
Go
// Copyright (C) 2019-2025, Lux Industries Inc. All rights reserved.
|
|
// See the file LICENSE for licensing terms.
|
|
|
|
package archivedb
|
|
|
|
import (
|
|
"bytes"
|
|
"slices"
|
|
"testing"
|
|
|
|
"github.com/stretchr/testify/require"
|
|
)
|
|
|
|
func TestNaturalDescSortingForSameKey(t *testing.T) {
|
|
key0, _ := newDBKeyFromUser(make([]byte, 0), 0)
|
|
key1, _ := newDBKeyFromUser(make([]byte, 0), 1)
|
|
key2, _ := newDBKeyFromUser(make([]byte, 0), 2)
|
|
key3, _ := newDBKeyFromUser(make([]byte, 0), 3)
|
|
|
|
entry := [][]byte{key0, key1, key2, key3}
|
|
expected := [][]byte{key3, key2, key1, key0}
|
|
|
|
slices.SortFunc(entry, bytes.Compare)
|
|
|
|
require.Equal(t, expected, entry)
|
|
}
|
|
|
|
func TestSortingDifferentPrefix(t *testing.T) {
|
|
key0, _ := newDBKeyFromUser([]byte{0}, 0)
|
|
key1, _ := newDBKeyFromUser([]byte{0}, 1)
|
|
key2, _ := newDBKeyFromUser([]byte{1}, 0)
|
|
key3, _ := newDBKeyFromUser([]byte{1}, 1)
|
|
|
|
entry := [][]byte{key0, key1, key2, key3}
|
|
expected := [][]byte{key1, key0, key3, key2}
|
|
|
|
slices.SortFunc(entry, bytes.Compare)
|
|
|
|
require.Equal(t, expected, entry)
|
|
}
|
|
|
|
func TestParseDBKey(t *testing.T) {
|
|
require := require.New(t)
|
|
|
|
key := []byte{0, 1, 2, 3, 4, 5}
|
|
height := uint64(102310)
|
|
dbKey, _ := newDBKeyFromUser(key, height)
|
|
|
|
parsedKey, parsedHeight, err := parseDBKeyFromUser(dbKey)
|
|
require.NoError(err)
|
|
require.Equal(key, parsedKey)
|
|
require.Equal(height, parsedHeight)
|
|
}
|
|
|
|
func FuzzMetadataKeyInvariant(f *testing.F) {
|
|
f.Fuzz(func(t *testing.T, userKey []byte, metadataKey []byte) {
|
|
// The prefix is independent of the height, so its value doesn't matter
|
|
// for this test.
|
|
_, dbKeyPrefix := newDBKeyFromUser(userKey, 0)
|
|
dbKey := newDBKeyFromMetadata(metadataKey)
|
|
require.False(t, bytes.HasPrefix(dbKey, dbKeyPrefix))
|
|
})
|
|
}
|