Struct RadixProof 

pub struct RadixProof<V, const KEY_BYTES: usize> {
    pub term_depth: u32,
    pub siblings: Vec<(u32, [u8; 32])>,
    pub terminal: RadixTerminal<V, KEY_BYTES>,
}

A compact proof of (non-)membership of a single key in a RadixMap.

Fields

term_depth: u32

Depth of the terminal node = number of branch levels on q’s path.

siblings: Vec<(u32, [u8; 32])>

Non-empty co-path siblings, (level, hash), strictly ascending by level, all < term_depth. Absent levels are the EMPTY constant.

terminal: RadixTerminal<V, KEY_BYTES>

The node q’s walk terminates on.

Trait Implementations

impl<V: Clone, const KEY_BYTES: usize> Clone for RadixProof<V, KEY_BYTES>

fn clone(&self) -> RadixProof<V, KEY_BYTES>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<V: Debug, const KEY_BYTES: usize> Debug for RadixProof<V, KEY_BYTES>

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

Formats the value using the given formatter.

impl<V: PartialEq, const KEY_BYTES: usize> PartialEq for RadixProof<V, KEY_BYTES>

fn eq(&self, other: &RadixProof<V, KEY_BYTES>) -> 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<V: Eq, const KEY_BYTES: usize> Eq for RadixProof<V, KEY_BYTES>

impl<V, const KEY_BYTES: usize> StructuralPartialEq for RadixProof<V, KEY_BYTES>