Node trait for tree structure

help
21

The way we make it work is by separating the user facing objects (implementing the AudioNode trait) and the actual graph structure (which contains objects implementing the AudioProcessor trait)

The AudioNode::connect method simply sends an asynchronous control message to the audio render thread. It does not modify the graph in place.

The audio render thread receives these messages and applies them to the graph. The graph looks like this (simplified):

struct AudioGraph {
    nodes: HashMap<u64, RefCell<Box<dyn AudioProcessor>>>,
    edges: HashSet<(u64, u64)>,
}

Don't model your graph with Rcs and RefCells, you will enter a world of pain.
Use an established graph library, or roll your own so you can mix in your application requirements

1 Like
22

Thanks all of you for your answers!

No I know I need to change my idea of the implementation!

23

This topic was automatically closed 90 days after the last reply. We invite you to open a new topic if you have further questions or comments.