Struct GraphPartition 

pub struct GraphPartition { /* private fields */ }

Available on crate feature distributed only.

A single local partition wrapping a Graph plus its boundary ports.

GraphPartition is a thin convenience wrapper: it owns the local sub-graph and the boundary declaration, and delegates GraphPartition::compile and GraphPartition::process_cycle straight to the inner Graph. The RT-safety contract of Graph::process_cycle is therefore unchanged.

Implementations

impl GraphPartition

pub fn new(graph: Graph, boundary: Vec<BoundaryPort>) -> Self

Creates a new partition wrapping graph with the given boundary ports.

pub fn compile(&mut self, config: GraphConfig) -> Result<(), GraphError>

Compiles the inner graph (delegates to Graph::compile).

Errors

Returns GraphError::AlreadyCompiled if the graph was already compiled, or GraphError::CycleDetected if the topology contains a cycle.

pub fn process_cycle( &mut self, ctx: &mut ProcessContext, ) -> Result<(), GraphError>

Processes one audio cycle on the inner graph (delegates to Graph::process_cycle).

Errors

Returns GraphError::NotCompiled if the graph has not been compiled.

pub fn boundary(&self) -> &[BoundaryPort]

Returns the boundary ports of this partition.

pub fn graph(&self) -> &Graph

Returns a shared reference to the inner graph.

pub fn graph_mut(&mut self) -> &mut Graph

Returns a mutable reference to the inner graph.