2 Copyright (C) 2002 Paul Davis
4 This program is free software; you can redistribute it and/or modify
5 it under the terms of the GNU General Public License as published by
6 the Free Software Foundation; either version 2 of the License, or
7 (at your option) any later version.
9 This program is distributed in the hope that it will be useful,
10 but WITHOUT ANY WARRANTY; without even the implied warranty of
11 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
12 GNU General Public License for more details.
14 You should have received a copy of the GNU General Public License
15 along with this program; if not, write to the Free Software
16 Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
22 #include <sigc++/bind.h>
23 #include <pbd/error.h>
25 #include <ardour/playlist.h>
26 #include <ardour/redirect.h>
27 #include <ardour/route.h>
29 #include "route_redirect_selection.h"
33 using namespace ARDOUR;
37 RouteRedirectSelection&
38 RouteRedirectSelection::operator= (const RouteRedirectSelection& other)
41 redirects = other.redirects;
42 routes = other.routes;
48 operator== (const RouteRedirectSelection& a, const RouteRedirectSelection& b)
50 return a.redirects == b.redirects &&
55 RouteRedirectSelection::clear ()
62 RouteRedirectSelection::clear_redirects ()
64 for (RedirectSelection::iterator i = redirects.begin(); i != redirects.end(); ) {
65 RedirectSelection::iterator tmp;
80 RouteRedirectSelection::clear_routes ()
87 RouteRedirectSelection::add (Redirect* r)
89 if (find (redirects.begin(), redirects.end(), r) == redirects.end()) {
90 redirects.push_back (r);
92 void (RouteRedirectSelection::*pmf)(Redirect*) = &RouteRedirectSelection::remove;
93 r->GoingAway.connect (mem_fun(*this, pmf));
100 RouteRedirectSelection::add (const vector<Redirect*>& rlist)
102 bool changed = false;
104 for (vector<Redirect*>::const_iterator i = rlist.begin(); i != rlist.end(); ++i) {
105 if (find (redirects.begin(), redirects.end(), *i) == redirects.end()) {
106 redirects.push_back (*i);
108 void (RouteRedirectSelection::*pmf)(Redirect*) = &RouteRedirectSelection::remove;
109 (*i)->GoingAway.connect (mem_fun(*this, pmf));
120 RouteRedirectSelection::remove (Redirect* r)
122 list<Redirect*>::iterator i;
123 if ((i = find (redirects.begin(), redirects.end(), r)) != redirects.end()) {
130 RouteRedirectSelection::set (Redirect *r)
137 RouteRedirectSelection::set (const vector<Redirect*>& rlist)
144 RouteRedirectSelection::add (Route* r)
146 if (find (routes.begin(), routes.end(), r) == routes.end()) {
147 routes.push_back (r);
149 void (RouteRedirectSelection::*pmf)(Route*) = &RouteRedirectSelection::remove;
150 r->GoingAway.connect (bind (mem_fun(*this, pmf), r));
157 RouteRedirectSelection::remove (Route* r)
159 list<Route*>::iterator i;
160 if ((i = find (routes.begin(), routes.end(), r)) != routes.end()) {
167 RouteRedirectSelection::set (Route *r)
174 RouteRedirectSelection::selected (Route* ms)
176 return find (routes.begin(), routes.end(), ms) != routes.end();
180 RouteRedirectSelection::empty ()
182 return redirects.empty () && routes.empty ();