Struct Tree 

pub struct Tree<N, L> { /* private fields */ }

Implementations

impl<N, L> Tree<N, L>

where N: StoreRead<Key = NodeKey, Value = [u8; 32]>,

pub fn get_consistency_proof( &self, first: &TreeHead, second: &TreeHead, ) -> Result<ConsistencyProof, ProofGenerationError>

This follows RFC 9162 2.1.4.1

impl<N, L> Tree<N, L>

where N: AsyncStoreRead<Key = NodeKey, Value = [u8; 32]>,

pub async fn get_consistency_proof_async( &self, first: &TreeHead, second: &TreeHead, ) -> Result<ConsistencyProof, ProofGenerationError>

impl<N, L> Tree<N, L>

where N: StoreRead<Key = NodeKey, Value = [u8; 32]>,

pub fn get_audit_proof( &self, head: &TreeHead, index: u64, ) -> Result<AuditProof, ProofGenerationError>

This follows RFC 9162 2.1.3.1

impl<N, L> Tree<N, L>

where N: AsyncStoreRead<Key = NodeKey, Value = [u8; 32]>,

pub async fn get_audit_proof_async( &self, head: &TreeHead, index: u64, ) -> Result<AuditProof, ProofGenerationError>

impl<N, L> Tree<N, L>

pub fn new(node_store: N, leaf_store: L) -> Self

pub fn nodes(&self) -> &N

impl<N, L> Tree<N, L>

where N: Store<Key = NodeKey, Value = [u8; 32]>, L: AppendableStore<Key = u64, Value: Hashable>,

pub fn insert_entry(&self, entry: L::Value)

pub fn recompute_tree_head(&self) -> TreeHead

pub fn get_latest_tree_head(&self) -> Option<TreeHead>

Trait Implementations

impl<N: Clone, L: Clone> Clone for Tree<N, L>

fn clone(&self) -> Tree<N, L>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<N: Debug, L: Debug> Debug for Tree<N, L>

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

Formats the value using the given formatter.