mirror of
https://github.com/ethereum/go-ethereum.git
synced 2026-03-29 14:22:55 +00:00
494908a852
The bitmap is used in compact-encoded trie nodes to indicate which elements have been modified. The bitmap format has been updated to use big-endian encoding. Bit positions are numbered from 0 to 15, where position 0 corresponds to the most significant bit of b[0], and position 15 corresponds to the least significant bit of b[1].
126 lines
2.6 KiB
Go
126 lines
2.6 KiB
Go
// Copyright 2025 The go-ethereum Authors
|
|
// This file is part of the go-ethereum library.
|
|
//
|
|
// The go-ethereum library is free software: you can redistribute it and/or modify
|
|
// it under the terms of the GNU Lesser General Public License as published by
|
|
// the Free Software Foundation, either version 3 of the License, or
|
|
// (at your option) any later version.
|
|
//
|
|
// The go-ethereum library is distributed in the hope that it will be useful,
|
|
// but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
// GNU Lesser General Public License for more details.
|
|
//
|
|
// You should have received a copy of the GNU Lesser General Public License
|
|
// along with the go-ethereum library. If not, see <http://www.gnu.org/licenses/>.
|
|
|
|
package pathdb
|
|
|
|
import (
|
|
"bytes"
|
|
"reflect"
|
|
"testing"
|
|
)
|
|
|
|
func TestIsAncestor(t *testing.T) {
|
|
suites := []struct {
|
|
x, y uint16
|
|
want bool
|
|
}{
|
|
{0, 1, true},
|
|
{0, 16, true},
|
|
{0, 17, true},
|
|
{0, 272, true},
|
|
|
|
{1, 0, false},
|
|
{1, 2, false},
|
|
{1, 17, true},
|
|
{1, 18, true},
|
|
{17, 273, true},
|
|
{1, 1, false},
|
|
}
|
|
for _, tc := range suites {
|
|
result := isAncestor(tc.x, tc.y)
|
|
if result != tc.want {
|
|
t.Fatalf("isAncestor(%d, %d) = %v, want %v", tc.x, tc.y, result, tc.want)
|
|
}
|
|
}
|
|
}
|
|
|
|
func TestBitmapSet(t *testing.T) {
|
|
suites := []struct {
|
|
index int
|
|
expect []byte
|
|
}{
|
|
{
|
|
0, []byte{0b10000000, 0x0},
|
|
},
|
|
{
|
|
1, []byte{0b01000000, 0x0},
|
|
},
|
|
{
|
|
7, []byte{0b00000001, 0x0},
|
|
},
|
|
{
|
|
8, []byte{0b00000000, 0b10000000},
|
|
},
|
|
{
|
|
15, []byte{0b00000000, 0b00000001},
|
|
},
|
|
}
|
|
for _, tc := range suites {
|
|
var buf [2]byte
|
|
setBit(buf[:], tc.index)
|
|
|
|
if !bytes.Equal(buf[:], tc.expect) {
|
|
t.Fatalf("bitmap = %v, want %v", buf, tc.expect)
|
|
}
|
|
if !isBitSet(buf[:], tc.index) {
|
|
t.Fatal("bit is not set")
|
|
}
|
|
}
|
|
}
|
|
|
|
func TestBitPositions(t *testing.T) {
|
|
suites := []struct {
|
|
input []byte
|
|
expect []int
|
|
}{
|
|
{
|
|
[]byte{0b10000000, 0x0}, []int{0},
|
|
},
|
|
{
|
|
[]byte{0b01000000, 0x0}, []int{1},
|
|
},
|
|
{
|
|
[]byte{0b00000001, 0x0}, []int{7},
|
|
},
|
|
{
|
|
[]byte{0b00000000, 0b10000000}, []int{8},
|
|
},
|
|
{
|
|
[]byte{0b00000000, 0b00000001}, []int{15},
|
|
},
|
|
{
|
|
[]byte{0b10000000, 0b00000001}, []int{0, 15},
|
|
},
|
|
{
|
|
[]byte{0b10000001, 0b00000001}, []int{0, 7, 15},
|
|
},
|
|
{
|
|
[]byte{0b10000001, 0b10000001}, []int{0, 7, 8, 15},
|
|
},
|
|
{
|
|
[]byte{0b11111111, 0b11111111}, []int{0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15},
|
|
},
|
|
{
|
|
[]byte{0x0, 0x0}, nil,
|
|
},
|
|
}
|
|
for _, tc := range suites {
|
|
got := bitPosTwoBytes(tc.input)
|
|
if !reflect.DeepEqual(got, tc.expect) {
|
|
t.Fatalf("Unexpected position set, want: %v, got: %v", tc.expect, got)
|
|
}
|
|
}
|
|
}
|