Enum ExclusionProof 

pub enum ExclusionProof<K: Array, V: FixedValue, D: Digest, const N: usize> {
    KeyValue(OperationProof<D, N>, Update<K, V>),
    Commit(OperationProof<D, N>, Option<V>),
}

Proof that a key has no assigned value in the database.

When the database has active keys, exclusion is proven by showing the key falls within a span between two adjacent active keys. Otherwise exclusion is proven by showing the database contains no active keys through the most recent commit operation.

Verify using Db::verify_exclusion_proof.

Variants

KeyValue(OperationProof<D, N>, Update<K, V>)

Proves that two keys are active in the database and adjacent to each other in the key ordering. Any key falling between them (non-inclusively) can be proven excluded.

Commit(OperationProof<D, N>, Option<V>)

Proves that the database has no active keys, allowing any key to be proven excluded. Specifically, the proof establishes the most recent Commit operation has an activity floor equal to its own location, which is a necessary and sufficient condition for an empty database.

Trait Implementations

impl<K: Clone + Array, V: Clone + FixedValue, D: Clone + Digest, const N: usize> Clone for ExclusionProof<K, V, D, N>

fn clone(&self) -> ExclusionProof<K, V, D, N>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<K: Debug + Array, V: Debug + FixedValue, D: Debug + Digest, const N: usize> Debug for ExclusionProof<K, V, D, N>

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

Formats the value using the given formatter.

impl<K: PartialEq + Array, V: PartialEq + FixedValue, D: PartialEq + Digest, const N: usize> PartialEq for ExclusionProof<K, V, D, N>

fn eq(&self, other: &ExclusionProof<K, V, D, N>) -> bool

Tests for self and other values to be equal, and is used by ==.

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

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

impl<K: Eq + Array, V: Eq + FixedValue, D: Eq + Digest, const N: usize> Eq for ExclusionProof<K, V, D, N>

impl<K: Array, V: FixedValue, D: Digest, const N: usize> StructuralPartialEq for ExclusionProof<K, V, D, N>