Struct GraphBuilder 

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

Mutable builder for an immutable signal graph.

Implementations

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

pub fn new() -> Self

Create a new empty graph builder.

pub fn add_node(&mut self, type_name: &str, params: &Params) -> usize

Add a node by type name.

Returns the index of the newly added node.

pub fn add_node_with_id( &mut self, type_name: &str, params: &Params, id: u32, ) -> usize

Add a node with an explicit NodeId.

pub fn add_node_with_name( &mut self, type_name: &str, params: &Params, id: u32, name: String, ) -> usize

Add a node with an explicit NodeId and a human-readable name (typically sourced from the JSON name field). The name becomes the program/anchor name in the compiled graph, used by SetParameter routing.

pub fn add_routing_entry( &mut self, idx: usize, from: usize, to: usize, gain: f32, )

Store a routing matrix entry to be applied at build time.

pub fn add_resource(&mut self, resource: GraphResource)

Register a named resource (tape loop, buffer, etc.).

pub fn node_count(&self) -> usize

Number of nodes added to the builder so far.

pub fn set_sample_rate(&mut self, sr: f32)

Set the sample rate for this builder.

pub fn set_parent_ref(&mut self, parent: ActorRef<CommandEnum>)

Set the parent RackCase actor reference (Graph → parent ClockTick).

pub fn connect_signal( &mut self, from_node: usize, from_port: usize, to_node: usize, to_port: usize, )

Connect signal ports.

pub fn connect_control( &mut self, from_node: usize, from_port: usize, to_node: usize, to_port: usize, )

Connect control ports (modulation values).

pub fn connect_clock( &mut self, from_node: usize, from_port: usize, to_node: usize, to_port: usize, )

Connect clock ports (timing events).

pub fn connect_feedback( &mut self, from_node: usize, from_port: usize, to_node: usize, to_port: usize, )

Connect feedback ports (delay lines, state carryover).

pub fn build_ir(self, registry: &Registry<T>) -> Result<GraphIr, BuildError>

Build a rill_lang::graph_ir::GraphIr using the built-in Registry.

This is the new execution path. It looks up each node type in the registry, constructs placeholder IRs, and performs topological sort. Actual compilation to executable programs happens in a future phase.

pub fn ast_from_def( &self, registry: &Registry<T>, ) -> Result<Program, BuildError>

Convert the graph to an rill-lang AST Program.

Each graph node becomes an Expr::Apply with parameters ordered according to the builtin’s BuiltinSig::param_names. Nodes are chained via BinOp::Seq according to their signal connections.

Only simple chain topologies are supported (fan-out/fan-in will return BuildError::UnsupportedTopology).

pub fn compile_def<const BUF: usize>( &self, registry: &Registry<T>, sample_rate: f32, ) -> Result<CompiledGraphEngine<T, BUF>, BuildError>

Compile directly from the graph definition to a CompiledGraphEngine.

Calls ast_from_def followed by rill-lang compilation.

Trait Implementations

impl<T: Transcendental, const BUF_SIZE: usize> Default for GraphBuilder<T, BUF_SIZE>

fn default() -> Self

Returns the “default value” for a type.