Enum trie_db::TrieKinds

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.

Tuple Fields of Generic

0: TrieDB<'db, L>

Secure(SecTrieDB<'db, L>)

A secure trie db.

Tuple Fields of Secure

0: SecTrieDB<'db, L>

Fat(FatDB<'db, L>)

A fat trie db.

Tuple Fields of Fat

0: FatDB<'db, L>

Trait Implementations

impl<'db, L: TrieLayout> Trie<L> for TrieKinds<'db, 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_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, 

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

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 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?