CPerezz e1673c1622 trie/bintrie: wrap DeleteAccount error with address context ... DeleteStorage, UpdateStorage, and UpdateContractCode all wrap the underlying InsertValuesAtStem/Insert error with the offending address ("(%x) error: %v"). UpdateAccount is the lone outlier and DeleteAccount inherited that pattern. When InsertValuesAtStem fails deep inside the recursion (e.g. a HashedNode resolver error), "which address" is exactly the context the caller wants. Match DeleteStorage, the closest sibling.		2026-04-08 12:04:28 +02:00
..
binary_node.go	trie/bintrie: cache hashes of clean nodes so as not to rehash the whole tree (#33961)	2026-03-06 18:06:24 +01:00
binary_node_test.go	cmd/evm/internal/t8ntool, trie: support for verkle-at-genesis, use UBT, and move the transition tree to its own package (#32445)	2025-11-14 15:25:30 +01:00
empty.go	trie/bintrie: cache hashes of clean nodes so as not to rehash the whole tree (#33961)	2026-03-06 18:06:24 +01:00
empty_test.go	trie/bintrie: add eip7864 binary trees and run its tests (#32365)	2025-09-01 21:06:51 +08:00
hashed_node.go	trie/bintrie: cache hashes of clean nodes so as not to rehash the whole tree (#33961)	2026-03-06 18:06:24 +01:00
hashed_node_test.go	cmd/evm/internal/t8ntool, trie: support for verkle-at-genesis, use UBT, and move the transition tree to its own package (#32445)	2025-11-14 15:25:30 +01:00
hasher.go	trie/bintrie: use a sync.Pool when hashing binary tree nodes (#33989)	2026-03-12 10:20:12 +01:00
internal_node.go	trie/bintrie: parallelize InternalNode.Hash at shallow tree depths (#34032)	2026-03-18 13:54:23 +01:00
internal_node_test.go	trie/bintrie: cache hashes of clean nodes so as not to rehash the whole tree (#33961)	2026-03-06 18:06:24 +01:00
iterator.go	trie/bintrie: fix NodeIterator Empty node handling and expose tree accessors (#34056)	2026-03-20 13:53:14 -04:00
iterator_test.go	trie/bintrie: fix NodeIterator Empty node handling and expose tree accessors (#34056)	2026-03-20 13:53:14 -04:00
key_encoding.go	trie/bintrie: use a sync.Pool when hashing binary tree nodes (#33989)	2026-03-12 10:20:12 +01:00
stem_node.go	trie/bintrie: use a sync.Pool when hashing binary tree nodes (#33989)	2026-03-12 10:20:12 +01:00
stem_node_test.go	trie/bintrie: cache hashes of clean nodes so as not to rehash the whole tree (#33961)	2026-03-06 18:06:24 +01:00
trie.go	trie/bintrie: wrap DeleteAccount error with address context	2026-04-08 12:04:28 +02:00
trie_test.go	trie/bintrie: stop swallowing GetAccount error in delete test	2026-04-08 11:59:22 +02:00