Struct cfx_storage::SubTrieVisitor

pub struct SubTrieVisitor<'trie, 'db: 'trie> { /* private fields */ }

Implementations

impl<'trie> SubTrieVisitor<'trie, 'trie>

pub fn new( trie_ref: &'trie DeltaMpt, root: NodeRefDeltaMpt, owned_node_set: &'trie mut Option<OwnedNodeSet> ) -> Result<Self>

impl<'trie, 'db: 'trie> SubTrieVisitor<'trie, 'db>

pub fn get_trie_ref(&self) -> &'trie DeltaMpt

pub fn get_proof<'a>(&mut self, key: &'_ [u8]) -> Result<TrieProof>

pub fn get(&mut self, key: &'_ [u8]) -> Result<MptValue<Box<[u8]>>>

pub fn get_merkle_hash_wo_compressed_path( &mut self, key: &'_ [u8] ) -> Result<Option<MerkleHash>>

pub fn delete( self, key: &'_ [u8] ) -> Result<(Option<Box<[u8]>>, bool, Option<NodeRefDeltaMptCompact>)>

The visitor can only be used once to modify. Returns (deleted value, is root node replaced, the current root node for the subtree).

pub fn delete_all( self, key: &'_ [u8], key_remaining: &'_ [u8] ) -> Result<(Option<Vec<MptKeyValue>>, bool, Option<NodeRefDeltaMptCompact>)>

The visitor can only be used once to modify. Returns (deleted value, is root node replaced, the current root node for the subtree).

pub fn traversal( self, key: &'_ [u8], key_remaining: &'_ [u8] ) -> Result<Option<Vec<MptKeyValue>>>

return all key/value pairs given the prefix

pub fn set(self, key: &'_ [u8], value: Box<[u8]>) -> Result<NodeRefDeltaMpt>