Struct cfx_storage::cow_node_ref::MaybeOwnedTrieNode

pub struct MaybeOwnedTrieNode<'a> { /* private fields */ }

Implementations

impl<'a> MaybeOwnedTrieNode<'a>

pub fn take(x: Self) -> MaybeOwnedTrieNodeAsCowCallParam

impl<'a> MaybeOwnedTrieNode<'a>

pub unsafe fn owned_as_mut_unchecked(&mut self) -> &'a mut TrieNodeDeltaMpt

Methods from Deref<Target = TrieNodeDeltaMpt>

pub fn get_compressed_path_size(&self) -> u16

pub fn value_clone(&self) -> MptValue<Box<[u8]>>

pub unsafe fn copy_and_replace_fields( &self, new_value: Option<Option<Box<[u8]>>>, new_path: Option<CompressedPathRaw>, children_table: Option<ChildrenTableDeltaMpt> ) -> MemOptimizedTrieNode<CacheAlgoDataT>

new_value can only be set according to the situation. children_table can only be replaced when there is no children in both old and new table.

unsafe because:

1. precondition on children_table;
2. delete value assumes that self contains some value.

pub fn check_delete_value(&self) -> Result<TrieNodeAction>

Returns: old_value, is_self_about_to_delete, replacement_node_for_self

pub fn check_replace_or_delete_child_action( &self, child_index: u8, new_child_node: Option<NodeRefDeltaMptCompact> ) -> TrieNodeAction

Returns old_child, is_self_about_to_delete, replacement_node_for_self

pub fn get_merkle(&self) -> &MerkleHash

Trait Implementations

impl<'a> Deref for MaybeOwnedTrieNode<'a>

type Target = MemOptimizedTrieNode<<LRU<u32, (u16, u32)> as CacheAlgorithm>::CacheAlgoData>

The resulting type after dereferencing.

fn deref(&self) -> &Self::Target

Dereferences the value.