Struct indexed_merkle_tree::InnerNode

pub struct InnerNode {
    pub hash: String,
    pub is_left_sibling: bool,
    pub left: Arc<Node>,
    pub right: Arc<Node>,
}

Represents an inner node in the indexed Merkle Tree.

This structure is used for non-leaf nodes in the tree, containing references to its left and right children along with its own hash value. There is no difference between inner nodes of an indexed Merkle Tree and a classic Merkle Tree.

Fields:

• hash: The hash of the current node, derived from its children.
• is_left_sibling: Indicates whether this node is a left child of its parent.
• left: A reference-counted pointer to the left child node.
• right: A reference-counted pointer to the right child node.

Fields

hash: String

is_left_sibling: bool

left: Arc<Node>

right: Arc<Node>

Trait Implementations

impl Clone for InnerNode

fn clone(&self) -> InnerNode

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for InnerNode

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

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for InnerNode

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Serialize for InnerNode

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.