Struct GraphExecutor 

pub struct GraphExecutor<T: Transcendental, const BUF_SIZE: usize> { /* private fields */ }

Executor for a signal graph that processes nodes in topological order.

This is a prototype that outlines the structure. In a real implementation, the executor would hold a concrete graph and iterate over its nodes.

Implementations

impl<T: Transcendental, const BUF_SIZE: usize> GraphExecutor<T, BUF_SIZE>

pub fn new() -> Self

Create a new executor from an existing graph.

pub fn process_block(&mut self) -> Result<(), Box<dyn Error>>

Process one block of audio.

This advances the clock, obtains topological order, processes each node by pulling inputs, calling appropriate processing method, and pushing outputs.

Returns

Ok(()) if processing succeeded, or an error if something went wrong.

Algorithm (conceptual)

1. Advance the clock (if the graph provides a clock source).
2. Obtain topological order (if the graph provides it).
3. For each node in order: a. Gather input data by calling pull on each input port (ActivePort trait). b. Determine node type (Source/Processor/Sink) via metadata. c. Call the appropriate processing method (generate/process/consume). d. Push output data by calling push on each output port.
4. Handle errors (disconnected ports, missing data).