Struct DspGraph

Source

pub struct DspGraph {
    pub arena: Arena<NodeRecord>,
    pub buffers: BufferPool,
    pub execution_order: Vec<NodeId>,
    pub levels: Vec<Vec<NodeId>>,
    pub output_node: Option<NodeId>,
    /* private fields */
}

Expand description

The DSP graph. Lives on the RT thread after initial construction.

Fields§

§arena: Arena<NodeRecord>§buffers: BufferPool§execution_order: Vec<NodeId>

Topologically sorted execution order. Rebuilt on structural mutations.

§levels: Vec<Vec<NodeId>>

BFS wave levels: each inner Vec contains nodes that can execute in parallel. Level[i] nodes all depend only on nodes in levels 0..i.

§output_node: Option<NodeId>

The node whose output buffer is sent to the DAC.

Implementations§

Source §

impl DspGraph

Source

pub fn new() -> Self

Source

pub fn add_node(&mut self, processor: Box<dyn DspNode>) -> Option<NodeId>

Add a node to the graph. Returns its NodeId.

Source

pub fn remove_node(&mut self, id: NodeId) -> bool

Remove a node, releasing its buffer.

Source

pub fn connect(&mut self, src: NodeId, dst: NodeId, slot: usize) -> bool

Connect src output → dst input[slot].

Source

pub fn disconnect(&mut self, dst: NodeId, slot: usize) -> bool

Disconnect dst input[slot].

Source

pub fn set_output_node(&mut self, id: NodeId)

Trait Implementations§

Source §

impl Default for DspGraph

Source §

fn default() -> Self

Returns the “default value” for a type. Read more

Auto Trait Implementations§

§

impl !UnwindSafe for DspGraph

Blanket Implementations§

Source §

impl<T> Any for T
where T: 'static + ?Sized,

Source §

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more

Source §

impl<T> Borrow<T> for T
where T: ?Sized,

Source §

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more

Source §

impl<T> BorrowMut<T> for T
where T: ?Sized,

Source §

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more

Source §

impl<T> From<T> for T

Source §

fn from(t: T) -> T

Returns the argument unchanged.

Source §

impl<T, U> Into for T
where U: From<T>,

Source §

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

Source §

impl<T> IntoEither for T

Source §

fn into_either(self, into_left: bool) -> Either<Self, Self>

Converts self into a Left variant of Either<Self, Self> if into_left is true. Converts self into a Right variant of Either<Self, Self> otherwise. Read more

Source §

fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
where F: FnOnce(&Self) -> bool,

Converts self into a Left variant of Either<Self, Self> if into_left(&self) returns true. Converts self into a Right variant of Either<Self, Self> otherwise. Read more

Source §