Logo Search packages:      
Sourcecode: ardour version File versions  Download package

time_selection.cc

/*
    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.

    $Id: time_selection.cc,v 1.3 2005/01/15 14:51:17 pauld Exp $
*/

#include <algorithm>

#include <pbd/error.h>
#include <ardour/ardour.h>

#include "time_selection.h"

#include "i18n.h"

using namespace ARDOUR;

AudioRange&
TimeSelection::operator[] (uint32_t which)
{
      for (std::list<AudioRange>::iterator i = begin(); i != end(); ++i) {
            if ((*i).id == which) {
                  return *i;
            }
      }
      fatal << compose (_("programming error: request for non-existent audio range (%1)!"), which) << endmsg;
      /*NOTREACHED*/
      return *(new AudioRange(0,0,0)); /* keep the compiler happy; never called */
}

bool
TimeSelection::consolidate ()
{
      bool changed = false;

  restart:
      for (std::list<AudioRange>::iterator a = begin(); a != end(); ++a) {
            for (std::list<AudioRange>::iterator b = begin(); b != end(); ++b) {

                  if (&(*a) == &(*b)) {
                        continue;
                  }

                  if ((*a).coverage ((*b).start, (*b).end) != OverlapNone) {
                        (*a).start = std::min ((*a).start, (*b).start);
                        (*a).end = std::max ((*a).end, (*b).end);
                        erase (b);
                        changed = true;
                        goto restart;
                  }
            }
      }

      return changed;
}           

jack_nframes_t 
TimeSelection::start ()
{
      if (empty()) {
            return 0;
      }

      jack_nframes_t first = max_frames;

      for (std::list<AudioRange>::iterator i = begin(); i != end(); ++i) {
            if ((*i).start < first) {
                  first = (*i).start;
            }
      }
      return first;
}

jack_nframes_t 
TimeSelection::end_frame ()
{
      jack_nframes_t last = 0;

      /* XXX make this work like RegionSelection: no linear search needed */

      for (std::list<AudioRange>::iterator i = begin(); i != end(); ++i) {
            if ((*i).end > last) {
                  last = (*i).end;
            }
      }
      return last;
}

jack_nframes_t
TimeSelection::length()
{
      return end_frame() - start() + 1;
}
      

Generated by  Doxygen 1.6.0   Back to index