1 /* This file is part of Evoral.
2 * Copyright (C) 2008 David Robillard <http://drobilla.net>
3 * Copyright (C) 2000-2008 Paul Davis
5 * Evoral is free software; you can redistribute it and/or modify it under the
6 * terms of the GNU General Public License as published by the Free Software
7 * Foundation; either version 2 of the License, or (at your option) any later
10 * Evoral is distributed in the hope that it will be useful, but WITHOUT ANY
11 * WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS
12 * FOR A PARTICULAR PURPOSE. See the GNU General Public License for details.
14 * You should have received a copy of the GNU General Public License along
15 * with this program; if not, write to the Free Software Foundation, Inc.,
16 * 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
23 #include "evoral/ControlList.hpp"
24 #include "evoral/Curve.hpp"
31 inline bool event_time_less_than (ControlEvent* a, ControlEvent* b)
33 return a->when < b->when;
37 ControlList::ControlList (const Parameter& id)
39 , _interpolation(Linear)
43 _changed_when_thawed = false;
46 _max_xval = 0; // means "no limit"
48 _lookup_cache.left = -1;
49 _lookup_cache.range.first = _events.end();
50 _search_cache.left = -1;
51 _search_cache.first = _events.end();
52 _sort_pending = false;
55 ControlList::ControlList (const ControlList& other)
56 : _parameter(other._parameter)
57 , _interpolation(Linear)
61 _changed_when_thawed = false;
62 _min_yval = other._min_yval;
63 _max_yval = other._max_yval;
64 _max_xval = other._max_xval;
65 _default_value = other._default_value;
66 _lookup_cache.range.first = _events.end();
67 _search_cache.first = _events.end();
68 _sort_pending = false;
70 for (const_iterator i = other._events.begin(); i != other._events.end(); ++i) {
71 _events.push_back (new ControlEvent (**i));
77 ControlList::ControlList (const ControlList& other, double start, double end)
78 : _parameter(other._parameter)
79 , _interpolation(Linear)
83 _changed_when_thawed = false;
84 _min_yval = other._min_yval;
85 _max_yval = other._max_yval;
86 _max_xval = other._max_xval;
87 _default_value = other._default_value;
88 _lookup_cache.range.first = _events.end();
89 _search_cache.first = _events.end();
90 _sort_pending = false;
92 /* now grab the relevant points, and shift them back if necessary */
94 boost::shared_ptr<ControlList> section = const_cast<ControlList*>(&other)->copy (start, end);
96 if (!section->empty()) {
97 for (iterator i = section->begin(); i != section->end(); ++i) {
98 _events.push_back (new ControlEvent ((*i)->when, (*i)->value));
105 ControlList::~ControlList()
107 for (EventList::iterator x = _events.begin(); x != _events.end(); ++x) {
111 for (list<NascentInfo*>::iterator n = nascent.begin(); n != nascent.end(); ++n) {
112 for (EventList::iterator x = (*n)->events.begin(); x != (*n)->events.end(); ++x) {
121 boost::shared_ptr<ControlList>
122 ControlList::create(Parameter id)
124 return boost::shared_ptr<ControlList>(new ControlList(id));
128 ControlList::operator== (const ControlList& other)
130 return _events == other._events;
134 ControlList::operator= (const ControlList& other)
136 if (this != &other) {
140 for (const_iterator i = other._events.begin(); i != other._events.end(); ++i) {
141 _events.push_back (new ControlEvent (**i));
144 _min_yval = other._min_yval;
145 _max_yval = other._max_yval;
146 _max_xval = other._max_xval;
147 _default_value = other._default_value;
150 maybe_signal_changed ();
157 ControlList::create_curve()
159 _curve = new Curve(*this);
163 ControlList::destroy_curve()
170 ControlList::maybe_signal_changed ()
175 _changed_when_thawed = true;
180 ControlList::clear ()
183 Glib::Mutex::Lock lm (_lock);
188 maybe_signal_changed ();
192 ControlList::x_scale (double factor)
194 Glib::Mutex::Lock lm (_lock);
199 ControlList::extend_to (double when)
201 Glib::Mutex::Lock lm (_lock);
202 if (_events.empty() || _events.back()->when == when) {
205 double factor = when / _events.back()->when;
211 ControlList::_x_scale (double factor)
213 for (iterator i = _events.begin(); i != _events.end(); ++i) {
214 (*i)->when = floor ((*i)->when * factor);
221 ControlList::write_pass_finished (double when)
223 merge_nascent (when);
227 struct ControlEventTimeComparator {
228 bool operator() (ControlEvent* a, ControlEvent* b) {
229 return a->when < b->when;
234 ControlList::merge_nascent (double when)
237 Glib::Mutex::Lock lm (_lock);
239 if (nascent.empty()) {
243 for (list<NascentInfo*>::iterator n = nascent.begin(); n != nascent.end(); ++n) {
245 NascentInfo* ninfo = *n;
246 EventList& nascent_events (ninfo->events);
247 bool need_adjacent_start_clamp;
248 bool need_adjacent_end_clamp;
250 if (nascent_events.empty()) {
255 nascent_events.sort (ControlEventTimeComparator ());
257 if (ninfo->start_time < 0.0) {
258 ninfo->start_time = nascent_events.front()->when;
261 if (ninfo->end_time < 0.0) {
262 ninfo->end_time = when;
265 bool preexisting = !_events.empty();
269 _events = nascent_events;
271 } else if (ninfo->end_time < _events.front()->when) {
273 /* all points in nascent are before the first existing point */
275 _events.insert (_events.begin(), nascent_events.begin(), nascent_events.end());
277 } else if (ninfo->start_time > _events.back()->when) {
279 /* all points in nascent are after the last existing point */
281 _events.insert (_events.end(), nascent_events.begin(), nascent_events.end());
285 /* find the range that overaps with nascent events,
286 and insert the contents of nascent events.
290 iterator range_begin = _events.end();
291 iterator range_end = _events.end();
292 double end_value = unlocked_eval (ninfo->end_time);
293 double start_value = unlocked_eval (ninfo->start_time - 1);
295 need_adjacent_end_clamp = true;
296 need_adjacent_start_clamp = true;
298 for (i = _events.begin(); i != _events.end(); ++i) {
300 if ((*i)->when == ninfo->start_time) {
301 /* existing point at same time, remove it
302 and the consider the next point instead.
304 i = _events.erase (i);
306 if (i == _events.end()) {
310 if (range_begin == _events.end()) {
312 need_adjacent_start_clamp = false;
314 need_adjacent_end_clamp = false;
317 if ((*i)->when > ninfo->end_time) {
322 } else if ((*i)->when > ninfo->start_time) {
324 if (range_begin == _events.end()) {
328 if ((*i)->when > ninfo->end_time) {
335 assert (range_begin != _events.end());
337 if (range_begin != _events.begin()) {
338 /* clamp point before */
339 if (need_adjacent_start_clamp) {
340 _events.insert (range_begin, new ControlEvent (ninfo->start_time, start_value));
344 _events.insert (range_begin, nascent_events.begin(), nascent_events.end());
346 if (range_end != _events.end()) {
347 /* clamp point after */
348 if (need_adjacent_end_clamp) {
349 _events.insert (range_begin, new ControlEvent (ninfo->end_time, end_value));
353 _events.erase (range_begin, range_end);
362 nascent.push_back (new NascentInfo (false));
366 maybe_signal_changed ();
370 ControlList::rt_add (double when, double value)
372 // this is for automation recording
374 if (touch_enabled() && !touching()) {
378 //cerr << "RT: alist " << this << " add " << value << " @ " << when << endl;
380 Glib::Mutex::Lock lm (_lock, Glib::TRY_LOCK);
383 assert (!nascent.empty());
384 /* we don't worry about adding events out of time order as we will
385 sort them in merge_nascent.
387 nascent.back()->events.push_back (new ControlEvent (when, value));
392 ControlList::fast_simple_add (double when, double value)
394 /* to be used only for loading pre-sorted data from saved state */
395 _events.insert (_events.end(), new ControlEvent (when, value));
396 assert(_events.back());
400 ControlList::add (double when, double value)
402 /* this is for making changes from some kind of user interface or
403 control surface (GUI, MIDI, OSC etc)
406 if (!clamp_value (when, value)) {
411 Glib::Mutex::Lock lm (_lock);
412 ControlEvent cp (when, 0.0f);
414 iterator insertion_point;
416 for (insertion_point = lower_bound (_events.begin(), _events.end(), &cp, time_comparator); insertion_point != _events.end(); ++insertion_point) {
418 /* only one point allowed per time point */
420 if ((*insertion_point)->when == when) {
421 (*insertion_point)->value = value;
426 if ((*insertion_point)->when >= when) {
433 _events.insert (insertion_point, new ControlEvent (when, value));
440 maybe_signal_changed ();
444 ControlList::erase (iterator i)
447 Glib::Mutex::Lock lm (_lock);
451 maybe_signal_changed ();
455 ControlList::erase (iterator start, iterator end)
458 Glib::Mutex::Lock lm (_lock);
459 _events.erase (start, end);
462 maybe_signal_changed ();
465 /** Erase the first event which matches the given time and value */
467 ControlList::erase (double when, double value)
470 Glib::Mutex::Lock lm (_lock);
472 iterator i = begin ();
473 while (i != end() && ((*i)->when != when || (*i)->value != value)) {
484 maybe_signal_changed ();
488 ControlList::reset_range (double start, double endt)
493 Glib::Mutex::Lock lm (_lock);
494 ControlEvent cp (start, 0.0f);
498 if ((s = lower_bound (_events.begin(), _events.end(), &cp, time_comparator)) != _events.end()) {
501 e = upper_bound (_events.begin(), _events.end(), &cp, time_comparator);
503 for (iterator i = s; i != e; ++i) {
504 (*i)->value = _default_value;
514 maybe_signal_changed ();
519 ControlList::erase_range (double start, double endt)
524 Glib::Mutex::Lock lm (_lock);
525 erased = erase_range_internal (start, endt, _events);
534 maybe_signal_changed ();
539 ControlList::erase_range_internal (double start, double endt, EventList & events)
542 ControlEvent cp (start, 0.0f);
546 if ((s = lower_bound (events.begin(), events.end(), &cp, time_comparator)) != events.end()) {
548 e = upper_bound (events.begin(), events.end(), &cp, time_comparator);
559 ControlList::slide (iterator before, double distance)
562 Glib::Mutex::Lock lm (_lock);
564 if (before == _events.end()) {
568 while (before != _events.end()) {
569 (*before)->when += distance;
576 maybe_signal_changed ();
580 ControlList::shift (double pos, double frames)
583 Glib::Mutex::Lock lm (_lock);
585 for (iterator i = _events.begin(); i != _events.end(); ++i) {
586 if ((*i)->when >= pos) {
587 (*i)->when += frames;
594 maybe_signal_changed ();
598 ControlList::modify (iterator iter, double when, double val)
600 /* note: we assume higher level logic is in place to avoid this
601 reordering the time-order of control events in the list. ie. all
602 points after *iter are later than when.
606 Glib::Mutex::Lock lm (_lock);
608 (*iter)->when = when;
609 (*iter)->value = val;
616 _events.sort (event_time_less_than);
618 _sort_pending = true;
624 maybe_signal_changed ();
627 std::pair<ControlList::iterator,ControlList::iterator>
628 ControlList::control_points_adjacent (double xval)
630 Glib::Mutex::Lock lm (_lock);
632 ControlEvent cp (xval, 0.0f);
633 std::pair<iterator,iterator> ret;
635 ret.first = _events.end();
636 ret.second = _events.end();
638 for (i = lower_bound (_events.begin(), _events.end(), &cp, time_comparator); i != _events.end(); ++i) {
640 if (ret.first == _events.end()) {
641 if ((*i)->when >= xval) {
642 if (i != _events.begin()) {
651 if ((*i)->when > xval) {
661 ControlList::set_max_xval (double x)
667 ControlList::freeze ()
682 Glib::Mutex::Lock lm (_lock);
685 _events.sort (event_time_less_than);
686 _sort_pending = false;
692 ControlList::mark_dirty () const
694 _lookup_cache.left = -1;
695 _search_cache.left = -1;
698 _curve->mark_dirty();
701 Dirty (); /* EMIT SIGNAL */
705 ControlList::truncate_end (double last_coordinate)
708 Glib::Mutex::Lock lm (_lock);
709 ControlEvent cp (last_coordinate, 0);
710 ControlList::reverse_iterator i;
713 if (_events.empty()) {
717 if (last_coordinate == _events.back()->when) {
721 if (last_coordinate > _events.back()->when) {
726 iterator foo = _events.begin();
729 if (foo == _events.end()) {
731 } else if (++foo == _events.end()) {
738 /* less than 2 points: add a new point */
739 _events.push_back (new ControlEvent (last_coordinate, _events.back()->value));
742 /* more than 2 points: check to see if the last 2 values
743 are equal. if so, just move the position of the
744 last point. otherwise, add a new point.
747 iterator penultimate = _events.end();
748 --penultimate; /* points at last point */
749 --penultimate; /* points at the penultimate point */
751 if (_events.back()->value == (*penultimate)->value) {
752 _events.back()->when = last_coordinate;
754 _events.push_back (new ControlEvent (last_coordinate, _events.back()->value));
762 last_val = unlocked_eval (last_coordinate);
763 last_val = max ((double) _min_yval, last_val);
764 last_val = min ((double) _max_yval, last_val);
766 i = _events.rbegin();
768 /* make i point to the last control point */
772 /* now go backwards, removing control points that are
773 beyond the new last coordinate.
776 // FIXME: SLOW! (size() == O(n))
778 uint32_t sz = _events.size();
780 while (i != _events.rend() && sz > 2) {
781 ControlList::reverse_iterator tmp;
786 if ((*i)->when < last_coordinate) {
790 _events.erase (i.base());
796 _events.back()->when = last_coordinate;
797 _events.back()->value = last_val;
803 maybe_signal_changed ();
807 ControlList::truncate_start (double overall_length)
810 Glib::Mutex::Lock lm (_lock);
812 double first_legal_value;
813 double first_legal_coordinate;
815 assert(!_events.empty());
817 if (overall_length == _events.back()->when) {
818 /* no change in overall length */
822 if (overall_length > _events.back()->when) {
824 /* growing at front: duplicate first point. shift all others */
826 double shift = overall_length - _events.back()->when;
829 for (np = 0, i = _events.begin(); i != _events.end(); ++i, ++np) {
835 /* less than 2 points: add a new point */
836 _events.push_front (new ControlEvent (0, _events.front()->value));
840 /* more than 2 points: check to see if the first 2 values
841 are equal. if so, just move the position of the
842 first point. otherwise, add a new point.
845 iterator second = _events.begin();
846 ++second; /* points at the second point */
848 if (_events.front()->value == (*second)->value) {
849 /* first segment is flat, just move start point back to zero */
850 _events.front()->when = 0;
852 /* leave non-flat segment in place, add a new leading point. */
853 _events.push_front (new ControlEvent (0, _events.front()->value));
859 /* shrinking at front */
861 first_legal_coordinate = _events.back()->when - overall_length;
862 first_legal_value = unlocked_eval (first_legal_coordinate);
863 first_legal_value = max (_min_yval, first_legal_value);
864 first_legal_value = min (_max_yval, first_legal_value);
866 /* remove all events earlier than the new "front" */
870 while (i != _events.end() && !_events.empty()) {
871 ControlList::iterator tmp;
876 if ((*i)->when > first_legal_coordinate) {
886 /* shift all remaining points left to keep their same
890 for (i = _events.begin(); i != _events.end(); ++i) {
891 (*i)->when -= first_legal_coordinate;
894 /* add a new point for the interpolated new value */
896 _events.push_front (new ControlEvent (0, first_legal_value));
902 maybe_signal_changed ();
906 ControlList::unlocked_eval (double x) const
908 pair<EventList::iterator,EventList::iterator> range;
914 const_iterator length_check_iter = _events.begin();
915 for (npoints = 0; npoints < 4; ++npoints, ++length_check_iter) {
916 if (length_check_iter == _events.end()) {
923 return _default_value;
926 return _events.front()->value;
929 if (x >= _events.back()->when) {
930 return _events.back()->value;
931 } else if (x <= _events.front()->when) {
932 return _events.front()->value;
935 lpos = _events.front()->when;
936 lval = _events.front()->value;
937 upos = _events.back()->when;
938 uval = _events.back()->value;
940 if (_interpolation == Discrete) {
944 /* linear interpolation betweeen the two points */
945 fraction = (double) (x - lpos) / (double) (upos - lpos);
946 return lval + (fraction * (uval - lval));
949 if (x >= _events.back()->when) {
950 return _events.back()->value;
951 } else if (x <= _events.front()->when) {
952 return _events.front()->value;
955 return multipoint_eval (x);
958 /*NOTREACHED*/ /* stupid gcc */
959 return _default_value;
963 ControlList::multipoint_eval (double x) const
969 /* "Stepped" lookup (no interpolation) */
970 /* FIXME: no cache. significant? */
971 if (_interpolation == Discrete) {
972 const ControlEvent cp (x, 0);
973 EventList::const_iterator i = lower_bound (_events.begin(), _events.end(), &cp, time_comparator);
975 // shouldn't have made it to multipoint_eval
976 assert(i != _events.end());
978 if (i == _events.begin() || (*i)->when == x)
981 return (*(--i))->value;
984 /* Only do the range lookup if x is in a different range than last time
985 * this was called (or if the lookup cache has been marked "dirty" (left<0) */
986 if ((_lookup_cache.left < 0) ||
987 ((_lookup_cache.left > x) ||
988 (_lookup_cache.range.first == _events.end()) ||
989 ((*_lookup_cache.range.second)->when < x))) {
991 const ControlEvent cp (x, 0);
993 _lookup_cache.range = equal_range (_events.begin(), _events.end(), &cp, time_comparator);
996 pair<const_iterator,const_iterator> range = _lookup_cache.range;
998 if (range.first == range.second) {
1000 /* x does not exist within the list as a control point */
1002 _lookup_cache.left = x;
1004 if (range.first != _events.begin()) {
1006 lpos = (*range.first)->when;
1007 lval = (*range.first)->value;
1009 /* we're before the first point */
1010 // return _default_value;
1011 return _events.front()->value;
1014 if (range.second == _events.end()) {
1015 /* we're after the last point */
1016 return _events.back()->value;
1019 upos = (*range.second)->when;
1020 uval = (*range.second)->value;
1022 /* linear interpolation betweeen the two points
1026 fraction = (double) (x - lpos) / (double) (upos - lpos);
1027 return lval + (fraction * (uval - lval));
1031 /* x is a control point in the data */
1032 _lookup_cache.left = -1;
1033 return (*range.first)->value;
1037 ControlList::build_search_cache_if_necessary (double start) const
1039 /* Only do the range lookup if x is in a different range than last time
1040 * this was called (or if the search cache has been marked "dirty" (left<0) */
1041 if (!_events.empty() && ((_search_cache.left < 0) || (_search_cache.left > start))) {
1043 const ControlEvent start_point (start, 0);
1045 //cerr << "REBUILD: (" << _search_cache.left << ".." << _search_cache.right << ") := ("
1046 // << start << ".." << end << ")" << endl;
1048 _search_cache.first = lower_bound (_events.begin(), _events.end(), &start_point, time_comparator);
1049 _search_cache.left = start;
1053 /** Get the earliest event after \a start using the current interpolation style.
1055 * If an event is found, \a x and \a y are set to its coordinates.
1057 * \param inclusive Include events with timestamp exactly equal to \a start
1058 * \return true if event is found (and \a x and \a y are valid).
1061 ControlList::rt_safe_earliest_event (double start, double& x, double& y, bool inclusive) const
1063 // FIXME: It would be nice if this was unnecessary..
1064 Glib::Mutex::Lock lm(_lock, Glib::TRY_LOCK);
1069 return rt_safe_earliest_event_unlocked (start, x, y, inclusive);
1073 /** Get the earliest event after \a start using the current interpolation style.
1075 * If an event is found, \a x and \a y are set to its coordinates.
1077 * \param inclusive Include events with timestamp exactly equal to \a start
1078 * \return true if event is found (and \a x and \a y are valid).
1081 ControlList::rt_safe_earliest_event_unlocked (double start, double& x, double& y, bool inclusive) const
1083 if (_interpolation == Discrete) {
1084 return rt_safe_earliest_event_discrete_unlocked(start, x, y, inclusive);
1086 return rt_safe_earliest_event_linear_unlocked(start, x, y, inclusive);
1091 /** Get the earliest event after \a start without interpolation.
1093 * If an event is found, \a x and \a y are set to its coordinates.
1095 * \param inclusive Include events with timestamp exactly equal to \a start
1096 * \return true if event is found (and \a x and \a y are valid).
1099 ControlList::rt_safe_earliest_event_discrete_unlocked (double start, double& x, double& y, bool inclusive) const
1101 build_search_cache_if_necessary (start);
1103 if (_search_cache.first != _events.end()) {
1104 const ControlEvent* const first = *_search_cache.first;
1106 const bool past_start = (inclusive ? first->when >= start : first->when > start);
1108 /* Earliest points is in range, return it */
1114 /* Move left of cache to this point
1115 * (Optimize for immediate call this cycle within range) */
1116 _search_cache.left = x;
1117 ++_search_cache.first;
1126 /* No points in range */
1132 /** Get the earliest time the line crosses an integer (Linear interpolation).
1134 * If an event is found, \a x and \a y are set to its coordinates.
1136 * \param inclusive Include events with timestamp exactly equal to \a start
1137 * \return true if event is found (and \a x and \a y are valid).
1140 ControlList::rt_safe_earliest_event_linear_unlocked (double start, double& x, double& y, bool inclusive) const
1142 // cout << "earliest_event(start: " << start << ", x: " << x << ", y: " << y << ", inclusive: " << inclusive << ")" << endl;
1144 const_iterator length_check_iter = _events.begin();
1145 if (_events.empty()) { // 0 events
1147 } else if (_events.end() == ++length_check_iter) { // 1 event
1148 return rt_safe_earliest_event_discrete_unlocked (start, x, y, inclusive);
1151 // Hack to avoid infinitely repeating the same event
1152 build_search_cache_if_necessary (start);
1154 if (_search_cache.first != _events.end()) {
1156 const ControlEvent* first = NULL;
1157 const ControlEvent* next = NULL;
1159 /* Step is after first */
1160 if (_search_cache.first == _events.begin() || (*_search_cache.first)->when <= start) {
1161 first = *_search_cache.first;
1162 ++_search_cache.first;
1163 if (_search_cache.first == _events.end()) {
1166 next = *_search_cache.first;
1168 /* Step is before first */
1170 const_iterator prev = _search_cache.first;
1173 next = *_search_cache.first;
1176 if (inclusive && first->when == start) {
1179 /* Move left of cache to this point
1180 * (Optimize for immediate call this cycle within range) */
1181 _search_cache.left = x;
1182 //++_search_cache.range.first;
1187 if (fabs(first->value - next->value) <= 1) {
1188 if (next->when > start) {
1191 /* Move left of cache to this point
1192 * (Optimize for immediate call this cycle within range) */
1193 _search_cache.left = x;
1194 //++_search_cache.range.first;
1195 assert(inclusive ? x >= start : x > start);
1202 const double slope = (next->value - first->value) / (double)(next->when - first->when);
1203 //cerr << "start y: " << start_y << endl;
1205 //y = first->value + (slope * fabs(start - first->when));
1208 if (first->value < next->value) // ramping up
1210 else // ramping down
1213 x = first->when + (y - first->value) / (double)slope;
1215 while ((inclusive && x < start) || (x <= start && y != next->value)) {
1217 if (first->value < next->value) // ramping up
1219 else // ramping down
1222 x = first->when + (y - first->value) / (double)slope;
1225 /*cerr << first->value << " @ " << first->when << " ... "
1226 << next->value << " @ " << next->when
1227 << " = " << y << " @ " << x << endl;*/
1229 assert( (y >= first->value && y <= next->value)
1230 || (y <= first->value && y >= next->value) );
1233 const bool past_start = (inclusive ? x >= start : x > start);
1235 /* Move left of cache to this point
1236 * (Optimize for immediate call this cycle within range) */
1237 _search_cache.left = x;
1238 assert(inclusive ? x >= start : x > start);
1244 /* No points in the future, so no steps (towards them) in the future */
1251 /** @param start Start position in model coordinates.
1252 * @param end End position in model coordinates.
1253 * @param op 0 = cut, 1 = copy, 2 = clear.
1255 boost::shared_ptr<ControlList>
1256 ControlList::cut_copy_clear (double start, double end, int op)
1258 boost::shared_ptr<ControlList> nal = create (_parameter);
1260 ControlEvent cp (start, 0.0);
1263 Glib::Mutex::Lock lm (_lock);
1265 /* first, determine s & e, two iterators that define the range of points
1266 affected by this operation
1269 if ((s = lower_bound (_events.begin(), _events.end(), &cp, time_comparator)) == _events.end()) {
1273 /* and the last that is at or after `end' */
1275 e = upper_bound (_events.begin(), _events.end(), &cp, time_comparator);
1278 /* if "start" isn't the location of an existing point,
1279 evaluate the curve to get a value for the start. Add a point to
1280 both the existing event list, and if its not a "clear" operation,
1281 to the copy ("nal") as well.
1283 Note that the time positions of the points in each list are different
1284 because we want the copy ("nal") to have a zero time reference.
1288 /* before we begin any cut/clear operations, get the value of the curve
1292 double end_value = unlocked_eval (end);
1294 if ((*s)->when != start) {
1296 double val = unlocked_eval (start);
1298 if (op == 0) { // cut
1299 if (start > _events.front()->when) {
1300 _events.insert (s, (new ControlEvent (start, val)));
1304 if (op != 2) { // ! clear
1305 nal->_events.push_back (new ControlEvent (0, val));
1309 for (iterator x = s; x != e; ) {
1311 /* adjust new points to be relative to start, which
1312 has been set to zero.
1316 nal->_events.push_back (new ControlEvent ((*x)->when - start, (*x)->value));
1320 x = _events.erase (x);
1326 if (e == _events.end() || (*e)->when != end) {
1328 /* only add a boundary point if there is a point after "end"
1331 if (op == 0 && (e != _events.end() && end < (*e)->when)) { // cut
1332 _events.insert (e, new ControlEvent (end, end_value));
1335 if (op != 2 && (e != _events.end() && end < (*e)->when)) { // cut/copy
1336 nal->_events.push_back (new ControlEvent (end - start, end_value));
1344 maybe_signal_changed ();
1351 boost::shared_ptr<ControlList>
1352 ControlList::cut (double start, double end)
1354 return cut_copy_clear (start, end, 0);
1357 boost::shared_ptr<ControlList>
1358 ControlList::copy (double start, double end)
1360 return cut_copy_clear (start, end, 1);
1364 ControlList::clear (double start, double end)
1366 cut_copy_clear (start, end, 2);
1369 /** @param pos Position in model coordinates */
1371 ControlList::paste (ControlList& alist, double pos, float /*times*/)
1373 if (alist._events.empty()) {
1378 Glib::Mutex::Lock lm (_lock);
1382 ControlEvent cp (pos, 0.0);
1384 where = upper_bound (_events.begin(), _events.end(), &cp, time_comparator);
1386 for (iterator i = alist.begin();i != alist.end(); ++i) {
1387 _events.insert (where, new ControlEvent( (*i)->when+pos,( *i)->value));
1388 end = (*i)->when + pos;
1392 /* move all points after the insertion along the timeline by
1396 while (where != _events.end()) {
1398 if ((*where)->when <= end) {
1401 _events.erase(where);
1412 maybe_signal_changed ();
1416 /** Move automation around according to a list of region movements.
1417 * @param return true if anything was changed, otherwise false (ie nothing needed changing)
1420 ControlList::move_ranges (const list< RangeMove<double> >& movements)
1422 typedef list< RangeMove<double> > RangeMoveList;
1425 Glib::Mutex::Lock lm (_lock);
1427 /* a copy of the events list before we started moving stuff around */
1428 EventList old_events = _events;
1430 /* clear the source and destination ranges in the new list */
1431 bool things_erased = false;
1432 for (RangeMoveList::const_iterator i = movements.begin (); i != movements.end (); ++i) {
1434 if (erase_range_internal (i->from, i->from + i->length, _events)) {
1435 things_erased = true;
1438 if (erase_range_internal (i->to, i->to + i->length, _events)) {
1439 things_erased = true;
1443 /* if nothing was erased, there is nothing to do */
1444 if (!things_erased) {
1448 /* copy the events into the new list */
1449 for (RangeMoveList::const_iterator i = movements.begin (); i != movements.end (); ++i) {
1450 iterator j = old_events.begin ();
1451 const double limit = i->from + i->length;
1452 const double dx = i->to - i->from;
1453 while (j != old_events.end () && (*j)->when <= limit) {
1454 if ((*j)->when >= i->from) {
1455 ControlEvent* ev = new ControlEvent (**j);
1457 _events.push_back (ev);
1464 _events.sort (event_time_less_than);
1466 _sort_pending = true;
1472 maybe_signal_changed ();
1477 ControlList::set_interpolation (InterpolationStyle s)
1479 if (_interpolation == s) {
1484 InterpolationChanged (s); /* EMIT SIGNAL */
1487 } // namespace Evoral