Struct akd::history_tree_node::HistoryTreeNode

pub struct HistoryTreeNode {
    pub label: NodeLabel,
    pub last_epoch: u64,
    pub birth_epoch: u64,
    pub parent: NodeLabel,
    pub node_type: NodeType,
}

A HistoryNode represents a generic interior node of a compressed history tree. The main idea here is that the tree is changing at every epoch and that we do not need to replicate the state of a node, unless it changes. However, in order to allow for a user to monitor the state of a key-value pair in the past, the older states also need to be stored. While the states themselves can be stored elsewhere, we need a list of epochs when this node was updated, and that is what this data structure is meant to do.

Fields

label: NodeLabel

The binary label for this node

last_epoch: u64

The last epoch this node was updated in

birth_epoch: u64

The epoch that this node was birthed in

parent: NodeLabel

The label of this node’s parent

node_type: NodeType

The type of node: leaf root or interior.

Trait Implementations

impl Clone for HistoryTreeNode

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 HistoryTreeNode

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

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for HistoryTreeNode

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

Deserialize this value from the given Serde deserializer.

impl PartialEq<HistoryTreeNode> for HistoryTreeNode

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

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

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

This method tests for !=.

impl Serialize for HistoryTreeNode

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

Serialize this value into the given Serde serializer.

impl Storable for HistoryTreeNode

type Key = NodeKey

This particular storage will have a key type

fn data_type() -> StorageType

Must return a valid storage type

fn get_id(&self) -> NodeKey

Retrieve an instance of the id of this storable. The combination of the storable’s StorageType and this id are globally unique

fn get_full_binary_key_id(key: &NodeKey) -> Vec<u8>

Retrieve the full binary version of a key (for comparisons)

fn key_from_full_binary(bin: &[u8]) -> Result<NodeKey, String>

Reformat a key from the full-binary specification

fn get_full_binary_id(&self) -> Vec<u8>

Retrieve the full binary version of a key (for comparisons)

impl Eq for HistoryTreeNode

impl StructuralEq for HistoryTreeNode

impl StructuralPartialEq for HistoryTreeNode

impl Sync for HistoryTreeNode