Struct akd::proof_structs::AppendOnlyProof

pub struct AppendOnlyProof<H: Hasher> { /* fields omitted */ }

Proof that no leaves were deleted from the initial epoch. This means that unchanged_nodes should hash to the initial root hash and the vec of inserted is the set of leaves inserted between these epochs. If we built the tree using the nodes in inserted and the nodes in unchanged_nodes as the leaves, it should result in the final root hash.

Trait Implementations

impl<H: Clone + Hasher> Clone for AppendOnlyProof<H> where
    H::Digest: Clone,
    H::Digest: Clone, 

fn clone(&self) -> AppendOnlyProof<H>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<H: Debug + Hasher> Debug for AppendOnlyProof<H> where
    H::Digest: Debug,
    H::Digest: Debug, 

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

Formats the value using the given formatter.