Struct InMemoryTrieDB 

pub struct InMemoryTrieDB { /* private fields */ }

InMemory implementation for the TrieDB trait, with get and put operations.

Implementations

impl InMemoryTrieDB

pub const fn new(map: NodeMap) -> Self

pub const fn new_with_prefix(map: NodeMap, prefix: Nibbles) -> Self

pub fn new_empty() -> Self

pub fn inner(&self) -> NodeMap

impl InMemoryTrieDB

pub fn from_nodes( root_hash: H256, state_nodes: &BTreeMap<H256, Node>, ) -> Result<Self, TrieError>

Trait Implementations

impl Default for InMemoryTrieDB

fn default() -> Self

Returns the “default value” for a type.

impl TrieDB for InMemoryTrieDB

fn get(&self, key: Nibbles) -> Result<Option<Vec<u8>>, TrieError>

fn put_batch( &self, key_values: Vec<(Nibbles, Vec<u8>)>, ) -> Result<(), TrieError>

fn multi_get(&self, keys: &[Nibbles]) -> Vec<Result<Option<Vec<u8>>, TrieError>>

Retrieves multiple values by key. Returns results in the same order as the input keys. Backends that support batched reads should override this for better throughput. Default impl is equivalent to N independent get calls.

fn put_batch_no_alloc( &self, key_values: &[(Nibbles, Node)], ) -> Result<(), TrieError>

fn put(&self, key: Nibbles, value: Vec<u8>) -> Result<(), TrieError>

fn commit(&self) -> Result<(), TrieError>

Commits any pending changes to the underlying storage For read-only or in-memory implementations, this is a no-op

fn flatkeyvalue_computed(&self, _key: Nibbles) -> bool