Struct CNodeCap 

pub struct CNodeCap {
    pub size_log: u8,
    pub slots: SparseList<CapHashOrRef, MAX_CNODE_SLOTS>,
}

Fields

size_log: u8

slots: SparseList<CapHashOrRef, MAX_CNODE_SLOTS>

Sparse slot table keyed by slot index. Missing keys are absent slots (contribute zero_hash to the merkle root). The merkle tree is always size MAX_CNODE_SLOTS = 2^16; size_log bounds the addressable range.

Implementations

impl CNodeCap

pub fn new(size_log: u8) -> Result<Self, CapError>

Construct an empty cnode of 2^size_log slots. Rejects size_log > 16.

pub fn capacity(&self) -> u64

Number of slots in the cnode (2^size_log).

pub fn get(&self, slot: SlotIdx) -> Option<CapHashOrRef>

Look up a slot by index. Returns None for empty (unmaterialized) slots; returns the materialized CapHashOrRef otherwise.

For a MissingOr::Missing(_) placeholder slot (used when a subtree was loaded by hash without contents), this returns None — callers needing to distinguish “absent” from “missing placeholder” should inspect self.slots.get(...) directly.

pub fn set( &mut self, slot: SlotIdx, target: Option<CapHashOrRef>, ) -> Result<Option<CapHashOrRef>, CapError>

Bind slot to target, or clear the binding if target is None. Rejects slot indices outside the cnode’s 2^size_log range. Returns the prior materialized target at slot, if any.

pub fn take(&mut self, slot: SlotIdx) -> Result<Option<CapHashOrRef>, CapError>

Take the binding at slot, leaving the slot empty. Returns the prior target (or None if the slot was already empty).

pub fn remove( &mut self, slot: SlotIdx, ) -> Result<Option<CapHashOrRef>, CapError>

Alias of set(slot, None).

Trait Implementations

impl Clone for CNodeCap

fn clone(&self) -> CNodeCap

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for CNodeCap

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

Formats the value using the given formatter.

impl HashTreeRoot for CNodeCap

fn hash_tree_root<__D: Digest<OutputSize = U32>>(&self) -> [u8; 32]

Compute the hash tree root using D as the underlying hash.