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.
21 #include <sigc++/bind.h>
22 #include <pbd/error.h>
24 #include <ardour/playlist.h>
25 #include <ardour/redirect.h>
26 #include <ardour/route.h>
28 #include "route_redirect_selection.h"
32 using namespace ARDOUR
;
36 RouteRedirectSelection
&
37 RouteRedirectSelection::operator= (const RouteRedirectSelection
& other
)
40 redirects
= other
.redirects
;
41 routes
= other
.routes
;
47 operator== (const RouteRedirectSelection
& a
, const RouteRedirectSelection
& b
)
49 return a
.redirects
== b
.redirects
&&
54 RouteRedirectSelection::clear ()
61 RouteRedirectSelection::clear_redirects ()
68 RouteRedirectSelection::clear_routes ()
75 RouteRedirectSelection::add (boost::shared_ptr
<Redirect
> r
)
77 if (find (redirects
.begin(), redirects
.end(), r
) == redirects
.end()) {
78 redirects
.push_back (r
);
80 // XXX SHAREDPTR FIXME
81 // void (RouteRedirectSelection::*pmf)(Redirect*) = &RouteRedirectSelection::remove;
82 // r->GoingAway.connect (mem_fun(*this, pmf));
89 RouteRedirectSelection::add (const vector
<boost::shared_ptr
<Redirect
> >& rlist
)
93 for (vector
<boost::shared_ptr
<Redirect
> >::const_iterator i
= rlist
.begin(); i
!= rlist
.end(); ++i
) {
94 if (find (redirects
.begin(), redirects
.end(), *i
) == redirects
.end()) {
95 redirects
.push_back (*i
);
97 // XXX SHAREDPTR FIXME
99 //void (RouteRedirectSelection::*pmf)(Redirect*) = &RouteRedirectSelection::remove;
100 // (*i)->GoingAway.connect (mem_fun(*this, pmf));
111 RouteRedirectSelection::remove (boost::shared_ptr
<Redirect
> r
)
113 list
<boost::shared_ptr
<Redirect
> >::iterator i
;
114 if ((i
= find (redirects
.begin(), redirects
.end(), r
)) != redirects
.end()) {
121 RouteRedirectSelection::set (boost::shared_ptr
<Redirect
> r
)
128 RouteRedirectSelection::set (const vector
<boost::shared_ptr
<Redirect
> >& rlist
)
135 RouteRedirectSelection::add (boost::shared_ptr
<Route
> r
)
137 if (find (routes
.begin(), routes
.end(), r
) == routes
.end()) {
138 routes
.push_back (r
);
140 // XXX SHAREDPTR FIXME
141 // void (RouteRedirectSelection::*pmf)(Route*) = &RouteRedirectSelection::remove;
142 // r->GoingAway.connect (bind (mem_fun(*this, pmf), r));
149 RouteRedirectSelection::remove (boost::shared_ptr
<Route
> r
)
151 list
<boost::shared_ptr
<Route
> >::iterator i
;
152 if ((i
= find (routes
.begin(), routes
.end(), r
)) != routes
.end()) {
159 RouteRedirectSelection::set (boost::shared_ptr
<Route
> r
)
166 RouteRedirectSelection::selected (boost::shared_ptr
<Route
> r
)
168 return find (routes
.begin(), routes
.end(), r
) != routes
.end();
172 RouteRedirectSelection::empty ()
174 return redirects
.empty () && routes
.empty ();