Struct node_bench::simple_trie::SimpleTrie

pub struct SimpleTrie<'a> {
    pub db: Arc<dyn KeyValueDB>,
    pub overlay: &'a mut HashMap<Vec<u8>, Option<Vec<u8>>>,
}

Immutable generated trie database with root.

Fields

db: Arc<dyn KeyValueDB>

overlay: &'a mut HashMap<Vec<u8>, Option<Vec<u8>>>

Trait Implementations

impl<'a> AsHashDB<Blake2Hasher, Vec<u8, Global>> for SimpleTrie<'a>

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

Perform upcast to HashDB for anything that derives from HashDB.

fn as_hash_db_mut<'b>(
    &'b mut self
) -> &'b mut (dyn HashDB<Blake2Hasher, DBValue> + 'b)

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

impl<'a> HashDB<Blake2Hasher, Vec<u8, Global>> for SimpleTrie<'a>

fn get(&self, key: &Hash, 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, hash: &Hash, prefix: Prefix<'_>) -> bool

Check for the existance of a hash-key.

fn insert(&mut self, prefix: Prefix<'_>, value: &[u8]) -> Hash

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: Hash, prefix: Prefix<'_>, value: DBValue)

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

fn remove(&mut self, key: &Hash, 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.