Struct sp_trie::accessed_nodes_tracker::AccessedNodesTracker

pub struct AccessedNodesTracker<H: Hash> { /* private fields */ }

Helper struct used to ensure that a storage proof doesn’t contain duplicate or unused nodes.

The struct needs to be used as a TrieRecorder and ensure_no_unused_nodes() has to be called to actually perform the check.

Implementations

impl<H: Hash> AccessedNodesTracker<H>

pub fn new(proof_nodes_count: usize) -> Self

Create a new instance of RedundantNodesChecker, starting from a RawStorageProof.

pub fn ensure_no_unused_nodes(self) -> Result<(), Error>

Ensure that all the nodes in the proof have been accessed.

Trait Implementations

impl<H: Hash + Ord> TrieRecorder<H> for AccessedNodesTracker<H>

fn record(&mut self, access: TrieAccess<'_, H>)

Record the given TrieAccess.

fn trie_nodes_recorded_for_key(&self, _key: &[u8]) -> RecordedForKey

Check if we have recorded any trie nodes for the given key.