Enum trie_db::TrieKinds

pub enum TrieKinds<'db, 'cache, L: TrieLayout> {
    Generic(TrieDB<'db, 'cache, L>),
    Secure(SecTrieDB<'db, 'cache, L>),
    Fat(FatDB<'db, 'cache, L>),
}

All different kinds of tries. This is used to prevent a heap allocation for every created trie.

Variants

Generic(TrieDB<'db, 'cache, L>)

A generic trie db.

Secure(SecTrieDB<'db, 'cache, L>)

A secure trie db.

Fat(FatDB<'db, 'cache, L>)

A fat trie db.

Trait Implementations

impl<'db, 'cache, L: TrieLayout> Trie<L> for TrieKinds<'db, 'cache, L>

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

Return the root of the trie.

fn is_empty(&self) -> bool

Is the trie empty?

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

Does the trie contain a given key?

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

Returns the hash of the value for key.

fn get_with<Q: Query<L::Hash>>( &self, key: &[u8], query: Q ) -> Result<Option<Q::Item>, TrieHash<L>, CError<L>>

Search for the key with the given query parameter. See the docs of the Query trait for more details.

fn lookup_first_descendant( &self, key: &[u8] ) -> Result<Option<MerkleValue<TrieHash<L>>>, TrieHash<L>, CError<L>>

Look up the MerkleValue of the node that is the closest descendant for the provided key.

fn iter<'a>( &'a self ) -> Result<Box<dyn TrieIterator<L, Item = TrieItem<TrieHash<L>, CError<L>>> + 'a>, TrieHash<L>, CError<L>>

Returns a depth-first iterator over the elements of trie.

fn key_iter<'a>( &'a self ) -> Result<Box<dyn TrieIterator<L, Item = TrieKeyItem<TrieHash<L>, CError<L>>> + 'a>, TrieHash<L>, CError<L>>

Returns a depth-first iterator over the keys of elemets of trie.

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

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