Module akd::tree_node

The implementation of a node for a history patricia tree

Structs

• NodeKey
  Wraps the label with which to find a node in storage.
• TreeNode
  A TreeNode represents a generic node of a sparse merkle tree.
• TreeNodeWithPreviousValue
  Represents a TreeNode with its current state and potential future state. Depending on the epoch which the Directory believes is the “most current” version, we may need to load a slightly older version of the tree node. This is because we can’t guarantee that a “publish” operation is globally atomic at the storage layer, however we do assume record-level atomicity. This means that some records may be updated to “future” values, and therefore we might need to temporarily read their previous values.

Enums

• TreeNodeType
  There are three types of nodes: root, leaf and interior. This enum is used to mark the type of a TreeNode.