Struct MantarayNode 

pub struct MantarayNode {
    pub obfuscation_key: [u8; 32],
    pub self_address: Option<[u8; 32]>,
    pub target_address: [u8; 32],
    pub metadata: Option<BTreeMap<String, String>>,
    pub path: Vec<u8>,
    pub forks: BTreeMap<u8, Fork>,
}

One node of the Mantaray trie. Field names mirror bee-js / bee-go.

• obfuscation_key: 32-byte XOR mask used when serializing this node. Freshly-constructed nodes use a zero key.
• self_address: chunk address of the marshaled node, populated after crate::manifest::wire::calculate_self_address / save_recursively. None means “not computed”.
• target_address: file reference at this node, or NULL_ADDRESS for pure directory nodes.
• path: edge label inherited from the parent fork’s prefix; the root has an empty path.
• forks: child edges keyed by first prefix byte (ordered by key).
• metadata: optional key/value annotations carried in the wire format; ordered by key so JSON serialization is deterministic.

Fields

obfuscation_key: [u8; 32]

32-byte XOR mask used during marshal.

self_address: Option<[u8; 32]>

Chunk address of the marshaled node, when known.

target_address: [u8; 32]

File reference at this node (32 bytes; NULL_ADDRESS = none).

metadata: Option<BTreeMap<String, String>>

Optional metadata annotations.

path: Vec<u8>

Edge label inherited from the parent fork.

forks: BTreeMap<u8, Fork>

Child edges keyed by first prefix byte.

Implementations

impl MantarayNode

pub fn new() -> Self

Empty Mantaray root.

pub fn is_null_target(&self) -> bool

True iff this node’s target_address is the null address.

pub fn determine_type(&self) -> u8

Pack the type bitfield used in this node’s outgoing fork record.

pub fn find_closest<'a>(&'a self, path: &[u8]) -> (&'a MantarayNode, Vec<u8>)

Walk down forks while path matches. Returns the deepest node reached and the bytes of path matched along the way.

pub fn find(&self, path: &[u8]) -> Option<&MantarayNode>

Return the node whose full path equals path, or None.

pub fn collect(&self) -> Vec<(Vec<u8>, &MantarayNode)>

All descendants whose target_address is non-null, with their full paths. The path is the concatenation of every fork prefix from the root down to the node.

pub fn collect_and_map(&self) -> HashMap<String, Reference>

{full_path: reference} for every leaf with a valid reference. Mirrors bee-go CollectAndMap.

pub fn add_fork( &mut self, path: &[u8], target: Option<&Reference>, metadata: Option<&BTreeMap<String, String>>, )

Insert a (path, target, metadata) entry. Long paths are chunked into chained nodes of up to MAX_PREFIX_LENGTH bytes each. Metadata is attached to the terminal node only.

Invalidates self_address on every node touched along the way; call calculate_self_address (or save_recursively) before marshaling.

pub fn remove_fork(&mut self, path: &[u8]) -> Result<(), Error>

Delete the fork rooted at path. If the removed node had children, they are re-inserted under the parent so the trie stays consistent.

Trait Implementations

impl Clone for MantarayNode

fn clone(&self) -> MantarayNode

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for MantarayNode

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

Formats the value using the given formatter.

impl Default for MantarayNode

fn default() -> Self

Returns the “default value” for a type.

impl PartialEq for MantarayNode

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

Tests for self and other values to be equal, and is used by ==.

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

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl Eq for MantarayNode

impl StructuralPartialEq for MantarayNode