Struct Subtree

#[repr(C)]
pub struct Subtree {
    pub subtree_node_index: usize,
    pub pos_in_layer: usize,
    pub leaf_start: usize,
    pub leaf_count: usize,
    pub lower_height: usize,
    pub upper_height: usize,
}

Fields

subtree_node_index: usize

pos_in_layer: usize

leaf_start: usize

leaf_count: usize

lower_height: usize

upper_height: usize

Implementations

impl Subtree

pub fn new(leaf_index: usize, layer_number: usize, height: usize) -> Self

pub fn get_merkle_proof<const TREE_HEIGHT: usize>( &self, tree: &MerkleTree<TREE_HEIGHT>, target_leaf_relative: usize, lower_leaves: &[Leaf], cached_layer: &[Hash], ) -> Vec<Hash>

Trait Implementations

impl Clone for Subtree

fn clone(&self) -> Subtree

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for Subtree

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

Formats the value using the given formatter.

impl PartialEq for Subtree

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

fn zeroed() -> Self

Calls zeroed.

impl Copy for Subtree

impl Pod for Subtree

impl StructuralPartialEq for Subtree