summaryrefslogtreecommitdiff
path: root/libs/ardour/ardour/route_graph.h
blob: b1041242dcb783ee9a7ac59ff4f42f6c93765a84 (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
/*
 * Copyright (C) 2015-2016 Robin Gareus <robin@gareus.org>
 *
 * This program is free software; you can redistribute it and/or modify
 * it under the terms of the GNU General Public License as published by
 * the Free Software Foundation; either version 2 of the License, or
 * (at your option) any later version.
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License along
 * with this program; if not, write to the Free Software Foundation, Inc.,
 * 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
 */

#ifndef __ardour_route_graph_h__
#define __ardour_route_graph_h__

#include <map>
#include <set>

namespace ARDOUR {

typedef boost::shared_ptr<Route> GraphVertex;

/** A list of edges for a directed graph for routes.
 *
 *  It keeps the same data in a few different ways, with add() adding edges
 *  to all different representations, remove() removing similarly, and the
 *  lookup method using whichever representation is most efficient for
 *  that particular lookup.
 *
 *  This may be a premature optimisation...
 */
class LIBARDOUR_API GraphEdges
{
public:
	typedef std::map<GraphVertex, std::set<GraphVertex> > EdgeMap;

	void add (GraphVertex from, GraphVertex to, bool via_sends_only);
	bool has (GraphVertex from, GraphVertex to, bool* via_sends_only);
	bool feeds (GraphVertex from, GraphVertex to);
	std::set<GraphVertex> from (GraphVertex r) const;
	void remove (GraphVertex from, GraphVertex to);
	bool has_none_to (GraphVertex to) const;
	bool empty () const;
	void dump () const;

private:
	void insert (EdgeMap& e, GraphVertex a, GraphVertex b);

	typedef std::multimap<GraphVertex, std::pair<GraphVertex, bool> > EdgeMapWithSends;

	EdgeMapWithSends::iterator find_in_from_to_with_sends (GraphVertex, GraphVertex);
	EdgeMapWithSends::iterator find_recursively_in_from_to_with_sends (GraphVertex, GraphVertex);

	/** map of edges with from as `first' and to as `second' */
	EdgeMap _from_to;
	/** map of the same edges with to as `first' and from as `second' */
	EdgeMap _to_from;
	/** map of edges with via-sends information; first part of the map is
	    the `from' vertex, second is the `to' vertex and a flag which is
	    true if the edge is via a send only.
	*/
	EdgeMapWithSends _from_to_with_sends;
};

boost::shared_ptr<RouteList> topological_sort (
	boost::shared_ptr<RouteList>,
	GraphEdges
	);

}

#endif