Struct SparseMerkleTreeWithHistoryBounded 

pub struct SparseMerkleTreeWithHistoryBounded<'a, L: Serialize + DeserializeOwned + Clone + Debug + PartialEq + PrimaryKey<'a>, H: Hasher<L>, const HISTORY_LEVEL: u32> {
    pub history_index: Item<'a, u32>,
    pub root_history: Map<'a, L, Empty>,
    pub root_index: Map<'a, u32, L>,
    pub tree: SparseMerkleTree<'a, L, H>,
}

Like SparseMerkleTree but able to check valid root hash with previous root hashes upto specified history level.

Fields

history_index: Item<'a, u32>

root_history: Map<'a, L, Empty>

root_index: Map<'a, u32, L>

tree: SparseMerkleTree<'a, L, H>

Implementations

impl<'a, L: Serialize + DeserializeOwned + Clone + Debug + PartialEq + PrimaryKey<'a>, H: Hasher<L>, const HISTORY_LEVEL: u32> SparseMerkleTreeWithHistoryBounded<'a, L, H, HISTORY_LEVEL>

pub const fn new( hashes_ns: &'a str, leafs_ns: &'a str, level_ns: &'a str, root_ns: &'a str, root_history_ns: &'a str, root_index_ns: &'a str, history_index_ns: &'a str, ) -> Self

pub fn update_history_level( &self, storage: &mut dyn Storage, ) -> Result<(), MerkleTreeError>

Remove storage unused and out of range stored root. The removed root might not be the earliest.

Trait Implementations

impl<'a, L: Serialize + DeserializeOwned + Clone + Debug + PartialEq + PrimaryKey<'a>, H: Hasher<L>, const HISTORY_LEVEL: u32> MerkleTree<L, H> for SparseMerkleTreeWithHistoryBounded<'a, L, H, HISTORY_LEVEL>

fn init( &self, storage: &mut dyn Storage, level: u8, default_leaf: L, hasher: &H, ) -> Result<(), MerkleTreeError>

Initize the tree.

fn is_valid_root( &self, storage: &dyn Storage, root: &L, ) -> Result<bool, MerkleTreeError>

Check if the root is valid for the tree.

fn insert( &self, storage: &mut dyn Storage, leaf: L, hasher: &H, ) -> Result<(u64, L), MerkleTreeError>

Insert the leaf into the next index slot of the tree. Return the leaf’s index and the updated root.

fn get_latest_root(&self, storage: &dyn Storage) -> Result<L, MerkleTreeError>

Get the latest root of the tree.