1 /* This file is part of Evoral.
2 * Copyright (C) 2008 Dave 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 ControlList::merge_nascent (double when)
230 Glib::Mutex::Lock lm (_lock);
232 if (nascent.empty()) {
236 for (list<NascentInfo*>::iterator n = nascent.begin(); n != nascent.end(); ++n) {
238 NascentInfo* ninfo = *n;
239 EventList& nascent_events (ninfo->events);
240 bool need_adjacent_start_clamp;
241 bool need_adjacent_end_clamp;
243 if (nascent_events.empty()) {
248 if (ninfo->start_time < 0.0) {
249 ninfo->start_time = nascent_events.front()->when;
252 if (ninfo->end_time < 0.0) {
253 ninfo->end_time = when;
256 bool preexisting = !_events.empty();
260 _events = nascent_events;
262 } else if (ninfo->end_time < _events.front()->when) {
264 /* all points in nascent are before the first existing point */
266 _events.insert (_events.begin(), nascent_events.begin(), nascent_events.end());
268 } else if (ninfo->start_time > _events.back()->when) {
270 /* all points in nascent are after the last existing point */
272 _events.insert (_events.end(), nascent_events.begin(), nascent_events.end());
276 /* find the range that overaps with nascent events,
277 and insert the contents of nascent events.
281 iterator range_begin = _events.end();
282 iterator range_end = _events.end();
283 double end_value = unlocked_eval (ninfo->end_time);
284 double start_value = unlocked_eval (ninfo->start_time - 1);
286 need_adjacent_end_clamp = true;
287 need_adjacent_start_clamp = true;
289 for (i = _events.begin(); i != _events.end(); ++i) {
291 if ((*i)->when == ninfo->start_time) {
292 /* existing point at same time, remove it
293 and the consider the next point instead.
295 i = _events.erase (i);
297 if (i == _events.end()) {
301 if (range_begin == _events.end()) {
303 need_adjacent_start_clamp = false;
305 need_adjacent_end_clamp = false;
308 if ((*i)->when > ninfo->end_time) {
313 } else if ((*i)->when > ninfo->start_time) {
315 if (range_begin == _events.end()) {
319 if ((*i)->when > ninfo->end_time) {
326 assert (range_begin != _events.end());
328 if (range_begin != _events.begin()) {
329 /* clamp point before */
330 if (need_adjacent_start_clamp) {
331 _events.insert (range_begin, new ControlEvent (ninfo->start_time, start_value));
335 _events.insert (range_begin, nascent_events.begin(), nascent_events.end());
337 if (range_end != _events.end()) {
338 /* clamp point after */
339 if (need_adjacent_end_clamp) {
340 _events.insert (range_begin, new ControlEvent (ninfo->end_time, end_value));
344 _events.erase (range_begin, range_end);
353 nascent.push_back (new NascentInfo (false));
357 maybe_signal_changed ();
361 ControlList::rt_add (double when, double value)
363 // this is for automation recording
365 if (touch_enabled() && !touching()) {
369 //cerr << "RT: alist " << this << " add " << value << " @ " << when << endl;
371 Glib::Mutex::Lock lm (_lock, Glib::TRY_LOCK);
374 assert (!nascent.empty());
375 if (!nascent.back()->events.empty()) {
376 assert (when > nascent.back()->events.back()->when);
378 nascent.back()->events.push_back (new ControlEvent (when, value));
383 ControlList::fast_simple_add (double when, double value)
385 /* to be used only for loading pre-sorted data from saved state */
386 _events.insert (_events.end(), new ControlEvent (when, value));
387 assert(_events.back());
391 ControlList::add (double when, double value)
393 /* this is for graphical editing */
396 Glib::Mutex::Lock lm (_lock);
397 ControlEvent cp (when, 0.0f);
399 iterator insertion_point;
401 for (insertion_point = lower_bound (_events.begin(), _events.end(), &cp, time_comparator); insertion_point != _events.end(); ++insertion_point) {
403 /* only one point allowed per time point */
405 if ((*insertion_point)->when == when) {
406 (*insertion_point)->value = value;
411 if ((*insertion_point)->when >= when) {
418 _events.insert (insertion_point, new ControlEvent (when, value));
425 maybe_signal_changed ();
429 ControlList::erase (iterator i)
432 Glib::Mutex::Lock lm (_lock);
436 maybe_signal_changed ();
440 ControlList::erase (iterator start, iterator end)
443 Glib::Mutex::Lock lm (_lock);
444 _events.erase (start, end);
447 maybe_signal_changed ();
451 ControlList::reset_range (double start, double endt)
456 Glib::Mutex::Lock lm (_lock);
457 ControlEvent cp (start, 0.0f);
461 if ((s = lower_bound (_events.begin(), _events.end(), &cp, time_comparator)) != _events.end()) {
464 e = upper_bound (_events.begin(), _events.end(), &cp, time_comparator);
466 for (iterator i = s; i != e; ++i) {
467 (*i)->value = _default_value;
477 maybe_signal_changed ();
482 ControlList::erase_range (double start, double endt)
487 Glib::Mutex::Lock lm (_lock);
488 erased = erase_range_internal (start, endt, _events);
497 maybe_signal_changed ();
502 ControlList::erase_range_internal (double start, double endt, EventList & events)
505 ControlEvent cp (start, 0.0f);
509 if ((s = lower_bound (events.begin(), events.end(), &cp, time_comparator)) != events.end()) {
511 e = upper_bound (events.begin(), events.end(), &cp, time_comparator);
522 ControlList::slide (iterator before, double distance)
525 Glib::Mutex::Lock lm (_lock);
527 if (before == _events.end()) {
531 while (before != _events.end()) {
532 (*before)->when += distance;
537 maybe_signal_changed ();
541 ControlList::modify (iterator iter, double when, double val)
543 /* note: we assume higher level logic is in place to avoid this
544 reordering the time-order of control events in the list. ie. all
545 points after *iter are later than when.
549 Glib::Mutex::Lock lm (_lock);
551 (*iter)->when = when;
552 (*iter)->value = val;
559 _events.sort (event_time_less_than);
561 _sort_pending = true;
567 maybe_signal_changed ();
570 std::pair<ControlList::iterator,ControlList::iterator>
571 ControlList::control_points_adjacent (double xval)
573 Glib::Mutex::Lock lm (_lock);
575 ControlEvent cp (xval, 0.0f);
576 std::pair<iterator,iterator> ret;
578 ret.first = _events.end();
579 ret.second = _events.end();
581 for (i = lower_bound (_events.begin(), _events.end(), &cp, time_comparator); i != _events.end(); ++i) {
583 if (ret.first == _events.end()) {
584 if ((*i)->when >= xval) {
585 if (i != _events.begin()) {
594 if ((*i)->when > xval) {
604 ControlList::set_max_xval (double x)
610 ControlList::freeze ()
625 Glib::Mutex::Lock lm (_lock);
628 _events.sort (event_time_less_than);
629 _sort_pending = false;
635 ControlList::mark_dirty () const
637 _lookup_cache.left = -1;
638 _search_cache.left = -1;
641 _curve->mark_dirty();
644 Dirty (); /* EMIT SIGNAL */
648 ControlList::truncate_end (double last_coordinate)
651 Glib::Mutex::Lock lm (_lock);
652 ControlEvent cp (last_coordinate, 0);
653 ControlList::reverse_iterator i;
656 if (_events.empty()) {
660 if (last_coordinate == _events.back()->when) {
664 if (last_coordinate > _events.back()->when) {
669 iterator foo = _events.begin();
672 if (foo == _events.end()) {
674 } else if (++foo == _events.end()) {
681 /* less than 2 points: add a new point */
682 _events.push_back (new ControlEvent (last_coordinate, _events.back()->value));
685 /* more than 2 points: check to see if the last 2 values
686 are equal. if so, just move the position of the
687 last point. otherwise, add a new point.
690 iterator penultimate = _events.end();
691 --penultimate; /* points at last point */
692 --penultimate; /* points at the penultimate point */
694 if (_events.back()->value == (*penultimate)->value) {
695 _events.back()->when = last_coordinate;
697 _events.push_back (new ControlEvent (last_coordinate, _events.back()->value));
705 last_val = unlocked_eval (last_coordinate);
706 last_val = max ((double) _min_yval, last_val);
707 last_val = min ((double) _max_yval, last_val);
709 i = _events.rbegin();
711 /* make i point to the last control point */
715 /* now go backwards, removing control points that are
716 beyond the new last coordinate.
719 // FIXME: SLOW! (size() == O(n))
721 uint32_t sz = _events.size();
723 while (i != _events.rend() && sz > 2) {
724 ControlList::reverse_iterator tmp;
729 if ((*i)->when < last_coordinate) {
733 _events.erase (i.base());
739 _events.back()->when = last_coordinate;
740 _events.back()->value = last_val;
746 maybe_signal_changed ();
750 ControlList::truncate_start (double overall_length)
753 Glib::Mutex::Lock lm (_lock);
755 double first_legal_value;
756 double first_legal_coordinate;
758 assert(!_events.empty());
760 if (overall_length == _events.back()->when) {
761 /* no change in overall length */
765 if (overall_length > _events.back()->when) {
767 /* growing at front: duplicate first point. shift all others */
769 double shift = overall_length - _events.back()->when;
772 for (np = 0, i = _events.begin(); i != _events.end(); ++i, ++np) {
778 /* less than 2 points: add a new point */
779 _events.push_front (new ControlEvent (0, _events.front()->value));
783 /* more than 2 points: check to see if the first 2 values
784 are equal. if so, just move the position of the
785 first point. otherwise, add a new point.
788 iterator second = _events.begin();
789 ++second; /* points at the second point */
791 if (_events.front()->value == (*second)->value) {
792 /* first segment is flat, just move start point back to zero */
793 _events.front()->when = 0;
795 /* leave non-flat segment in place, add a new leading point. */
796 _events.push_front (new ControlEvent (0, _events.front()->value));
802 /* shrinking at front */
804 first_legal_coordinate = _events.back()->when - overall_length;
805 first_legal_value = unlocked_eval (first_legal_coordinate);
806 first_legal_value = max (_min_yval, first_legal_value);
807 first_legal_value = min (_max_yval, first_legal_value);
809 /* remove all events earlier than the new "front" */
813 while (i != _events.end() && !_events.empty()) {
814 ControlList::iterator tmp;
819 if ((*i)->when > first_legal_coordinate) {
829 /* shift all remaining points left to keep their same
833 for (i = _events.begin(); i != _events.end(); ++i) {
834 (*i)->when -= first_legal_coordinate;
837 /* add a new point for the interpolated new value */
839 _events.push_front (new ControlEvent (0, first_legal_value));
845 maybe_signal_changed ();
849 ControlList::unlocked_eval (double x) const
851 pair<EventList::iterator,EventList::iterator> range;
857 const_iterator length_check_iter = _events.begin();
858 for (npoints = 0; npoints < 4; ++npoints, ++length_check_iter) {
859 if (length_check_iter == _events.end()) {
866 return _default_value;
869 return _events.front()->value;
872 if (x >= _events.back()->when) {
873 return _events.back()->value;
874 } else if (x <= _events.front()->when) {
875 return _events.front()->value;
878 lpos = _events.front()->when;
879 lval = _events.front()->value;
880 upos = _events.back()->when;
881 uval = _events.back()->value;
883 if (_interpolation == Discrete) {
887 /* linear interpolation betweeen the two points */
888 fraction = (double) (x - lpos) / (double) (upos - lpos);
889 return lval + (fraction * (uval - lval));
892 if (x >= _events.back()->when) {
893 return _events.back()->value;
894 } else if (x <= _events.front()->when) {
895 return _events.front()->value;
898 return multipoint_eval (x);
901 /*NOTREACHED*/ /* stupid gcc */
902 return _default_value;
906 ControlList::multipoint_eval (double x) const
912 /* "Stepped" lookup (no interpolation) */
913 /* FIXME: no cache. significant? */
914 if (_interpolation == Discrete) {
915 const ControlEvent cp (x, 0);
916 EventList::const_iterator i = lower_bound (_events.begin(), _events.end(), &cp, time_comparator);
918 // shouldn't have made it to multipoint_eval
919 assert(i != _events.end());
921 if (i == _events.begin() || (*i)->when == x)
924 return (*(--i))->value;
927 /* Only do the range lookup if x is in a different range than last time
928 * this was called (or if the lookup cache has been marked "dirty" (left<0) */
929 if ((_lookup_cache.left < 0) ||
930 ((_lookup_cache.left > x) ||
931 (_lookup_cache.range.first == _events.end()) ||
932 ((*_lookup_cache.range.second)->when < x))) {
934 const ControlEvent cp (x, 0);
936 _lookup_cache.range = equal_range (_events.begin(), _events.end(), &cp, time_comparator);
939 pair<const_iterator,const_iterator> range = _lookup_cache.range;
941 if (range.first == range.second) {
943 /* x does not exist within the list as a control point */
945 _lookup_cache.left = x;
947 if (range.first != _events.begin()) {
949 lpos = (*range.first)->when;
950 lval = (*range.first)->value;
952 /* we're before the first point */
953 // return _default_value;
954 return _events.front()->value;
957 if (range.second == _events.end()) {
958 /* we're after the last point */
959 return _events.back()->value;
962 upos = (*range.second)->when;
963 uval = (*range.second)->value;
965 /* linear interpolation betweeen the two points
969 fraction = (double) (x - lpos) / (double) (upos - lpos);
970 return lval + (fraction * (uval - lval));
974 /* x is a control point in the data */
975 _lookup_cache.left = -1;
976 return (*range.first)->value;
980 ControlList::build_search_cache_if_necessary (double start) const
982 /* Only do the range lookup if x is in a different range than last time
983 * this was called (or if the search cache has been marked "dirty" (left<0) */
984 if (!_events.empty() && ((_search_cache.left < 0) || (_search_cache.left > start))) {
986 const ControlEvent start_point (start, 0);
988 //cerr << "REBUILD: (" << _search_cache.left << ".." << _search_cache.right << ") := ("
989 // << start << ".." << end << ")" << endl;
991 _search_cache.first = lower_bound (_events.begin(), _events.end(), &start_point, time_comparator);
992 _search_cache.left = start;
996 /** Get the earliest event after \a start using the current interpolation style.
998 * If an event is found, \a x and \a y are set to its coordinates.
1000 * \param inclusive Include events with timestamp exactly equal to \a start
1001 * \return true if event is found (and \a x and \a y are valid).
1004 ControlList::rt_safe_earliest_event (double start, double& x, double& y, bool inclusive) const
1006 // FIXME: It would be nice if this was unnecessary..
1007 Glib::Mutex::Lock lm(_lock, Glib::TRY_LOCK);
1012 return rt_safe_earliest_event_unlocked (start, x, y, inclusive);
1016 /** Get the earliest event after \a start using the current interpolation style.
1018 * If an event is found, \a x and \a y are set to its coordinates.
1020 * \param inclusive Include events with timestamp exactly equal to \a start
1021 * \return true if event is found (and \a x and \a y are valid).
1024 ControlList::rt_safe_earliest_event_unlocked (double start, double& x, double& y, bool inclusive) const
1026 if (_interpolation == Discrete) {
1027 return rt_safe_earliest_event_discrete_unlocked(start, x, y, inclusive);
1029 return rt_safe_earliest_event_linear_unlocked(start, x, y, inclusive);
1034 /** Get the earliest event after \a start without interpolation.
1036 * If an event is found, \a x and \a y are set to its coordinates.
1038 * \param inclusive Include events with timestamp exactly equal to \a start
1039 * \return true if event is found (and \a x and \a y are valid).
1042 ControlList::rt_safe_earliest_event_discrete_unlocked (double start, double& x, double& y, bool inclusive) const
1044 build_search_cache_if_necessary (start);
1046 if (_search_cache.first != _events.end()) {
1047 const ControlEvent* const first = *_search_cache.first;
1049 const bool past_start = (inclusive ? first->when >= start : first->when > start);
1051 /* Earliest points is in range, return it */
1057 /* Move left of cache to this point
1058 * (Optimize for immediate call this cycle within range) */
1059 _search_cache.left = x;
1060 ++_search_cache.first;
1069 /* No points in range */
1075 /** Get the earliest time the line crosses an integer (Linear interpolation).
1077 * If an event is found, \a x and \a y are set to its coordinates.
1079 * \param inclusive Include events with timestamp exactly equal to \a start
1080 * \return true if event is found (and \a x and \a y are valid).
1083 ControlList::rt_safe_earliest_event_linear_unlocked (double start, double& x, double& y, bool inclusive) const
1085 // cout << "earliest_event(start: " << start << ", x: " << x << ", y: " << y << ", inclusive: " << inclusive << ")" << endl;
1087 const_iterator length_check_iter = _events.begin();
1088 if (_events.empty()) { // 0 events
1090 } else if (_events.end() == ++length_check_iter) { // 1 event
1091 return rt_safe_earliest_event_discrete_unlocked (start, x, y, inclusive);
1094 // Hack to avoid infinitely repeating the same event
1095 build_search_cache_if_necessary (start);
1097 if (_search_cache.first != _events.end()) {
1099 const ControlEvent* first = NULL;
1100 const ControlEvent* next = NULL;
1102 /* Step is after first */
1103 if (_search_cache.first == _events.begin() || (*_search_cache.first)->when <= start) {
1104 first = *_search_cache.first;
1105 ++_search_cache.first;
1106 if (_search_cache.first == _events.end()) {
1109 next = *_search_cache.first;
1111 /* Step is before first */
1113 const_iterator prev = _search_cache.first;
1116 next = *_search_cache.first;
1119 if (inclusive && first->when == start) {
1122 /* Move left of cache to this point
1123 * (Optimize for immediate call this cycle within range) */
1124 _search_cache.left = x;
1125 //++_search_cache.range.first;
1130 if (fabs(first->value - next->value) <= 1) {
1131 if (next->when > start) {
1134 /* Move left of cache to this point
1135 * (Optimize for immediate call this cycle within range) */
1136 _search_cache.left = x;
1137 //++_search_cache.range.first;
1138 assert(inclusive ? x >= start : x > start);
1145 const double slope = (next->value - first->value) / (double)(next->when - first->when);
1146 //cerr << "start y: " << start_y << endl;
1148 //y = first->value + (slope * fabs(start - first->when));
1151 if (first->value < next->value) // ramping up
1153 else // ramping down
1156 x = first->when + (y - first->value) / (double)slope;
1158 while ((inclusive && x < start) || (x <= start && y != next->value)) {
1160 if (first->value < next->value) // ramping up
1162 else // ramping down
1165 x = first->when + (y - first->value) / (double)slope;
1168 /*cerr << first->value << " @ " << first->when << " ... "
1169 << next->value << " @ " << next->when
1170 << " = " << y << " @ " << x << endl;*/
1172 assert( (y >= first->value && y <= next->value)
1173 || (y <= first->value && y >= next->value) );
1176 const bool past_start = (inclusive ? x >= start : x > start);
1178 /* Move left of cache to this point
1179 * (Optimize for immediate call this cycle within range) */
1180 _search_cache.left = x;
1181 assert(inclusive ? x >= start : x > start);
1187 /* No points in the future, so no steps (towards them) in the future */
1194 /** @param start Start position in model coordinates.
1195 * @param end End position in model coordinates.
1196 * @param op 0 = cut, 1 = copy, 2 = clear.
1198 boost::shared_ptr<ControlList>
1199 ControlList::cut_copy_clear (double start, double end, int op)
1201 boost::shared_ptr<ControlList> nal = create (_parameter);
1203 ControlEvent cp (start, 0.0);
1206 Glib::Mutex::Lock lm (_lock);
1208 /* first, determine s & e, two iterators that define the range of points
1209 affected by this operation
1212 if ((s = lower_bound (_events.begin(), _events.end(), &cp, time_comparator)) == _events.end()) {
1216 /* and the last that is at or after `end' */
1218 e = upper_bound (_events.begin(), _events.end(), &cp, time_comparator);
1221 /* if "start" isn't the location of an existing point,
1222 evaluate the curve to get a value for the start. Add a point to
1223 both the existing event list, and if its not a "clear" operation,
1224 to the copy ("nal") as well.
1226 Note that the time positions of the points in each list are different
1227 because we want the copy ("nal") to have a zero time reference.
1231 /* before we begin any cut/clear operations, get the value of the curve
1235 double end_value = unlocked_eval (end);
1237 if ((*s)->when != start) {
1239 double val = unlocked_eval (start);
1241 if (op == 0) { // cut
1242 if (start > _events.front()->when) {
1243 _events.insert (s, (new ControlEvent (start, val)));
1247 if (op != 2) { // ! clear
1248 nal->_events.push_back (new ControlEvent (0, val));
1252 for (iterator x = s; x != e; ) {
1254 /* adjust new points to be relative to start, which
1255 has been set to zero.
1259 nal->_events.push_back (new ControlEvent ((*x)->when - start, (*x)->value));
1263 x = _events.erase (x);
1269 if (e == _events.end() || (*e)->when != end) {
1271 /* only add a boundary point if there is a point after "end"
1274 if (op == 0 && (e != _events.end() && end < (*e)->when)) { // cut
1275 _events.insert (e, new ControlEvent (end, end_value));
1278 if (op != 2 && (e != _events.end() && end < (*e)->when)) { // cut/copy
1279 nal->_events.push_back (new ControlEvent (end - start, end_value));
1287 maybe_signal_changed ();
1294 boost::shared_ptr<ControlList>
1295 ControlList::cut (double start, double end)
1297 return cut_copy_clear (start, end, 0);
1300 boost::shared_ptr<ControlList>
1301 ControlList::copy (double start, double end)
1303 return cut_copy_clear (start, end, 1);
1307 ControlList::clear (double start, double end)
1309 cut_copy_clear (start, end, 2);
1312 /** @param pos Position in model coordinates */
1314 ControlList::paste (ControlList& alist, double pos, float /*times*/)
1316 if (alist._events.empty()) {
1321 Glib::Mutex::Lock lm (_lock);
1325 ControlEvent cp (pos, 0.0);
1327 where = upper_bound (_events.begin(), _events.end(), &cp, time_comparator);
1329 for (iterator i = alist.begin();i != alist.end(); ++i) {
1330 _events.insert (where, new ControlEvent( (*i)->when+pos,( *i)->value));
1331 end = (*i)->when + pos;
1335 /* move all points after the insertion along the timeline by
1339 while (where != _events.end()) {
1341 if ((*where)->when <= end) {
1344 _events.erase(where);
1355 maybe_signal_changed ();
1359 /** Move automation around according to a list of region movements.
1360 * @param return true if anything was changed, otherwise false (ie nothing needed changing)
1363 ControlList::move_ranges (const list< RangeMove<double> >& movements)
1365 typedef list< RangeMove<double> > RangeMoveList;
1368 Glib::Mutex::Lock lm (_lock);
1370 /* a copy of the events list before we started moving stuff around */
1371 EventList old_events = _events;
1373 /* clear the source and destination ranges in the new list */
1374 bool things_erased = false;
1375 for (RangeMoveList::const_iterator i = movements.begin (); i != movements.end (); ++i) {
1377 if (erase_range_internal (i->from, i->from + i->length, _events)) {
1378 things_erased = true;
1381 if (erase_range_internal (i->to, i->to + i->length, _events)) {
1382 things_erased = true;
1386 /* if nothing was erased, there is nothing to do */
1387 if (!things_erased) {
1391 /* copy the events into the new list */
1392 for (RangeMoveList::const_iterator i = movements.begin (); i != movements.end (); ++i) {
1393 iterator j = old_events.begin ();
1394 const double limit = i->from + i->length;
1395 const double dx = i->to - i->from;
1396 while (j != old_events.end () && (*j)->when <= limit) {
1397 if ((*j)->when >= i->from) {
1398 ControlEvent* ev = new ControlEvent (**j);
1400 _events.push_back (ev);
1407 _events.sort (event_time_less_than);
1409 _sort_pending = true;
1415 maybe_signal_changed ();
1420 ControlList::set_interpolation (InterpolationStyle s)
1422 if (_interpolation == s) {
1427 InterpolationChanged (s); /* EMIT SIGNAL */
1430 } // namespace Evoral