Enum ManifestNode 

pub enum ManifestNode {
    Leaf(ManifestLeaf),
    Branch(ManifestBranch),
}

Variants

Leaf(ManifestLeaf)

Branch(ManifestBranch)

Implementations

impl ManifestNode

pub fn empty() -> ManifestNode

The canonical empty-set root: a leaf with no entries.

pub fn encode(&self) -> Vec<u8>

Encode to the single canonical byte string for this logical node.

pub fn address(&self) -> ContentHash

The node’s content address — BLAKE3 of its canonical bytes.

pub fn decode(bytes: &[u8]) -> Result<ManifestNode, ManifestDecodeError>

Decode strictly.

Rejects a bad magic, an unknown version or tag, an unknown object kind, truncation, trailing bytes, out-of-order or duplicated entries, an empty branch bitmap, and — as a final backstop — any input whose re-encoding differs from the input. A node that decodes here is canonical, so its address is meaningful.

pub fn decode_addressed( bytes: &[u8], expected: &ContentHash, ) -> Result<ManifestNode, ManifestDecodeError>

Decode and verify the node addresses to expected.

pub fn leaf_entries(&self) -> &[ManifestObject]

Objects named directly by this node (empty for a branch).

Trait Implementations

impl Clone for ManifestNode

fn clone(&self) -> ManifestNode

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for ManifestNode

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

Formats the value using the given formatter.

impl Eq for ManifestNode

impl PartialEq for ManifestNode

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

Equality operator ==.

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

Inequality operator !=.

impl StructuralPartialEq for ManifestNode