Trait hash_db::HashDB

source ·

pub trait HashDB<H: Hasher, T>: Send + Sync + AsHashDB<H, T> {
    // Required methods
    fn get(&self, key: &H::Out, prefix: Prefix<'_>) -> Option<T>;
    fn contains(&self, key: &H::Out, prefix: Prefix<'_>) -> bool;
    fn insert(&mut self, prefix: Prefix<'_>, value: &[u8]) -> H::Out;
    fn emplace(&mut self, key: H::Out, prefix: Prefix<'_>, value: T);
    fn remove(&mut self, key: &H::Out, prefix: Prefix<'_>);
}

Expand description

Trait modelling datastore keyed by a hash defined by the Hasher.

Required Methods§

source

fn get(&self, key: &H::Out, prefix: Prefix<'_>) -> Option<T>

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

source

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

Check for the existence of a hash-key.

source

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

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.

source

fn emplace(&mut self, key: H::Out, prefix: Prefix<'_>, value: T)

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

source

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