Enum Node 

pub enum Node {
    Scalar(String, Origin),
    Seq(Vec<Node>),
    Map(BTreeMap<String, Node>),
}

One node of a configuration tree.

Variants

Scalar(String, Origin)

A scalar, with the place it came from.

Seq(Vec<Node>)

An ordered sequence.

Map(BTreeMap<String, Node>)

A mapping, ordered by key so that a rendered tree is stable.

Implementations

impl Node

pub fn as_str(&self) -> Option<&str>

The scalar’s text, or None for a sequence or a map.

pub fn origin(&self) -> Option<&Origin>

The origin of a scalar; None for a sequence or a map, which have no single one.

pub fn get(&self, path: &str) -> Option<&Self>

Follows a dotted path — transport.mtu — through maps.

pub fn merge(&mut self, other: Self) -> Result<(), ConfigError>

Merges other into self, with other winning.

Maps merge key by key. Anything else replaces. A key spelled +name in other appends to the sequence at name instead of replacing it, and appending to something that is not a sequence is an error rather than a silent replacement — a drop-in that meant to extend a list and found a scalar has a mistake in it, and saying so is the whole point.

Errors

ConfigError::AppendToNonSeq when +name meets a non-sequence, ConfigError::TooDeep past MAX_NESTING_DEPTH.

zerodds-lint: recursion-depth 32

Trait Implementations

impl Clone for Node

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for Node

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

Formats the value using the given formatter.

impl Eq for Node

impl PartialEq for Node

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

Equality operator ==.

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

Inequality operator !=.

impl StructuralPartialEq for Node