Trait trie_db::TrieMut

pub trait TrieMut<L: TrieLayout> {
    // Required methods
    fn root(&mut self) -> &TrieHash<L>;
    fn is_empty(&self) -> bool;
    fn get<'a, 'key>(
        &'a self,
        key: &'key [u8]
    ) -> Result<Option<DBValue>, TrieHash<L>, CError<L>>
       where 'a: 'key;
    fn insert(
        &mut self,
        key: &[u8],
        value: &[u8]
    ) -> Result<Option<Value<L>>, TrieHash<L>, CError<L>>;
    fn remove(
        &mut self,
        key: &[u8]
    ) -> Result<Option<Value<L>>, TrieHash<L>, CError<L>>;

    // Provided method
    fn contains(&self, key: &[u8]) -> Result<bool, TrieHash<L>, CError<L>> { ... }
}

A key-value datastore implemented as a database-backed modified Merkle tree.

Required Methods

fn root(&mut self) -> &TrieHash<L>

Return the root of the trie.

fn is_empty(&self) -> bool

Is the trie empty?

fn get<'a, 'key>( &'a self, key: &'key [u8] ) -> Result<Option<DBValue>, TrieHash<L>, CError<L>>

where 'a: 'key,

What is the value of the given key in this trie?

fn insert( &mut self, key: &[u8], value: &[u8] ) -> Result<Option<Value<L>>, TrieHash<L>, CError<L>>

Insert a key/value pair into the trie. An empty value is equivalent to removing key from the trie. Returns the old value associated with this key, if it existed.

fn remove( &mut self, key: &[u8] ) -> Result<Option<Value<L>>, TrieHash<L>, CError<L>>

Remove a key from the trie. Equivalent to making it equal to the empty value. Returns the old value associated with this key, if it existed.

Provided Methods

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

Does the trie contain a given key?

Implementors

impl<'a, L> TrieMut<L> for TrieDBMut<'a, L>

where L: TrieLayout,

impl<'db, L> TrieMut<L> for SecTrieDBMut<'db, L>

where L: TrieLayout,

impl<'db, L> TrieMut<L> for FatDBMut<'db, L>

where L: TrieLayout,