jleony/nanoreth
1
0
Fork 0
mirror of https://github.com/hl-archive-node/nanoreth.git synced 2025-12-06 10:59:55 +00:00
Code Issues Packages Projects Releases Wiki Activity

feat(trie): update sparse trie hashes below level (#11969)

Browse Source
This commit is contained in:
Alexey Shekhirin
2024-10-22 19:04:58 +01:00
committed by GitHub
parent 468ac0d43b
commit e70b112420
1 changed files with 9 additions and 8 deletions
Download Patch File Download Diff File Expand all files Collapse all files

17
crates/trie/sparse/src/trie.rs
View File

@ -518,34 +518,35 @@ impl RevealedSparseTrie {
}
}
/// Update node hashes only if their path exceeds the provided level.
pub fn update_rlp_node_level(&mut self, min_len: usize) {
let mut paths = Vec::from([Nibbles::default()]);
/// Update hashes of the nodes that are located at a level deeper than or equal to the provided
/// depth. Root node has a level of 0.
pub fn update_rlp_node_level(&mut self, depth: usize) {
let mut paths = Vec::from([(Nibbles::default(), 0)]);
let mut targets = HashSet::<Nibbles>::default();
while let Some(mut path) = paths.pop() {
while let Some((mut path, level)) = paths.pop() {
match self.nodes.get(&path).unwrap() {
SparseNode::Empty | SparseNode::Hash(_) => {}
SparseNode::Leaf { .. } => {
targets.insert(path);
}
SparseNode::Extension { key, .. } => {
if path.len() >= min_len {
if level >= depth {
targets.insert(path);
} else {
path.extend_from_slice_unchecked(key);
paths.push(path);
paths.push((path, level + 1));
}
}
SparseNode::Branch { state_mask, .. } => {
if path.len() >= min_len {
if level >= depth {
targets.insert(path);
} else {
for bit in CHILD_INDEX_RANGE {
if state_mask.is_bit_set(bit) {
let mut child_path = path.clone();
child_path.push_unchecked(bit);
paths.push(child_path);
paths.push((child_path, level + 1));
}
}
}