Struct cfx_storage::MemOptimizedTrieNode

pub struct MemOptimizedTrieNode<CacheAlgoDataT: CacheAlgoDataTrait> { /* private fields */ }

A node consists of an optional compressed path (concept of Patricia Trie), an optional ChildrenTable (if the node is intermediate), an optional value attached, and the Merkle hash for subtree.

Implementations

impl<CacheAlgoDataT: CacheAlgoDataTrait> MemOptimizedTrieNode<CacheAlgoDataT>

pub fn get_compressed_path_size(&self) -> u16

pub fn copy_compressed_path<CompressedPath: CompressedPathTrait>( &mut self, new_path: CompressedPath )

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

pub fn check_value_size(value: &[u8]) -> Result<()>

pub fn check_key_size(access_key: &[u8]) -> Result<()>

impl<CacheAlgoDataT: CacheAlgoDataTrait> MemOptimizedTrieNode<CacheAlgoDataT>

The actual TrieNode type used in DeltaMpt. We’d like to keep as many of them as possible in memory.

pub fn new( merkle: MerkleHash, children_table: ChildrenTableDeltaMpt, maybe_value: Option<Box<[u8]>>, compressed_path: CompressedPathRaw ) -> MemOptimizedTrieNode<CacheAlgoDataT>

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 unsafe fn set_first_child_unchecked( &mut self, child_index: u8, child: NodeRefDeltaMptCompact )

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

pub fn set_merkle(&mut self, merkle: &MerkleHash)

Trait Implementations

impl<CacheAlgoDataT: CacheAlgoDataTrait> Clone for MemOptimizedTrieNode<CacheAlgoDataT>

fn clone(&self) -> Self

Returns a copy of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<CacheAlgoDataT: CacheAlgoDataTrait> Debug for MemOptimizedTrieNode<CacheAlgoDataT>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<CacheAlgoDataT: CacheAlgoDataTrait> Decodable for MemOptimizedTrieNode<CacheAlgoDataT>

fn decode(rlp: &Rlp<'_>) -> Result<Self, DecoderError>

Decode a value from RLP bytes

impl<CacheAlgoDataT: Default + CacheAlgoDataTrait> Default for MemOptimizedTrieNode<CacheAlgoDataT>

fn default() -> MemOptimizedTrieNode<CacheAlgoDataT>

Returns the “default value” for a type.

impl<CacheAlgoDataT: CacheAlgoDataTrait> Encodable for MemOptimizedTrieNode<CacheAlgoDataT>

fn rlp_append(&self, s: &mut RlpStream)

Append a value to the stream

fn rlp_bytes(&self) -> Vec<u8>

Get rlp-encoded bytes for this instance

impl<CacheAlgoDataT: CacheAlgoDataTrait> MallocSizeOf for MemOptimizedTrieNode<CacheAlgoDataT>

fn size_of(&self, ops: &mut MallocSizeOfOps) -> usize

Measure the heap usage of all descendant heap-allocated structures, but not the space taken up by the value itself.

impl<CacheAlgoDataT: CacheAlgoDataTrait> PartialEq for MemOptimizedTrieNode<CacheAlgoDataT>

fn eq(&self, other: &Self) -> bool

This method tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

This method tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<CacheAlgoDataT: CacheAlgoDataTrait> Send for MemOptimizedTrieNode<CacheAlgoDataT>

Compiler is not sure about the pointer in MaybeInPlaceByteArray fields. It’s Send because TrieNode is move only and it’s impossible to change any part of it without &mut.

impl<CacheAlgoDataT: CacheAlgoDataTrait> Sync for MemOptimizedTrieNode<CacheAlgoDataT>

Compiler is not sure about the pointer in MaybeInPlaceByteArray fields. We do not allow a &TrieNode to be able to change anything the pointer is pointing to, therefore TrieNode is Sync.