mirror of
https://github.com/ethereum/go-ethereum.git
synced 2026-07-23 05:06:43 +00:00
57 lines
1.8 KiB
Go
57 lines
1.8 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 trie
|
|
|
|
import (
|
|
"bytes"
|
|
|
|
"github.com/ethereum/go-ethereum/common"
|
|
)
|
|
|
|
// ListHasher is a wrapper of the Merkle-Patricia-Trie, which implements
|
|
// types.ListHasher. Compared to a Trie instance, the Update method of this
|
|
// type always deep-copies its input slices.
|
|
//
|
|
// This implementation is very inefficient in terms of memory allocation,
|
|
// compared with StackTrie. It exists only for correctness comparison purposes.
|
|
type ListHasher struct {
|
|
tr *Trie
|
|
}
|
|
|
|
// NewListHasher initializes the list hasher.
|
|
func NewListHasher() *ListHasher {
|
|
return &ListHasher{
|
|
tr: NewEmpty(nil),
|
|
}
|
|
}
|
|
|
|
// Reset clears the internal state prepares the ListHasher for reuse.
|
|
func (h *ListHasher) Reset() {
|
|
h.tr.reset()
|
|
}
|
|
|
|
// Update inserts a key-value pair into the trie.
|
|
func (h *ListHasher) Update(key []byte, value []byte) error {
|
|
key, value = bytes.Clone(key), bytes.Clone(value)
|
|
_, err := h.tr.Update(key, value)
|
|
return err
|
|
}
|
|
|
|
// Hash computes the root hash of all inserted key-value pairs.
|
|
func (h *ListHasher) Hash() common.Hash {
|
|
return h.tr.Hash()
|
|
}
|