9ad154f2654791d7b1a8b87b1034b2820773e585
The process-graph should only be concerned with GraphNodes, which may or may not be Routes. This also removes intrinsic connection information from the graph-node. Connection information is to be kept separate from the nodes. When the graph is re-calculated in the background, old information has to be retained until the new graph becomes active. Previously *new* information was already stored in the nodes while the graph is sorted, even though the new graph was not active.
Please see the Ardour web site at https://ardour.org/ for all documentation..
For information on building ardour:
https://ardour.org/development.html
Description
Languages
C++
56.5%
C
39.6%
JavaScript
1.3%
Lua
0.9%
Python
0.6%
Other
0.9%