Struct GraphDescription 

pub struct GraphDescription {
    pub nodes: Vec<NodeSpec>,
    pub edges: Vec<EdgeSpec>,
}

A parsed description of a filter graph.

Produced by parse_graph_dsl.

Fields

nodes: Vec<NodeSpec>

Unique node specifications, deduplicated by their label.

edges: Vec<EdgeSpec>

Directed edges between node labels.

Implementations

impl GraphDescription

pub fn is_empty(&self) -> bool

Returns true if the graph has no nodes.

pub fn contains_node(&self, label: &str) -> bool

Returns true if a node with the given label exists.

pub fn node(&self, label: &str) -> Option<&NodeSpec>

Look up a node by label.

Trait Implementations

impl Clone for GraphDescription

fn clone(&self) -> GraphDescription

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for GraphDescription

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

Formats the value using the given formatter.

impl PartialEq for GraphDescription

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