Struct cw_merkle_tree::tree::SparseMerkleTreeWithHistory

source · [−]

pub struct SparseMerkleTreeWithHistory<'a, L: Serialize + DeserializeOwned + Clone + Debug + PartialEq + PrimaryKey<'a>, H: Hasher<L>> {
    pub tree: SparseMerkleTree<'a, L, H>,
    pub root_history: Map<'a, L, Empty>,
}

Expand description

Like SparseMerkleTree but able to check valid root hash with all previous root hashes.

Fields

tree: SparseMerkleTree<'a, L, H>root_history: Map<'a, L, Empty>

Implementations

source

impl<'a, L: Serialize + DeserializeOwned + Clone + Debug + PartialEq + PrimaryKey<'a>, H: Hasher<L>> SparseMerkleTreeWithHistory<'a, L, H>

source

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
) -> Self

Trait Implementations

source

impl<'a, L: Serialize + DeserializeOwned + Clone + Debug + PartialEq + PrimaryKey<'a>, H: Hasher<L>> MerkleTree<L, H> for SparseMerkleTreeWithHistory<'a, L, H>

source

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

Initize the tree.

source

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

Check if the root is valid for the tree.

source

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. Read more

source

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

Get the latest root of the tree.

Auto Trait Implementations

impl<'a, L, H> RefUnwindSafe for SparseMerkleTreeWithHistory<'a, L, H>where
H: RefUnwindSafe,
L: RefUnwindSafe,

impl<'a, L, H> Send for SparseMerkleTreeWithHistory<'a, L, H>where
H: Send,
L: Send,

impl<'a, L, H> Sync for SparseMerkleTreeWithHistory<'a, L, H>where
H: Sync,
L: Sync,

impl<'a, L, H> Unpin for SparseMerkleTreeWithHistory<'a, L, H>where
H: Unpin,
L: Unpin,

impl<'a, L, H> UnwindSafe for SparseMerkleTreeWithHistory<'a, L, H>where
H: UnwindSafe,
L: UnwindSafe,

Blanket Implementations

source

impl<T> Any for Twhere
T: 'static + ?Sized,

source

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more

source

impl<T> Borrow<T> for Twhere
T: ?Sized,

const: unstable · source

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more

source

impl<T> BorrowMut<T> for Twhere
T: ?Sized,

const: unstable · source

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more

source

impl<T> From<T> for T

const: unstable · source

fn from(t: T) -> T

Returns the argument unchanged.

source

impl<T, U> Into for Twhere
U: From<T>,

const: unstable · source

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

source

impl<T> Same<T> for T

type Output = T

Should always be Self

source

impl<T, U> TryFrom for Twhere
U: Into<T>,

type Error = Infallible

The type returned in the event of a conversion error.

const: unstable · source

fn try_from(value: U) -> Result<T, <T as TryFrom>::Error>

Performs the conversion.

source

impl<T, U> TryInto for Twhere
U: TryFrom<T>,

type Error = >::Error

The type returned in the event of a conversion error.

const: unstable · source

fn try_into(self) -> Result<U, >::Error>

Performs the conversion.

Struct cw_merkle_tree::tree::SparseMerkleTreeWithHistory

Fields

Implementations

impl<'a, L: Serialize + DeserializeOwned + Clone + Debug + PartialEq + PrimaryKey<'a>, H: Hasher<L>> SparseMerkleTreeWithHistory<'a, L, H>

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
) -> Self

Trait Implementations

impl<'a, L: Serialize + DeserializeOwned + Clone + Debug + PartialEq + PrimaryKey<'a>, H: Hasher<L>> MerkleTree<L, H> for SparseMerkleTreeWithHistory<'a, L, H>

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

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

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

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

Auto Trait Implementations

impl<'a, L, H> RefUnwindSafe for SparseMerkleTreeWithHistory<'a, L, H>where
H: RefUnwindSafe,
L: RefUnwindSafe,

impl<'a, L, H> Send for SparseMerkleTreeWithHistory<'a, L, H>where
H: Send,
L: Send,

impl<'a, L, H> Sync for SparseMerkleTreeWithHistory<'a, L, H>where
H: Sync,
L: Sync,

impl<'a, L, H> Unpin for SparseMerkleTreeWithHistory<'a, L, H>where
H: Unpin,
L: Unpin,

impl<'a, L, H> UnwindSafe for SparseMerkleTreeWithHistory<'a, L, H>where
H: UnwindSafe,
L: UnwindSafe,

Blanket Implementations

impl<T> Any for Twhere
T: 'static + ?Sized,

fn type_id(&self) -> TypeId

impl<T> Borrow<T> for Twhere
T: ?Sized,

fn borrow(&self) -> &T

impl<T> BorrowMut<T> for Twhere
T: ?Sized,

fn borrow_mut(&mut self) -> &mut T

impl<T> From<T> for T

fn from(t: T) -> T

impl<T, U> Into<U> for Twhere
U: From<T>,

fn into(self) -> U

impl<T> Same<T> for T

type Output = T

impl<T, U> TryFrom<U> for Twhere
U: Into<T>,

type Error = Infallible

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

impl<T, U> TryInto<U> for Twhere
U: TryFrom<T>,

type Error = <U as TryFrom<T>>::Error

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Struct cw_merkle_tree::tree::SparseMerkleTreeWithHistory

Fields

Implementations

impl<'a, L: Serialize + DeserializeOwned + Clone + Debug + PartialEq + PrimaryKey<'a>, H: Hasher<L>> SparseMerkleTreeWithHistory<'a, L, H>

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) -> Self

Trait Implementations

impl<'a, L: Serialize + DeserializeOwned + Clone + Debug + PartialEq + PrimaryKey<'a>, H: Hasher<L>> MerkleTree<L, H> for SparseMerkleTreeWithHistory<'a, L, H>

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

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

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

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

Auto Trait Implementations

impl<'a, L, H> RefUnwindSafe for SparseMerkleTreeWithHistory<'a, L, H>where H: RefUnwindSafe, L: RefUnwindSafe,

impl<'a, L, H> Send for SparseMerkleTreeWithHistory<'a, L, H>where H: Send, L: Send,

impl<'a, L, H> Sync for SparseMerkleTreeWithHistory<'a, L, H>where H: Sync, L: Sync,

impl<'a, L, H> Unpin for SparseMerkleTreeWithHistory<'a, L, H>where H: Unpin, L: Unpin,

impl<'a, L, H> UnwindSafe for SparseMerkleTreeWithHistory<'a, L, H>where H: UnwindSafe, L: UnwindSafe,

Blanket Implementations

impl<T> Any for Twhere T: 'static + ?Sized,

fn type_id(&self) -> TypeId

impl<T> Borrow<T> for Twhere T: ?Sized,

fn borrow(&self) -> &T

impl<T> BorrowMut<T> for Twhere T: ?Sized,

fn borrow_mut(&mut self) -> &mut T

impl<T> From<T> for T

fn from(t: T) -> T

impl<T, U> Into<U> for Twhere U: From<T>,

fn into(self) -> U

impl<T> Same<T> for T

type Output = T

impl<T, U> TryFrom<U> for Twhere U: Into<T>,

type Error = Infallible

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

impl<T, U> TryInto<U> for Twhere U: TryFrom<T>,

type Error = <U as TryFrom<T>>::Error

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

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
) -> Self

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

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

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

impl<'a, L, H> RefUnwindSafe for SparseMerkleTreeWithHistory<'a, L, H>where
H: RefUnwindSafe,
L: RefUnwindSafe,

impl<'a, L, H> Send for SparseMerkleTreeWithHistory<'a, L, H>where
H: Send,
L: Send,

impl<'a, L, H> Sync for SparseMerkleTreeWithHistory<'a, L, H>where
H: Sync,
L: Sync,

impl<'a, L, H> Unpin for SparseMerkleTreeWithHistory<'a, L, H>where
H: Unpin,
L: Unpin,

impl<'a, L, H> UnwindSafe for SparseMerkleTreeWithHistory<'a, L, H>where
H: UnwindSafe,
L: UnwindSafe,

impl<T> Any for Twhere
T: 'static + ?Sized,

impl<T> Borrow<T> for Twhere
T: ?Sized,

impl<T> BorrowMut<T> for Twhere
T: ?Sized,

impl<T, U> Into<U> for Twhere
U: From<T>,

impl<T, U> TryFrom<U> for Twhere
U: Into<T>,

impl<T, U> TryInto<U> for Twhere
U: TryFrom<T>,