perf(trie): refactor TrieNodeIter

7suyash7 · 7suyash7 · commit 1606a1aba1f6 · 2025-05-07T23:40:10.000+05:30
Signed-off-by: 7suyash7 &lt;suyashnyn1@gmail.com&gt;
diff --git a/crates/trie/trie/src/node_iter.rs b/crates/trie/trie/src/node_iter.rs
@@ -69,7 +69,7 @@ pub struct TrieNodeIter<C, H: HashedCursor> {
     previously_advanced_to_key: Option<B256>,
     /// Stores the result of the last successful [`Self::next_hashed_entry`], used to avoid a
     /// redundant [`Self::seek_hashed_entry`] call if the walker points to the same key that
-    /// was just return by `next()`.
+    /// was just returned by `next()`.
     last_next_result: Option<(B256, H::Value)>,
 }
 

Original file line number	Diff line number	Diff line change
`@@ -69,7 +69,7 @@ pub struct TrieNodeIter<C, H: HashedCursor> {`
`69`	`69`	`previously_advanced_to_key: Option<B256>,`
`70`	`70`	/// Stores the result of the last successful [`Self::next_hashed_entry`], used to avoid a
`71`	`71`	/// redundant [`Self::seek_hashed_entry`] call if the walker points to the same key that
`72`		- /// was just return by `next()`.
	`72`	+ /// was just returned by `next()`.
`73`	`73`	`last_next_result: Option<(B256, H::Value)>,`
`74`	`74`	`}`
`75`	`75`