Enum trie_db::TrieKinds [−][src]
pub enum TrieKinds<'db, L: TrieLayout> { Generic(TrieDB<'db, L>), Secure(SecTrieDB<'db, L>), Fat(FatDB<'db, L>), }
All different kinds of tries. This is used to prevent a heap allocation for every created trie.
Variants
Generic(TrieDB<'db, L>)A generic trie db.
Secure(SecTrieDB<'db, L>)A secure trie db.
Fat(FatDB<'db, L>)A fat trie db.
Trait Implementations
impl<'db, L: TrieLayout> Trie<L> for TrieKinds<'db, L>[src]
impl<'db, L: TrieLayout> Trie<L> for TrieKinds<'db, L>[src]fn root(&self) -> &TrieHash<L>[src]
fn is_empty(&self) -> bool[src]
fn contains(&self, key: &[u8]) -> Result<bool, TrieHash<L>, CError<L>>[src]
fn get_with<'a, 'key, Q: Query<L::Hash>>(
&'a self,
key: &'key [u8],
query: Q
) -> Result<Option<Q::Item>, TrieHash<L>, CError<L>> where
'a: 'key, [src]
&'a self,
key: &'key [u8],
query: Q
) -> Result<Option<Q::Item>, TrieHash<L>, CError<L>> where
'a: 'key,
fn iter<'a>(
&'a self
) -> Result<Box<dyn TrieIterator<L, Item = TrieItem<'_, TrieHash<L>, CError<L>>> + 'a>, TrieHash<L>, CError<L>>[src]
&'a self
) -> Result<Box<dyn TrieIterator<L, Item = TrieItem<'_, TrieHash<L>, CError<L>>> + 'a>, TrieHash<L>, CError<L>>
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,