Enum RawNode 

pub enum RawNode {
    Leaf(Scalar),
    Edges(Vec<(String, RawNode)>),
}

The raw canonical Document node: either a leaf scalar, or an ordered list of (label, child) edges that may repeat and interleave a label arbitrarily ([("b",1),("c",2),("b",3)] is representable exactly).

This is distinct from Value: Value::Object’s IndexMap can’t hold a repeated key, so its “repeated label” convention (a Value::Array under one key, per child_specs) only ever expands to a contiguous run of same-label edges. OML is the one format that must round-trip arbitrary interleaving losslessly (per its own docs: “no adjustment ever needed”), so its reader/writer (crate::oml) builds/walks a Doc through this type instead of going through Value.

Variants

Leaf(Scalar)

A leaf node holding a scalar value.

Edges(Vec<(String, RawNode)>)

An internal node holding labeled outgoing edges.

Trait Implementations

impl Clone for RawNode

fn clone(&self) -> RawNode

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for RawNode

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

Formats the value using the given formatter.

impl PartialEq for RawNode

fn eq(&self, other: &RawNode) -> 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 StructuralPartialEq for RawNode