Struct Graph

pub struct Graph<S>
where
    S: Sample,
{ /* private fields */ }

A directed acyclic graph of connected DSP blocks.

The graph manages block storage, buffer allocation, and execution ordering. Blocks are processed in topologically sorted order to ensure dependencies are satisfied.

Implementations

impl<S> Graph<S>

where S: Sample,

pub fn new( sample_rate: f64, buffer_size: usize, num_channels: usize, ) -> Graph<S>

Create a Graph with a given sample rate, buffer size, and number of channels.

pub fn context(&self) -> &DspContext

Get the underlying DspContext used by a Graph.

pub fn get_block(&self, id: BlockId) -> Option<&BlockType<S>>

Get a reference to a block by its ID.

pub fn get_block_mut(&mut self, id: BlockId) -> Option<&mut BlockType<S>>

Get a mutable reference to a block by its ID.

pub fn add_block(&mut self, block: BlockType<S>) -> BlockId

Add an arbitrary block to the Graph.

pub fn add_output_block(&mut self) -> BlockId

Add an output block to the Graph.

pub fn connect( &mut self, from: BlockId, from_output: usize, to: BlockId, to_input: usize, )

Form a Connection between two particular blocks.

pub fn prepare_for_playback(&mut self)

Prepares the graph for audio processing.

Must be called after all blocks are added and connected, but before process_buffers. Computes execution order and pre-allocates buffers.

pub fn process_buffers(&mut self, output_buffers: &mut [&mut [S]])

Process one buffer’s worth of audio through all blocks.

Executes blocks in topologically sorted order, copying final output to the provided buffers (one per channel).