Struct PositionAwareTree 

pub struct PositionAwareTree { /* private fields */ }

Binary Merkle tree over power-of-two leaves. Proof order: siblings from leaf level toward the root (deepest first): index 0 is the leaf’s immediate sibling, then the next level, up to the sibling below the root.

Implementations

impl PositionAwareTree

pub fn new(leaves: Vec<[u8; 32]>) -> Result<Self, MerkleError>

Pads leaves with deterministic padding digests until length is a power of two (min 1).

pub fn get_root(&self) -> [u8; 32]

pub fn get_proof(&self, index: usize) -> Result<Vec<[u8; 32]>, MerkleError>

index is into the padded leaf vector (same order as new input + padding).

Trait Implementations

impl Clone for PositionAwareTree

fn clone(&self) -> PositionAwareTree

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for PositionAwareTree

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

Formats the value using the given formatter.