Struct akd::proof_structs::SingleAppendOnlyProof

pub struct SingleAppendOnlyProof<H: Hasher> {
    pub inserted: Vec<Node<H>>,
    pub unchanged_nodes: Vec<Node<H>>,
}

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 with the correct epoch of insertion, it should result in the final root hash.

Fields

inserted: Vec<Node<H>>

The inserted nodes & digests

unchanged_nodes: Vec<Node<H>>

The unchanged nodes & digests

Trait Implementations

impl<H: Hasher> Clone for SingleAppendOnlyProof<H>

fn clone(&self) -> Self

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<H: Debug + Hasher> Debug for SingleAppendOnlyProof<H>

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

Formats the value using the given formatter.

impl<H: PartialEq + Hasher> PartialEq<SingleAppendOnlyProof<H>> for SingleAppendOnlyProof<H>

fn eq(&self, other: &SingleAppendOnlyProof<H>) -> bool

This method tests for self and other values to be equal, and is used by ==.

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

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

impl<H: Eq + Hasher> Eq for SingleAppendOnlyProof<H>

impl<H: Hasher> StructuralEq for SingleAppendOnlyProof<H>

impl<H: Hasher> StructuralPartialEq for SingleAppendOnlyProof<H>