forks/go-ethereum
1
0
Fork 1
mirror of https://github.com/ethereum/go-ethereum.git synced 2026-07-17 18:30:45 +00:00
Code Issues Projects Releases Packages Wiki Activity Actions 1

trie: fix spelling mistakes (#1122)

Browse source
This commit is contained in:
Daniel Liu 2025-06-20 16:29:57 +08:00 committed by GitHub
parent 67754ff3d4
commit ea459d68a3
No known key found for this signature in database
GPG key ID: B5690EEEBB952194
3 changed files with 5 additions and 5 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

4
trie/proof.go
View file

@ -355,7 +355,7 @@ func unset(parent node, child node, key []byte, pos int, removeLeft bool) error
if removeLeft { if removeLeft {
if bytes.Compare(cld.Key, key[pos:]) < 0 { if bytes.Compare(cld.Key, key[pos:]) < 0 {
// The key of fork shortnode is less than the path // The key of fork shortnode is less than the path
// (it belongs to the range), unset the entrie // (it belongs to the range), unset the entire
// branch. The parent must be a fullnode. // branch. The parent must be a fullnode.
fn := parent.(*fullNode) fn := parent.(*fullNode)
fn.Children[key[pos-1]] = nil fn.Children[key[pos-1]] = nil
@ -367,7 +367,7 @@ func unset(parent node, child node, key []byte, pos int, removeLeft bool) error
} else { } else {
if bytes.Compare(cld.Key, key[pos:]) > 0 { if bytes.Compare(cld.Key, key[pos:]) > 0 {
// The key of fork shortnode is greater than the // The key of fork shortnode is greater than the
// path(it belongs to the range), unset the entrie // path(it belongs to the range), unset the entire
// branch. The parent must be a fullnode. // branch. The parent must be a fullnode.
fn := parent.(*fullNode) fn := parent.(*fullNode)
fn.Children[key[pos-1]] = nil fn.Children[key[pos-1]] = nil

2
trie/stacktrie.go
View file

@ -479,7 +479,7 @@ func (st *StackTrie) Hash() (h common.Hash) {
return h return h
} }
// Commit will firstly hash the entrie trie if it's still not hashed // Commit will firstly hash the entire trie if it's still not hashed
// and then commit all nodes to the associated database. Actually most // and then commit all nodes to the associated database. Actually most
// of the trie nodes MAY have been committed already. The main purpose // of the trie nodes MAY have been committed already. The main purpose
// here is to commit the root node. // here is to commit the root node.

4
trie/trie_test.go
View file

@ -427,7 +427,7 @@ func benchUpdate(b *testing.B, e binary.ByteOrder) *Trie {
} }
// Benchmarks the trie hashing. Since the trie caches the result of any operation, // Benchmarks the trie hashing. Since the trie caches the result of any operation,
// we cannot use b.N as the number of hashing rouns, since all rounds apart from // we cannot use b.N as the number of hashing rounds, since all rounds apart from
// the first one will be NOOP. As such, we'll use b.N as the number of account to // the first one will be NOOP. As such, we'll use b.N as the number of account to
// insert into the trie before measuring the hashing. // insert into the trie before measuring the hashing.
// BenchmarkHash-6 288680 4561 ns/op 682 B/op 9 allocs/op // BenchmarkHash-6 288680 4561 ns/op 682 B/op 9 allocs/op
@ -469,7 +469,7 @@ type account struct {
} }
// Benchmarks the trie Commit following a Hash. Since the trie caches the result of any operation, // Benchmarks the trie Commit following a Hash. Since the trie caches the result of any operation,
// we cannot use b.N as the number of hashing rouns, since all rounds apart from // we cannot use b.N as the number of hashing rounds, since all rounds apart from
// the first one will be NOOP. As such, we'll use b.N as the number of account to // the first one will be NOOP. As such, we'll use b.N as the number of account to
// insert into the trie before measuring the hashing. // insert into the trie before measuring the hashing.
func BenchmarkCommitAfterHash(b *testing.B) { func BenchmarkCommitAfterHash(b *testing.B) {