Struct Graph 

pub struct Graph {
    pub spec_version: String,
    pub topology: Topology,
    pub lineage: Lineage,
    pub registry: CircuitRegistry,
    pub verification: Verification,
    pub revision: Revision,
    pub nodes: BTreeMap<StableId, Node>,
    pub edges: BTreeMap<StableId, Edge>,
    pub modulations: BTreeMap<StableId, Modulation>,
}

The Canonical IR Graph — The Forensic Record of Sound.

Fields

spec_version: String

topology: Topology

lineage: Lineage

registry: CircuitRegistry

verification: Verification

revision: Revision

nodes: BTreeMap<StableId, Node>

edges: BTreeMap<StableId, Edge>

modulations: BTreeMap<StableId, Modulation>

Implementations

impl Graph

pub fn new() -> Self

Create an empty graph at revision zero.

pub fn sync(&mut self)

Synchronizes legacy compatibility fields from the layered structure. Call this after deserializing or modifying layers.

pub fn squash_history(&mut self)

pub fn create_snapshot(&mut self, name: &str)

pub fn node(&self, id: &StableId) -> Option<&Node>

pub fn edge(&self, id: &StableId) -> Option<&Edge>

pub fn validate_port_ref(&self, port_ref: &PortRef) -> bool

pub fn add_node(&mut self, node: Node)

pub fn remove_node(&mut self, id: StableId)

pub fn connect( &mut self, source: PortRef, target: PortRef, ) -> Result<StableId, String>

pub fn disconnect(&mut self, edge_id: StableId) -> Result<(), String>

pub fn set_config( &mut self, node_id: StableId, key: &str, value: ConfigValue, ) -> Result<(), String>

impl Graph

pub fn apply_patch(&mut self, patch: &Patch) -> Result<(), PatchError>

pub fn diff(&self, other: &Graph) -> PatchSet

pub fn replay(patches: &[Patch]) -> Result<Self, PatchError>

pub fn replay_and_verify( patches: &[Patch], expected_hash: &Hash, ) -> Result<Self, PatchError>

Trait Implementations

impl Clone for Graph

fn clone(&self) -> Graph

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for Graph

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

Formats the value using the given formatter.

impl Default for Graph

fn default() -> Self

Returns the “default value” for a type.

impl<'de> Deserialize<'de> for Graph

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Display for Graph

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

Formats the value using the given formatter.

impl PartialEq for Graph

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

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl StructuralPartialEq for Graph