13
0
livetrax/gtk2_ardour/route_processor_selection.cc
Paul Davis ec1ef5d6b5 remove the apparently unnecessary "ui_bind()" macro from entire source base
git-svn-id: svn://localhost/ardour2/branches/3.0@12088 d708f5d6-7413-0410-9779-e7cbd77b26cf
2012-04-25 12:58:19 +00:00

163 lines
3.3 KiB
C++

/*
Copyright (C) 2002 Paul Davis
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., 675 Mass Ave, Cambridge, MA 02139, USA.
*/
#include <algorithm>
#include <sigc++/bind.h>
#include "pbd/error.h"
#include "ardour/playlist.h"
#include "ardour/processor.h"
#include "ardour/route.h"
#include "gui_thread.h"
#include "mixer_strip.h"
#include "route_processor_selection.h"
#include "route_ui.h"
#include "i18n.h"
using namespace std;
using namespace ARDOUR;
using namespace PBD;
RouteProcessorSelection::RouteProcessorSelection()
: _no_route_change_signal (false)
{
}
RouteProcessorSelection&
RouteProcessorSelection::operator= (const RouteProcessorSelection& other)
{
if (&other != this) {
processors = other.processors;
routes = other.routes;
}
return *this;
}
bool
operator== (const RouteProcessorSelection& a, const RouteProcessorSelection& b)
{
// XXX MUST TEST PROCESSORS SOMEHOW
return a.routes == b.routes;
}
void
RouteProcessorSelection::clear ()
{
clear_processors ();
clear_routes ();
}
void
RouteProcessorSelection::clear_processors ()
{
processors.clear ();
ProcessorsChanged ();
}
void
RouteProcessorSelection::clear_routes ()
{
for (RouteUISelection::iterator i = routes.begin(); i != routes.end(); ++i) {
(*i)->set_selected (false);
}
routes.clear ();
drop_connections ();
if (!_no_route_change_signal) {
RoutesChanged ();
}
}
void
RouteProcessorSelection::add (XMLNode* node)
{
// XXX check for duplicate
processors.add (node);
ProcessorsChanged();
}
void
RouteProcessorSelection::set (XMLNode* node)
{
clear_processors ();
processors.set (node);
ProcessorsChanged ();
}
void
RouteProcessorSelection::add (RouteUI* r)
{
if (find (routes.begin(), routes.end(), r) == routes.end()) {
if (routes.insert (r).second) {
r->set_selected (true);
MixerStrip* ms = dynamic_cast<MixerStrip*> (r);
if (ms) {
ms->CatchDeletion.connect (*this, invalidator (*this), boost::bind (&RouteProcessorSelection::remove, this, _1), gui_context());
}
if (!_no_route_change_signal) {
RoutesChanged();
}
}
}
}
void
RouteProcessorSelection::remove (RouteUI* r)
{
ENSURE_GUI_THREAD (*this, &RouteProcessorSelection::remove, r);
RouteUISelection::iterator i;
if ((i = find (routes.begin(), routes.end(), r)) != routes.end()) {
routes.erase (i);
(*i)->set_selected (false);
if (!_no_route_change_signal) {
RoutesChanged ();
}
}
}
void
RouteProcessorSelection::set (RouteUI* r)
{
clear_routes ();
add (r);
}
bool
RouteProcessorSelection::selected (RouteUI* r)
{
return find (routes.begin(), routes.end(), r) != routes.end();
}
bool
RouteProcessorSelection::empty ()
{
return processors.empty () && routes.empty ();
}
void
RouteProcessorSelection::block_routes_changed (bool yn)
{
_no_route_change_signal = yn;
}