forks/go-ethereum
1
0
Fork 1
mirror of https://github.com/ethereum/go-ethereum.git synced 2026-06-13 10:21:37 +00:00
Code Issues Projects Releases Packages Wiki Activity Actions 1
go-ethereum/trie/bintrie
History
weiihann 92e9074c5b trie/bintrie: replace left/right fields with children array 
Replace InternalNode's separate left and right fields with a
children [2]BinaryNode array, where children[0] = left and
children[1] = right. The bit extracted from the key (always 0 or 1)
maps directly to the array index, eliminating duplicated if/else
blocks in GetValuesAtStem, InsertValuesAtStem, and the iterator.

Net reduction of ~100 lines across 8 files.
2026-04-09 13:25:11 +08:00
..
binary_node.go trie/bintrie: replace left/right fields with children array 2026-04-09 13:25:11 +08:00
binary_node_test.go trie/bintrie: replace left/right fields with children array 2026-04-09 13:25:11 +08: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: replace left/right fields with children array 2026-04-09 13:25:11 +08:00
internal_node_test.go trie/bintrie: replace left/right fields with children array 2026-04-09 13:25:11 +08:00
iterator.go trie/bintrie: replace left/right fields with children array 2026-04-09 13:25:11 +08:00
iterator_test.go trie/bintrie: replace left/right fields with children array 2026-04-09 13:25:11 +08: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: replace left/right fields with children array 2026-04-09 13:25:11 +08:00
stem_node_test.go trie/bintrie: replace left/right fields with children array 2026-04-09 13:25:11 +08:00
trie.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_test.go trie/bintrie: use correct key mapping in GetStorage and DeleteStorage (#33807) 2026-02-11 11:42:17 +01:00