Struct ComposedNode

pub struct ComposedNode {
    pub path: String,
    pub attributes: IndexMap<String, Arc<Value>>,
    pub children: IndexMap<String, Arc<ComposedNode>>,
}

One node of the composed tree. Upstream calls this a post-composition node.

Children are shared through Arc: every instance that inherits a type points at the same composed sub-tree instead of a copy. A sub-tree is copied, one node at a time along the edited path, only where a path such as instance/Body edits it.

Fields

path: String

The path whose opinions started this node, upstream’s node field. A child reached through children: {"Body": "b1"} has path b1; a child copied from an inherited node keeps that node’s path. Empty for the artificial root.

attributes: IndexMap<String, Arc<Value>>

Inherited attributes first, then local ones, which win.

children: IndexMap<String, Arc<ComposedNode>>

Implementations

impl ComposedNode

pub fn descendant(self: &Arc<Self>, path: &str) -> Option<&Arc<ComposedNode>>

Follows child names separated by /, as upstream’s GetChildNodeWithPath. An empty path returns this node.

Trait Implementations

impl Clone for ComposedNode

fn clone(&self) -> ComposedNode

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for ComposedNode

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

Formats the value using the given formatter.

impl Default for ComposedNode

fn default() -> ComposedNode

Returns the “default value” for a type.

impl Drop for ComposedNode

fn drop(&mut self)

Executes the destructor for this type.

impl PartialEq for ComposedNode

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