Struct patricia_trie::FatDB

pub struct FatDB<'db, H, C> where
    H: Hasher + 'db,
    C: NodeCodec<H>,  { /* fields omitted */ }

A Trie implementation which hashes keys and uses a generic HashDB backing database. Additionaly it stores inserted hash-key mappings for later retrieval.

Use it as a Trie or TrieMut trait object.

Methods

impl<'db, H, C> FatDB<'db, H, C> where     H: Hasher,     C: NodeCodec<H>,

pub fn new(     db: &'db HashDB<H, DBValue>,     root: &'db H::Out ) -> Result<Self, H::Out, C::Error>

Create a new trie with the backing database db and empty root Initialise to the state entailed by the genesis block. This guarantees the trie is built correctly.

pub fn db(&self) -> &HashDB<H, DBValue>

Get the backing database.

Trait Implementations

impl<'db, H, C> Trie<H, C> for FatDB<'db, H, C> where     H: Hasher,     C: NodeCodec<H>,

fn root(&self) -> &H::Out

Return the root of the trie.

fn contains(&self, key: &[u8]) -> Result<bool, H::Out, C::Error>

Does the trie contain a given key?

fn get_with<'a, 'key, Q: Query<H>>(     &'a self,     key: &'key [u8],     query: Q ) -> Result<Option<Q::Item>, H::Out, C::Error> 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<TrieIterator<H, C, Item = TrieItem<H::Out, C::Error>> + 'a>, <H as Hasher>::Out, C::Error>

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

fn is_empty(&self) -> bool

Is the trie empty?

fn get<'a, 'key>(     &'a self,     key: &'key [u8] ) -> Result<Option<DBValue>, H::Out, C::Error> where     'a: 'key,

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