Trait sp_trie::Trie

source · [−]
pub trait Trie<L> where
    L: TrieLayout, {
    fn root(&self) -> &<<L as TrieLayout>::Hash as Hasher>::Out;

    fn get_with<'a, 'key, Q>(
        &'a self, 
        key: &'key [u8], 
        query: Q
    ) -> Result<Option<<Q as Query<<L as TrieLayout>::Hash>>::Item>, Box<TrieError<<<L as TrieLayout>::Hash as Hasher>::Out, <<L as TrieLayout>::Codec as NodeCodec>::Error>, Global>>
    where
        'a: 'key,
        Q: Query<<L as TrieLayout>::Hash>;

    fn iter(
        &'a self
    ) -> Result<Box<dyn TrieIterator<L, Item = Result<(Vec<u8, Global>, Vec<u8, Global>), Box<TrieError<<<L as TrieLayout>::Hash as Hasher>::Out, <<L as TrieLayout>::Codec as NodeCodec>::Error>, Global>>> + 'a, Global>, Box<TrieError<<<L as TrieLayout>::Hash as Hasher>::Out, <<L as TrieLayout>::Codec as NodeCodec>::Error>, Global>>;

    fn is_empty(&self) -> bool { ... }

    fn contains(
        &self, 
        key: &[u8]
    ) -> Result<bool, Box<TrieError<<<L as TrieLayout>::Hash as Hasher>::Out, <<L as TrieLayout>::Codec as NodeCodec>::Error>, Global>> { ... }

    fn get<'a, 'key>(
        &'a self, 
        key: &'key [u8]
    ) -> Result<Option<Vec<u8, Global>>, Box<TrieError<<<L as TrieLayout>::Hash as Hasher>::Out, <<L as TrieLayout>::Codec as NodeCodec>::Error>, Global>>
    where
        'a: 'key,
    { ... }
}
Expand description

Various re-exports from the trie-db crate. A key-value datastore implemented as a database-backed modified Merkle tree.

Required methods

Return the root of the trie.

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

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

Provided methods

Is the trie empty?

Does the trie contain a given key?

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

Implementations on Foreign Types

Implementors