Struct restricted_sparse_merkle_tree::tree::SparseMerkleTree

pub struct SparseMerkleTree<H, V, S> { /* fields omitted */ }

Sparse merkle tree

Implementations

impl<H: Hasher + Default, V: Value, S: Store<V>> SparseMerkleTree<H, V, S>

pub fn new(root: H256, store: S) -> SparseMerkleTree<H, V, S>

Build a merkle tree from root and store

pub fn root(&self) -> &H256

Merkle root

pub fn is_empty(&self) -> bool

Check empty of the tree

pub fn take_store(self) -> S

Destroy current tree and retake store

pub fn store(&self) -> &S

Get backend store

pub fn store_mut(&mut self) -> &mut S

Get mutable backend store

pub fn update(&mut self, key: H256, value: V) -> Result<&H256>

Update a leaf, return new merkle root set to zero value to delete a key

pub fn get(&self, key: &H256) -> Result<V>

Get value of a leaf return zero value if leaf not exists

pub fn merkle_proof(&self, keys: Vec<H256>) -> Result<MerkleProof>

Generate merkle proof

Trait Implementations

impl<H: Debug, V: Debug, S: Debug> Debug for SparseMerkleTree<H, V, S>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<H: Default, V: Default, S: Default> Default for SparseMerkleTree<H, V, S>

fn default() -> SparseMerkleTree<H, V, S>

Returns the “default value” for a type.