Struct NodeGraph 

pub struct NodeGraph {
    pub nodes: Vec<(String, Node)>,
}

nodes = { name = { ... }; ... }

Fields

nodes: Vec<(String, Node)>

Insertion order preserved (BTreeMap would reorder alphabetically, which is fine for lookup but wrong for any diagnostic that lists nodes “in the order the author wrote them”).

Implementations

impl NodeGraph

pub fn single(block: PathBuf) -> Self

The one-node graph block = "..."; desugars to.

pub fn get(&self, name: &str) -> Option<&Node>

Look up a node by name.

Trait Implementations

impl Clone for NodeGraph

fn clone(&self) -> NodeGraph

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for NodeGraph

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

Formats the value using the given formatter.

impl Default for NodeGraph

fn default() -> NodeGraph

Returns the “default value” for a type.

impl PartialEq for NodeGraph

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

Equality operator ==.

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

Inequality operator !=.

impl StructuralPartialEq for NodeGraph