Struct AccountDB

pub struct AccountDB<'db> { /* private fields */ }

DB backend wrapper for Account trie Transforms trie node keys for the database

Implementations

impl<'db> AccountDB<'db>

pub fn from_hash( db: &'db dyn HashDB<KeccakHasher, DBValue>, address_hash: H256, ) -> Self

Create a new AccountDB from an address’ hash.

Trait Implementations

impl<'db> AsHashDB<KeccakHasher, Vec<u8>> for AccountDB<'db>

fn as_hash_db(&self) -> &dyn HashDB<KeccakHasher, DBValue>

Perform upcast to HashDB for anything that derives from HashDB.

fn as_hash_db_mut(&mut self) -> &mut dyn HashDB<KeccakHasher, DBValue>

Perform mutable upcast to HashDB for anything that derives from HashDB.

impl<'db> HashDB<KeccakHasher, Vec<u8>> for AccountDB<'db>

fn get(&self, key: &H256, prefix: Prefix<'_>) -> Option<DBValue>

Look up a given hash into the bytes that hash to it, returning None if the hash is not known.

fn contains(&self, key: &H256, prefix: Prefix<'_>) -> bool

Check for the existence of a hash-key.

fn insert(&mut self, _prefix: Prefix<'_>, _value: &[u8]) -> H256

Insert a datum item into the DB and return the datum’s hash for a later lookup. Insertions are counted and the equivalent number of remove()s must be performed before the data is considered dead.

fn emplace(&mut self, _key: H256, _prefix: Prefix<'_>, _value: DBValue)

Like insert(), except you provide the key and the data is all moved.

fn remove(&mut self, _key: &H256, _prefix: Prefix<'_>)

Remove a datum previously inserted. Insertions can be “owed” such that the same number of insert()s may happen without the data being eventually being inserted into the DB. It can be “owed” more than once.