Struct SignalFlowGraph 

pub struct SignalFlowGraph {
    pub buses: HashMap<u64, AudioBus>,
    pub edges: Vec<SignalFlowEdge>,
    pub next_bus_id: u64,
    pub master_bus_id: u64,
    pub topology_order: Vec<u64>,
}

Fields

buses: HashMap<u64, AudioBus>

edges: Vec<SignalFlowEdge>

next_bus_id: u64

master_bus_id: u64

topology_order: Vec<u64>

Implementations

impl SignalFlowGraph

pub fn new() -> Self

pub fn create_bus(&mut self, name: String, bus_type: BusType) -> u64

pub fn connect(&mut self, from: u64, to: u64, level: f32)

pub fn disconnect(&mut self, from: u64, to: u64)

pub fn rebuild_topology(&mut self)

Kahn’s algorithm topological sort for processing order (children before parents)

pub fn get_bus(&self, id: u64) -> Option<&AudioBus>

pub fn get_bus_mut(&mut self, id: u64) -> Option<&mut AudioBus>

Trait Implementations

impl Debug for SignalFlowGraph

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.