pub trait PlainDB<K, V>: Send + Sync + AsPlainDB<K, V> {
    fn get(&self, key: &K) -> Option<V>;
fn contains(&self, key: &K) -> bool;
fn emplace(&mut self, key: K, value: V);
fn remove(&mut self, key: &K); }
Expand description

Trait modelling a plain datastore whose key is a fixed type. The caller should ensure that a key only corresponds to one value.

Required methods

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

Check for the existance of a hash-key.

Insert a datum item into the DB. Insertions are counted and the equivalent number of remove()s must be performed before the data is considered dead. The caller should ensure that a key only corresponds to one value.

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. The caller should ensure that a key only corresponds to one value.

Trait Implementations

Perform upcast to PlainDB for anything that derives from PlainDB.

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

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

Check for the existance of a hash-key.

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

Check for the existance of a hash-key.

Implementors