gtk2_ardour/time_selection.cc

   1 /*
   2     Copyright (C) 2003-2004 Paul Davis
   3
   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.
   8
   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.
  13
  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.
  17
  18 */
  19
  20 #include <algorithm>
  21
  22 #include "pbd/error.h"
  23 #include "ardour/ardour.h"
  24
  25 #include "time_selection.h"
  26
  27 #include "i18n.h"
  28
  29 using namespace ARDOUR;
  30 using namespace PBD;
  31
  32 AudioRange&
  33 TimeSelection::operator[] (uint32_t which)
  34 {
  35         for (std::list<AudioRange>::iterator i = begin(); i != end(); ++i) {
  36                 if ((*i).id == which) {
  37                         return *i;
  38                 }
  39         }
  40         fatal << string_compose (_("programming error: request for non-existent audio range (%1)!"), which) << endmsg;
  41         /*NOTREACHED*/
  42         return *(new AudioRange(0,0,0)); /* keep the compiler happy; never called */
  43 }
  44
  45 bool
  46 TimeSelection::consolidate ()
  47 {
  48         bool changed = false;
  49
  50   restart:
  51         for (std::list<AudioRange>::iterator a = begin(); a != end(); ++a) {
  52                 for (std::list<AudioRange>::iterator b = begin(); b != end(); ++b) {
  53
  54                         if (&(*a) == &(*b)) {
  55                                 continue;
  56                         }
  57
  58                         if ((*a).coverage ((*b).start, (*b).end) != OverlapNone) {
  59                                 (*a).start = std::min ((*a).start, (*b).start);
  60                                 (*a).end = std::max ((*a).end, (*b).end);
  61                                 erase (b);
  62                                 changed = true;
  63                                 goto restart;
  64                         }
  65                 }
  66         }
  67
  68         return changed;
  69 }
  70
  71 framepos_t
  72 TimeSelection::start ()
  73 {
  74         if (empty()) {
  75                 return 0;
  76         }
  77
  78         framepos_t first = max_framepos;
  79
  80         for (std::list<AudioRange>::iterator i = begin(); i != end(); ++i) {
  81                 if ((*i).start < first) {
  82                         first = (*i).start;
  83                 }
  84         }
  85         return first;
  86 }
  87
  88 framepos_t
  89 TimeSelection::end_frame ()
  90 {
  91         framepos_t last = 0;
  92
  93         /* XXX make this work like RegionSelection: no linear search needed */
  94
  95         for (std::list<AudioRange>::iterator i = begin(); i != end(); ++i) {
  96                 if ((*i).end > last) {
  97                         last = (*i).end;
  98                 }
  99         }
 100         return last;
 101 }
 102
 103 framecnt_t
 104 TimeSelection::length()
 105 {
 106         return end_frame() - start() + 1;
 107 }