Struct BackendTrieDB 

pub struct BackendTrieDB { /* private fields */ }

TrieDB implementation that holds a pre-acquired read view for the entire trie traversal, avoiding per-node-lookup allocation and lock acquisition.

Implementations

impl BackendTrieDB

pub fn new_for_accounts( db: Arc<dyn StorageBackend>, last_written: Vec<u8>, ) -> Result<Self, StoreError>

Create a new BackendTrieDB for the account trie

pub fn new_for_accounts_with_view( db: Arc<dyn StorageBackend>, read_view: Arc<dyn StorageReadView>, last_written: Vec<u8>, ) -> Result<Self, StoreError>

Create a new BackendTrieDB for the account trie with a shared read view

pub fn new_for_storages( db: Arc<dyn StorageBackend>, last_written: Vec<u8>, ) -> Result<Self, StoreError>

Create a new BackendTrieDB for the storage tries

pub fn new_for_storages_with_view( db: Arc<dyn StorageBackend>, read_view: Arc<dyn StorageReadView>, last_written: Vec<u8>, ) -> Result<Self, StoreError>

Create a new BackendTrieDB for the storage tries with a shared read view

pub fn new_for_account_storage( db: Arc<dyn StorageBackend>, address_prefix: H256, last_written: Vec<u8>, ) -> Result<Self, StoreError>

Create a new BackendTrieDB for a specific storage trie

pub fn new_for_account_storage_with_view( db: Arc<dyn StorageBackend>, read_view: Arc<dyn StorageReadView>, address_prefix: H256, last_written: Vec<u8>, ) -> Result<Self, StoreError>

Create a new BackendTrieDB for a specific storage trie with a shared read view

Trait Implementations

impl TrieDB for BackendTrieDB

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

fn get(&self, key: Nibbles) -> Result<Option<Vec<u8>>, 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( &self, key_values: Vec<(Nibbles, Vec<u8>)>, ) -> Result<(), TrieError>

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