forks/go-ethereum
1
0
Fork 1
mirror of https://github.com/ethereum/go-ethereum.git synced 2026-07-23 13:16:42 +00:00
Code Issues Projects Releases Packages Wiki Activity Actions 1

triedb: using slices.BinarySearchFunc

Browse source
This commit is contained in:
cuiweixie 2025-09-20 14:38:55 +08:00
parent 4414e2833f
commit 034981cafd
1 changed files with 5 additions and 5 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

10
triedb/pathdb/iterator.go
View file

@ -19,7 +19,7 @@ package pathdb
import ( import (
"bytes" "bytes"
"fmt" "fmt"
"sort" "slices"
"github.com/ethereum/go-ethereum/common" "github.com/ethereum/go-ethereum/common"
"github.com/ethereum/go-ethereum/core/rawdb" "github.com/ethereum/go-ethereum/core/rawdb"
@ -93,8 +93,8 @@ type diffAccountIterator struct {
// newDiffAccountIterator creates an account iterator over the given state set. // newDiffAccountIterator creates an account iterator over the given state set.
func newDiffAccountIterator(seek common.Hash, accountList []common.Hash, fn loadAccount) AccountIterator { func newDiffAccountIterator(seek common.Hash, accountList []common.Hash, fn loadAccount) AccountIterator {
// Seek out the requested starting account // Seek out the requested starting account
index := sort.Search(len(accountList), func(i int) bool { index, _ := slices.BinarySearchFunc(accountList, seek, func(a, b common.Hash) int {
return bytes.Compare(seek[:], accountList[i][:]) <= 0 return bytes.Compare(a[:], b[:])
}) })
// Assemble and returned the already seeked iterator // Assemble and returned the already seeked iterator
return &diffAccountIterator{ return &diffAccountIterator{
@ -236,8 +236,8 @@ type diffStorageIterator struct {
// newDiffStorageIterator creates a storage iterator over a single diff layer. // newDiffStorageIterator creates a storage iterator over a single diff layer.
func newDiffStorageIterator(account common.Hash, seek common.Hash, storageList []common.Hash, fn loadStorage) StorageIterator { func newDiffStorageIterator(account common.Hash, seek common.Hash, storageList []common.Hash, fn loadStorage) StorageIterator {
index := sort.Search(len(storageList), func(i int) bool { index, _ := slices.BinarySearchFunc(storageList, seek, func(a, b common.Hash) int {
return bytes.Compare(seek[:], storageList[i][:]) <= 0 return bytes.Compare(a[:], b[:])
}) })
// Assemble and returned the already seeked iterator // Assemble and returned the already seeked iterator
return &diffStorageIterator{ return &diffStorageIterator{