13
0
livetrax/gtk2_ardour/time_selection.cc

128 lines
2.7 KiB
C++

/*
Copyright (C) 2003-2004 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 "pbd/error.h"
#include "ardour/types.h"
#include "time_selection.h"
#include "pbd/i18n.h"
using namespace ARDOUR;
using namespace PBD;
TimelineRange&
TimeSelection::operator[] (uint32_t which)
{
for (std::list<TimelineRange>::iterator i = begin(); i != end(); ++i) {
if ((*i).id == which) {
return *i;
}
}
fatal << string_compose (_("programming error: request for non-existent audio range (%1)!"), which) << endmsg;
abort(); /*NOTREACHED*/
return *(new ARDOUR::TimelineRange(timepos_t(),timepos_t(), 0)); /* keep the compiler happy; never called */
}
bool
TimeSelection::consolidate ()
{
bool changed = false;
restart:
for (std::list<TimelineRange>::iterator a = begin(); a != end(); ++a) {
for (std::list<TimelineRange>::iterator b = begin(); b != end(); ++b) {
if (&(*a) == &(*b)) {
continue;
}
if (a->coverage (b->start(), b->end()) != Temporal::OverlapNone) {
a->set_start (std::min (a->start(), b->start()));
a->set_end (std::max (a->end(), b->end()));
erase (b);
changed = true;
goto restart;
}
}
}
return changed;
}
samplepos_t
TimeSelection::start_sample () const
{
return start_time().samples ();
}
samplepos_t
TimeSelection::end_sample () const
{
return end_time().samples ();
}
samplecnt_t
TimeSelection::length_samples() const
{
return length().samples();
}
timepos_t
TimeSelection::start_time () const
{
if (empty()) {
return timepos_t();
}
timepos_t first = timepos_t::max (front().start().time_domain());
for (std::list<TimelineRange>::const_iterator i = begin(); i != end(); ++i) {
if ((*i).start() < first) {
first = (*i).start();
}
}
return first;
}
timepos_t
TimeSelection::end_time() const
{
timepos_t last;
for (std::list<TimelineRange>::const_iterator i = begin(); i != end(); ++i) {
if ((*i).end() > last) {
last = (*i).end();
}
}
return last;
}
timecnt_t
TimeSelection::length() const
{
if (empty()) {
return timecnt_t();
}
return start_time().distance (end_time());
}