[−][src]Trait trie_db::TrieMut
A key-value datastore implemented as a database-backed modified Merkle tree.
Required methods
pub fn root(&mut self) -> &TrieHash<L>
[src]
Return the root of the trie.
pub fn is_empty(&self) -> bool
[src]
Is the trie empty?
pub fn get<'a, 'key>(
&'a self,
key: &'key [u8]
) -> Result<Option<DBValue>, TrieHash<L>, CError<L>> where
'a: 'key,
[src]
&'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?
pub fn insert(
&mut self,
key: &[u8],
value: &[u8]
) -> Result<Option<DBValue>, TrieHash<L>, CError<L>>
[src]
&mut self,
key: &[u8],
value: &[u8]
) -> Result<Option<DBValue>, 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.
pub fn remove(
&mut self,
key: &[u8]
) -> Result<Option<DBValue>, TrieHash<L>, CError<L>>
[src]
&mut self,
key: &[u8]
) -> Result<Option<DBValue>, 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
pub fn contains(&self, key: &[u8]) -> Result<bool, TrieHash<L>, CError<L>>
[src]
Does the trie contain a given key?
Implementors
impl<'a, L> TrieMut<L> for TrieDBMut<'a, L> where
L: TrieLayout,
[src]
L: TrieLayout,
pub fn root(&mut self) -> &TrieHash<L>
[src]
pub fn is_empty(&self) -> bool
[src]
pub fn get<'x, 'key>(
&'x self,
key: &'key [u8]
) -> Result<Option<DBValue>, TrieHash<L>, CError<L>> where
'x: 'key,
[src]
&'x self,
key: &'key [u8]
) -> Result<Option<DBValue>, TrieHash<L>, CError<L>> where
'x: 'key,
pub fn insert(
&mut self,
key: &[u8],
value: &[u8]
) -> Result<Option<DBValue>, TrieHash<L>, CError<L>>
[src]
&mut self,
key: &[u8],
value: &[u8]
) -> Result<Option<DBValue>, TrieHash<L>, CError<L>>
pub fn remove(
&mut self,
key: &[u8]
) -> Result<Option<DBValue>, TrieHash<L>, CError<L>>
[src]
&mut self,
key: &[u8]
) -> Result<Option<DBValue>, TrieHash<L>, CError<L>>
impl<'db, L> TrieMut<L> for SecTrieDBMut<'db, L> where
L: TrieLayout,
[src]
L: TrieLayout,
pub fn root(&mut self) -> &TrieHash<L>
[src]
pub fn is_empty(&self) -> bool
[src]
pub fn contains(&self, key: &[u8]) -> Result<bool, TrieHash<L>, CError<L>>
[src]
pub fn get<'a, 'key>(
&'a self,
key: &'key [u8]
) -> Result<Option<DBValue>, TrieHash<L>, CError<L>> where
'a: 'key,
[src]
&'a self,
key: &'key [u8]
) -> Result<Option<DBValue>, TrieHash<L>, CError<L>> where
'a: 'key,
pub fn insert(
&mut self,
key: &[u8],
value: &[u8]
) -> Result<Option<DBValue>, TrieHash<L>, CError<L>>
[src]
&mut self,
key: &[u8],
value: &[u8]
) -> Result<Option<DBValue>, TrieHash<L>, CError<L>>
pub fn remove(
&mut self,
key: &[u8]
) -> Result<Option<DBValue>, TrieHash<L>, CError<L>>
[src]
&mut self,
key: &[u8]
) -> Result<Option<DBValue>, TrieHash<L>, CError<L>>
impl<'db, L> TrieMut<L> for FatDBMut<'db, L> where
L: TrieLayout,
[src]
L: TrieLayout,
pub fn root(&mut self) -> &TrieHash<L>
[src]
pub fn is_empty(&self) -> bool
[src]
pub fn contains(&self, key: &[u8]) -> Result<bool, TrieHash<L>, CError<L>>
[src]
pub fn get<'a, 'key>(
&'a self,
key: &'key [u8]
) -> Result<Option<DBValue>, TrieHash<L>, CError<L>> where
'a: 'key,
[src]
&'a self,
key: &'key [u8]
) -> Result<Option<DBValue>, TrieHash<L>, CError<L>> where
'a: 'key,
pub fn insert(
&mut self,
key: &[u8],
value: &[u8]
) -> Result<Option<DBValue>, TrieHash<L>, CError<L>>
[src]
&mut self,
key: &[u8],
value: &[u8]
) -> Result<Option<DBValue>, TrieHash<L>, CError<L>>
pub fn remove(
&mut self,
key: &[u8]
) -> Result<Option<DBValue>, TrieHash<L>, CError<L>>
[src]
&mut self,
key: &[u8]
) -> Result<Option<DBValue>, TrieHash<L>, CError<L>>