Struct SparseMerkleTree 

pub struct SparseMerkleTree {
    pub nodes: HashMap<(usize, Hash), Hash>,
}

Fields

nodes: HashMap<(usize, Hash), Hash>

nodes: HashMap<(level, index_hash), value_hash> For a 256-level tree, index_hash is the path truncated or full. Simplified: We store only non-default nodes.

Implementations

impl SparseMerkleTree

pub fn new() -> Self

pub fn root(&self) -> Hash

pub fn update(&mut self, key: Hash, value: Hash)

pub fn get_proof(&self, key: Hash) -> Vec<Hash>

Trait Implementations

impl Clone for SparseMerkleTree

fn clone(&self) -> SparseMerkleTree

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for SparseMerkleTree

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

Formats the value using the given formatter.

impl Default for SparseMerkleTree

fn default() -> SparseMerkleTree

Returns the “default value” for a type.

impl<'de> Deserialize<'de> for SparseMerkleTree

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl PartialEq for SparseMerkleTree

fn eq(&self, other: &SparseMerkleTree) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl Serialize for SparseMerkleTree

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl Eq for SparseMerkleTree

impl StructuralPartialEq for SparseMerkleTree