Struct SparseMerkleTree

pub struct SparseMerkleTree<H, K, V, S, const N: usize>
where
    H: Hasher + Default,
    K: Key<N>,
    V: Value,
    S: Store<K, V, N>,
{ /* private fields */ }

Sparse merkle tree

Implementations

impl<H, K, V, S, const N: usize> SparseMerkleTree<H, K, V, S, N>

where H: Hasher + Default, K: Key<N>, V: Value + PartialEq, S: Store<K, V, N>,

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

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: K, value: V) -> Result<&H256>

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

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

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

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

Generate merkle proof

pub fn membership_proof(&self, key: &K) -> Result<CommitmentProof>

Generate ICS 23 commitment proof for the existing key

pub fn non_membership_proof(&self, key: &K) -> Result<CommitmentProof>

Generate ICS 23 commitment proof for the non-existing key

pub fn validate(&self) -> bool

Recompute the root of the merkle tree from the store. Check if it agrees with the root in self.

Trait Implementations

impl<H, K, V, S, const N: usize> Debug for SparseMerkleTree<H, K, V, S, N>

where H: Hasher + Default + Debug, K: Key<N> + Debug, V: Value + Debug, S: Store<K, V, N> + Debug,

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

Formats the value using the given formatter.

impl<H, K, V, S, const N: usize> Default for SparseMerkleTree<H, K, V, S, N>

where H: Hasher + Default, K: Key<N>, V: Value + PartialEq, S: Store<K, V, N>,

fn default() -> Self

Returns the “default value” for a type.