Fix name and a comment.
authorCarl Hetherington <carl@carlh.net>
Mon, 7 Nov 2011 22:39:16 +0000 (22:39 +0000)
committerCarl Hetherington <carl@carlh.net>
Mon, 7 Nov 2011 22:39:16 +0000 (22:39 +0000)
git-svn-id: svn://localhost/ardour2/branches/3.0@10483 d708f5d6-7413-0410-9779-e7cbd77b26cf

libs/ardour/ardour/route_dag.h
libs/ardour/route_dag.cc
libs/ardour/session.cc

index d90fb8676fa4de5c6246a0dbb75368fc6fb21831..c75b5d36d6149f3975cce728cc76e69ce5a5fc87 100644 (file)
@@ -47,7 +47,7 @@ private:
        EdgeMap _to_from;
 };
 
-boost::shared_ptr<RouteList> topographical_sort (
+boost::shared_ptr<RouteList> topological_sort (
        boost::shared_ptr<RouteList>,
        DAGEdges
        );
index ec1bc721276d7a59a212151bfc7bf2ad7f74f642..9c69fb35dbd22ff8238b2e50e3d6a3588de69cab 100644 (file)
@@ -148,7 +148,7 @@ struct RouteRecEnabledComparator
 
                
 boost::shared_ptr<RouteList>
-ARDOUR::topographical_sort (
+ARDOUR::topological_sort (
        boost::shared_ptr<RouteList> routes,
        DAGEdges edges
        )
@@ -165,7 +165,10 @@ ARDOUR::topographical_sort (
                }
        }
 
-       /* Sort the initial queue so that non-rec-enabled routes are run first */
+       /* Sort the initial queue so that non-rec-enabled routes are run first.
+          This is so that routes can record things coming from other routes
+          via external connections.
+       */
        queue.sort (RouteRecEnabledComparator ());
 
        /* Do the sort: algorithm is Kahn's from Wikipedia.
index a5e6fca564d2a9a34b757525249354898390e9cf..f901de87cd25be030b52ca64960382fc59994551 100644 (file)
@@ -1347,7 +1347,7 @@ Session::resort_routes_using (boost::shared_ptr<RouteList> r)
                trace_terminal (*i, *i);
        }
 
-       boost::shared_ptr<RouteList> sorted_routes = topographical_sort (r, edges);
+       boost::shared_ptr<RouteList> sorted_routes = topological_sort (r, edges);
        route_graph->rechain (sorted_routes);
 
 #ifndef NDEBUG