Struct TreeDB 

pub struct TreeDB<'db, const D: usize, H: Hasher> { /* private fields */ }

An immutable merkle tree db that uses a byte slice key to specify the leaves in the tree.

Implementations

impl<'db, const D: usize, H: Hasher> TreeDB<'db, D, H>

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

Return the underlying db of a TreeDB

Trait Implementations

impl<'db, H: Hasher, const D: usize> KeyedTree<H, D> for TreeDB<'db, D, H>

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

Returns the root of the tree

fn value(&self, key: &[u8]) -> Result<Option<DBValue>, TreeError>

Returns the value associated with the given key

fn leaf(&self, key: &[u8]) -> Result<Option<H::Out>, TreeError>

Returns the leaf associated with the given key

fn proof( &self, key: &[u8], ) -> Result<(Option<DBValue>, H::Out, Vec<DBValue>), TreeError>

Returns an inclusion proof of a value a the specified key. Returns a tuple of form: (value, root, proof)

fn verify( key: &[u8], value: &[u8], proof: &[DBValue], root: &H::Out, ) -> Result<bool, TreeError>

Verifies that the given value is in the tree with the given root at the given index

fn depth(&self) -> usize

Returns the depth of the tree.