Struct BusGraph

pub struct BusGraph {
    slots: Vec<Slot>,
    order: Vec<u64>,
    main: u64,
    have_main: bool,
}

Bus routing + per-bus filter state, rebuilt when the bus set changes.

Fields

slots: Vec<Slot>

order: Vec<u64>

main: u64

have_main: bool

Implementations

impl BusGraph

pub fn new() -> Self

pub fn sync(&mut self, project: &Project)

Rebuild for project (cheap when nothing changed). Cycles fall back to routing into Main.

pub fn order(&self) -> Vec<u64>

Buses in evaluation order (leaves first, Main last).

pub fn order_ref(&self) -> &[u64]

The same order without the allocation, for the mixer’s per-block loop.

pub fn begin(&mut self, frames: usize)

Zero every bus buffer for a new block of frames frames.

pub fn buffer(&mut self, bus: u64, frames: usize) -> &mut [f32]

Scratch buffer for a bus (created on demand, zeroed for the block).

pub fn flush(&mut self, bus: &Bus, t: f64, out: &mut [f32])

Run one bus’s filters + gain/pan/mono and add the result into its output bus (or out for Main).

pub fn meter(&self, bus: u64) -> (f32, f32)

Peak level (L, R) of the last block, for the mixer meters.

Trait Implementations

impl Default for BusGraph

fn default() -> BusGraph

Returns the “default value” for a type.