Struct ergotree_interpreter::sigma_protocol::unproven_tree::NodePosition

pub struct NodePosition {
    pub positions: Vec<usize>,
}

Data type which encodes position of a node in a tree.

Position is encoded like following (the example provided is for CTHRESHOLD(2, Seq(pk1, pk2, pk3 && pk4)) :

r#“ 0 / |
/ |
0-0 0-1 0-2 /| / | / | / | 0-2-0 0-2-1 “#;

So a hint associated with pk1 has a position “0-0”, pk4 - “0-2-1” .

Please note that “0” prefix is for a crypto tree. There are several kinds of trees during evaluation. Initial mixed tree (ergoTree) would have another prefix.

Fields

positions: Vec<usize>

positions from root (inclusive) in top-down order

Implementations

impl NodePosition

pub fn crypto_tree_prefix() -> Self

Prefix of crypto tree root

pub fn child(&self, child_idx: usize) -> NodePosition

Child position

Trait Implementations

impl Clone for NodePosition

fn clone(&self) -> NodePosition

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for NodePosition

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

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for NodePosition

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl PartialEq<NodePosition> for NodePosition

fn eq(&self, other: &NodePosition) -> bool

This method tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

This method tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl Serialize for NodePosition

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

Serialize this value into the given Serde serializer.

impl Eq for NodePosition

impl StructuralEq for NodePosition

impl StructuralPartialEq for NodePosition