forks/go-ethereum
1
0
Fork 1
mirror of https://github.com/ethereum/go-ethereum.git synced 2026-02-26 15:47:21 +00:00
Code Issues Projects Releases Packages Wiki Activity Actions 1

common, eth: remove duplicate test cases (#32624)

Browse source 
Remove redundant duplicate test vectors. The two entries were identical
and back-to-back, providing no additional coverage while adding noise.
Keeping a single instance maintains test intent and clarity without
altering behavior.
This commit is contained in:
Zach Brown 2025-09-20 07:20:44 +08:00 committed by GitHub
parent c7eb37608b
commit f770ec1ffc
No known key found for this signature in database
GPG key ID: B5690EEEBB952194
3 changed files with 0 additions and 4 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

1
common/hexutil/json_test.go
View file

@ -408,7 +408,6 @@ func TestUnmarshalFixedUnprefixedText(t *testing.T) {
{input: "0x2", wantErr: ErrOddLength}, {input: "0x2", wantErr: ErrOddLength},
{input: "2", wantErr: ErrOddLength}, {input: "2", wantErr: ErrOddLength},
{input: "4444", wantErr: errors.New("hex string has length 4, want 8 for x")}, {input: "4444", wantErr: errors.New("hex string has length 4, want 8 for x")},
{input: "4444", wantErr: errors.New("hex string has length 4, want 8 for x")},
// check that output is not modified for partially correct input // check that output is not modified for partially correct input
{input: "444444gg", wantErr: ErrSyntax, want: []byte{0, 0, 0, 0}}, {input: "444444gg", wantErr: ErrSyntax, want: []byte{0, 0, 0, 0}},
{input: "0x444444gg", wantErr: ErrSyntax, want: []byte{0, 0, 0, 0}}, {input: "0x444444gg", wantErr: ErrSyntax, want: []byte{0, 0, 0, 0}},

2
eth/protocols/snap/gentrie_test.go
View file

@ -239,7 +239,6 @@ func TestPartialGentree(t *testing.T) {
{1, len(entries) - 1}, // no left {1, len(entries) - 1}, // no left
{2, len(entries) - 1}, // no left {2, len(entries) - 1}, // no left
{2, len(entries) - 2}, // no left and right {2, len(entries) - 2}, // no left and right
{2, len(entries) - 2}, // no left and right
{len(entries) / 2, len(entries) / 2}, // single {len(entries) / 2, len(entries) / 2}, // single
{0, 0}, // single first {0, 0}, // single first
{len(entries) - 1, len(entries) - 1}, // single last {len(entries) - 1, len(entries) - 1}, // single last
@ -348,7 +347,6 @@ func TestGentreeDanglingClearing(t *testing.T) {
{1, len(entries) - 1}, // no left {1, len(entries) - 1}, // no left
{2, len(entries) - 1}, // no left {2, len(entries) - 1}, // no left
{2, len(entries) - 2}, // no left and right {2, len(entries) - 2}, // no left and right
{2, len(entries) - 2}, // no left and right
{len(entries) / 2, len(entries) / 2}, // single {len(entries) / 2, len(entries) / 2}, // single
{0, 0}, // single first {0, 0}, // single first
{len(entries) - 1, len(entries) - 1}, // single last {len(entries) - 1, len(entries) - 1}, // single last

1
eth/protocols/snap/sync_test.go
View file

@ -597,7 +597,6 @@ func testSyncBloatedProof(t *testing.T, scheme string) {
proof := trienode.NewProofSet() proof := trienode.NewProofSet()
if err := t.accountTrie.Prove(origin[:], proof); err != nil { if err := t.accountTrie.Prove(origin[:], proof); err != nil {
t.logger.Error("Could not prove origin", "origin", origin, "error", err) t.logger.Error("Could not prove origin", "origin", origin, "error", err)
t.logger.Error("Could not prove origin", "origin", origin, "error", err)
} }
// The bloat: add proof of every single element // The bloat: add proof of every single element
for _, entry := range t.accountValues { for _, entry := range t.accountValues {