Struct DerivationNode 

pub struct DerivationNode {
    pub is_valid: bool,
    pub depth: u8,
    pub epoch: u64,
    pub first_child: u32,
    pub next_sibling: u32,
    pub parent_index: u32,
}

A node in the derivation tree.

Uses a first-child / next-sibling linked list layout for O(1) insertion and efficient subtree traversal without allocation.

Fields

is_valid: bool

Whether this node is valid (not revoked).

depth: u8

Depth in the derivation tree (0 = root).

epoch: u64

Epoch at which this capability was created.

first_child: u32

Index of the first child (or u32::MAX if no children).

next_sibling: u32

Index of the next sibling (or u32::MAX if no sibling).

parent_index: u32

Cached parent index for O(1) parent lookup. u32::MAX means no parent (root node).

Implementations

impl DerivationNode

pub const fn empty() -> Self

An empty (unused) node.

pub const fn new_root(epoch: u64) -> Self

A new root node at the given epoch.

pub const fn new_child(depth: u8, epoch: u64) -> Self

A new child node at the given depth and epoch.

pub const fn has_children(&self) -> bool

Returns true if this node has children.

Trait Implementations

impl Clone for DerivationNode

fn clone(&self) -> DerivationNode

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Copy for DerivationNode

impl Debug for DerivationNode

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

Formats the value using the given formatter.

impl Default for DerivationNode

fn default() -> Self

Returns the “default value” for a type.

impl Eq for DerivationNode

impl PartialEq for DerivationNode

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

Equality operator ==.

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

Inequality operator !=.

impl StructuralPartialEq for DerivationNode