Struct SubtreePath 

pub struct SubtreePath {
    pub depth: u32,
    pub slot: u32,
    pub leaf_start: u32,
    pub leaf_end: u32,
}

The deterministically-selected contiguous subtree, derived from (nonce, key_count) and agreed by both sides.

Fields

depth: u32

Depth of the subtree root below the tree root (0 = whole tree).

slot: u32

Slot index of the subtree root within its level, in 0..2^depth.

leaf_start: u32

First real leaf index covered (inclusive).

leaf_end: u32

One past the last real leaf index covered (exclusive). Always leaf_end > leaf_start, so the selection never covers zero real leaves — this is the ADR’s dead-block fix.

Implementations

impl SubtreePath

pub fn real_leaf_count(&self) -> u32

Number of real (non-padding) leaves in the selected subtree.

Trait Implementations

impl Clone for SubtreePath

fn clone(&self) -> SubtreePath

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Copy for SubtreePath

impl Debug for SubtreePath

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

Formats the value using the given formatter.

impl Eq for SubtreePath

impl PartialEq for SubtreePath

fn eq(&self, other: &SubtreePath) -> 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 StructuralPartialEq for SubtreePath