Struct EthTrie 

pub struct EthTrie<D>
where
    D: DB,
{
    pub db: Arc<D>,
    /* private fields */
}

Fields

db: Arc<D>

Implementations

impl<D> EthTrie<D>

where D: DB,

pub fn iter(&self) -> TrieIterator<'_, D>

pub fn new(db: Arc<D>) -> Self

pub fn from(db: Arc<D>, root: B256) -> Result<Self, TrieError>

Trait Implementations

impl<D> Debug for EthTrie<D>

where D: DB + Debug,

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

Formats the value using the given formatter.

impl<D> Trie<D> for EthTrie<D>

where D: DB,

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

Returns the value for key stored in the trie.

fn contains(&self, key: &[u8]) -> Result<bool, TrieError>

Checks that the key is present in the trie

fn insert(&mut self, key: &[u8], value: &[u8]) -> Result<(), TrieError>

Inserts value into trie and modifies it if it exists

fn remove(&mut self, key: &[u8]) -> Result<bool, TrieError>

Removes any existing value for key from the trie.

fn root_hash(&mut self) -> Result<B256, TrieError>

Saves all the nodes in the db, clears the cache data, recalculates the root. Returns the root hash of the trie.

fn root_hash_with_changed_nodes( &mut self, ) -> Result<RootWithTrieDiff, TrieError>

Saves all the nodes in the db, clears the cache data, recalculates the root. Returns the root hash of the trie and updated nodes from the cache.

fn clear_trie_from_db(&mut self) -> Result<(), TrieError>

Clears the whole trie from the database.

fn get_proof(&mut self, key: &[u8]) -> Result<Vec<Vec<u8>>, TrieError>

Prove constructs a merkle proof for key. The result contains all encoded nodes on the path to the value at key. The value itself is also included in the last node and can be retrieved by verifying the proof.

If the trie does not contain a value for key, the returned proof contains all nodes of the longest existing prefix of the key (at least the root node), ending with the node that proves the absence of the key.

fn verify_proof( &self, root_hash: B256, key: &[u8], proof: Vec<Vec<u8>>, ) -> Result<Option<Vec<u8>>, TrieError>

return value if key exists, None if key not exist, Error if proof is wrong