Struct akd::tree_node::TreeNode

pub struct TreeNode {
    pub label: NodeLabel,
    pub last_epoch: u64,
    pub least_descendant_ep: u64,
    pub parent: NodeLabel,
    pub node_type: NodeType,
    pub left_child: Option<NodeLabel>,
    pub right_child: Option<NodeLabel>,
    pub hash: [u8; 32],
}

A TreeNode represents a generic node of a Merkle Patricia Trei with ordering. The main idea here is that the tree is changing at every epoch and that we do not need to touch the state of a node, unless it changes. The leaves of the tree represented by these nodes is supposed to allow for a user to monitor the state of a key-value pair in the past. We achieve this by including the epoch a leaf was added as part of the hash stored in it. At a later time, we may need to access older sub-trees of the tree built with these nodes. To facilitate this, we require this struct to include the last time a node was updated as well as the oldest descendant it holds.

Fields

label: NodeLabel

The binary label for this node

last_epoch: u64

The last epoch this node was updated in

least_descendant_ep: u64

The least epoch of any descendant of this node

parent: NodeLabel

The label of this node’s parent

node_type: NodeType

The type of node: leaf, root or interior.

left_child: Option<NodeLabel>

Label of the left child, None if there is none.

right_child: Option<NodeLabel>

Label of the right child, None if there is none.

hash: [u8; 32]

Hash (aka state) of the node.

Trait Implementations

impl Clone for TreeNode

fn clone(&self) -> Self

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for TreeNode

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

Formats the value using the given formatter.

impl Hash for TreeNode

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H) where
    H: Hasher, 

Feeds a slice of this type into the given Hasher.

impl PartialEq<TreeNode> for TreeNode

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

impl StructuralEq for TreeNode

impl StructuralPartialEq for TreeNode

impl Sync for TreeNode