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 overlaps 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) {
336 range_begin is the first event on our list after the first nascent event
337 range_end is the first event on our list after the last nascent event
339 range_begin may be equal to _events.end() iff the last event on our list
340 was at the same time as the first nascent event.
343 if (range_begin != _events.begin()) {
344 /* clamp point before */
345 if (need_adjacent_start_clamp) {
346 _events.insert (range_begin, new ControlEvent (ninfo->start_time, start_value));
350 _events.insert (range_begin, nascent_events.begin(), nascent_events.end());
352 if (range_end != _events.end()) {
353 /* clamp point after */
354 if (need_adjacent_end_clamp) {
355 _events.insert (range_begin, new ControlEvent (ninfo->end_time, end_value));
359 _events.erase (range_begin, range_end);
368 nascent.push_back (new NascentInfo ());
372 maybe_signal_changed ();
376 ControlList::rt_add (double when, double value)
378 // this is for automation recording
380 if (touch_enabled() && !touching()) {
384 //cerr << "RT: alist " << this << " add " << value << " @ " << when << endl;
386 Glib::Mutex::Lock lm (_lock, Glib::TRY_LOCK);
389 assert (!nascent.empty());
390 /* we don't worry about adding events out of time order as we will
391 sort them in merge_nascent.
393 nascent.back()->events.push_back (new ControlEvent (when, value));
398 ControlList::fast_simple_add (double when, double value)
400 /* to be used only for loading pre-sorted data from saved state */
401 _events.insert (_events.end(), new ControlEvent (when, value));
402 assert(_events.back());
406 ControlList::add (double when, double value)
408 /* this is for making changes from some kind of user interface or
409 control surface (GUI, MIDI, OSC etc)
412 if (!clamp_value (when, value)) {
417 Glib::Mutex::Lock lm (_lock);
418 ControlEvent cp (when, 0.0f);
420 iterator insertion_point;
422 for (insertion_point = lower_bound (_events.begin(), _events.end(), &cp, time_comparator); insertion_point != _events.end(); ++insertion_point) {
424 /* only one point allowed per time point */
426 if ((*insertion_point)->when == when) {
427 (*insertion_point)->value = value;
432 if ((*insertion_point)->when >= when) {
439 _events.insert (insertion_point, new ControlEvent (when, value));
446 maybe_signal_changed ();
450 ControlList::erase (iterator i)
453 Glib::Mutex::Lock lm (_lock);
457 maybe_signal_changed ();
461 ControlList::erase (iterator start, iterator end)
464 Glib::Mutex::Lock lm (_lock);
465 _events.erase (start, end);
468 maybe_signal_changed ();
471 /** Erase the first event which matches the given time and value */
473 ControlList::erase (double when, double value)
476 Glib::Mutex::Lock lm (_lock);
478 iterator i = begin ();
479 while (i != end() && ((*i)->when != when || (*i)->value != value)) {
490 maybe_signal_changed ();
494 ControlList::reset_range (double start, double endt)
499 Glib::Mutex::Lock lm (_lock);
500 ControlEvent cp (start, 0.0f);
504 if ((s = lower_bound (_events.begin(), _events.end(), &cp, time_comparator)) != _events.end()) {
507 e = upper_bound (_events.begin(), _events.end(), &cp, time_comparator);
509 for (iterator i = s; i != e; ++i) {
510 (*i)->value = _default_value;
520 maybe_signal_changed ();
525 ControlList::erase_range (double start, double endt)
530 Glib::Mutex::Lock lm (_lock);
531 erased = erase_range_internal (start, endt, _events);
540 maybe_signal_changed ();
545 ControlList::erase_range_internal (double start, double endt, EventList & events)
548 ControlEvent cp (start, 0.0f);
552 if ((s = lower_bound (events.begin(), events.end(), &cp, time_comparator)) != events.end()) {
554 e = upper_bound (events.begin(), events.end(), &cp, time_comparator);
565 ControlList::slide (iterator before, double distance)
568 Glib::Mutex::Lock lm (_lock);
570 if (before == _events.end()) {
574 while (before != _events.end()) {
575 (*before)->when += distance;
582 maybe_signal_changed ();
586 ControlList::shift (double pos, double frames)
589 Glib::Mutex::Lock lm (_lock);
591 for (iterator i = _events.begin(); i != _events.end(); ++i) {
592 if ((*i)->when >= pos) {
593 (*i)->when += frames;
600 maybe_signal_changed ();
604 ControlList::modify (iterator iter, double when, double val)
606 /* note: we assume higher level logic is in place to avoid this
607 reordering the time-order of control events in the list. ie. all
608 points after *iter are later than when.
612 Glib::Mutex::Lock lm (_lock);
614 (*iter)->when = when;
615 (*iter)->value = val;
622 _events.sort (event_time_less_than);
624 _sort_pending = true;
630 maybe_signal_changed ();
633 std::pair<ControlList::iterator,ControlList::iterator>
634 ControlList::control_points_adjacent (double xval)
636 Glib::Mutex::Lock lm (_lock);
638 ControlEvent cp (xval, 0.0f);
639 std::pair<iterator,iterator> ret;
641 ret.first = _events.end();
642 ret.second = _events.end();
644 for (i = lower_bound (_events.begin(), _events.end(), &cp, time_comparator); i != _events.end(); ++i) {
646 if (ret.first == _events.end()) {
647 if ((*i)->when >= xval) {
648 if (i != _events.begin()) {
657 if ((*i)->when > xval) {
667 ControlList::set_max_xval (double x)
673 ControlList::freeze ()
688 Glib::Mutex::Lock lm (_lock);
691 _events.sort (event_time_less_than);
692 _sort_pending = false;
698 ControlList::mark_dirty () const
700 _lookup_cache.left = -1;
701 _search_cache.left = -1;
704 _curve->mark_dirty();
707 Dirty (); /* EMIT SIGNAL */
711 ControlList::truncate_end (double last_coordinate)
714 Glib::Mutex::Lock lm (_lock);
715 ControlEvent cp (last_coordinate, 0);
716 ControlList::reverse_iterator i;
719 if (_events.empty()) {
723 if (last_coordinate == _events.back()->when) {
727 if (last_coordinate > _events.back()->when) {
732 iterator foo = _events.begin();
735 if (foo == _events.end()) {
737 } else if (++foo == _events.end()) {
744 /* less than 2 points: add a new point */
745 _events.push_back (new ControlEvent (last_coordinate, _events.back()->value));
748 /* more than 2 points: check to see if the last 2 values
749 are equal. if so, just move the position of the
750 last point. otherwise, add a new point.
753 iterator penultimate = _events.end();
754 --penultimate; /* points at last point */
755 --penultimate; /* points at the penultimate point */
757 if (_events.back()->value == (*penultimate)->value) {
758 _events.back()->when = last_coordinate;
760 _events.push_back (new ControlEvent (last_coordinate, _events.back()->value));
768 last_val = unlocked_eval (last_coordinate);
769 last_val = max ((double) _min_yval, last_val);
770 last_val = min ((double) _max_yval, last_val);
772 i = _events.rbegin();
774 /* make i point to the last control point */
778 /* now go backwards, removing control points that are
779 beyond the new last coordinate.
782 // FIXME: SLOW! (size() == O(n))
784 uint32_t sz = _events.size();
786 while (i != _events.rend() && sz > 2) {
787 ControlList::reverse_iterator tmp;
792 if ((*i)->when < last_coordinate) {
796 _events.erase (i.base());
802 _events.back()->when = last_coordinate;
803 _events.back()->value = last_val;
809 maybe_signal_changed ();
813 ControlList::truncate_start (double overall_length)
816 Glib::Mutex::Lock lm (_lock);
818 double first_legal_value;
819 double first_legal_coordinate;
821 assert(!_events.empty());
823 if (overall_length == _events.back()->when) {
824 /* no change in overall length */
828 if (overall_length > _events.back()->when) {
830 /* growing at front: duplicate first point. shift all others */
832 double shift = overall_length - _events.back()->when;
835 for (np = 0, i = _events.begin(); i != _events.end(); ++i, ++np) {
841 /* less than 2 points: add a new point */
842 _events.push_front (new ControlEvent (0, _events.front()->value));
846 /* more than 2 points: check to see if the first 2 values
847 are equal. if so, just move the position of the
848 first point. otherwise, add a new point.
851 iterator second = _events.begin();
852 ++second; /* points at the second point */
854 if (_events.front()->value == (*second)->value) {
855 /* first segment is flat, just move start point back to zero */
856 _events.front()->when = 0;
858 /* leave non-flat segment in place, add a new leading point. */
859 _events.push_front (new ControlEvent (0, _events.front()->value));
865 /* shrinking at front */
867 first_legal_coordinate = _events.back()->when - overall_length;
868 first_legal_value = unlocked_eval (first_legal_coordinate);
869 first_legal_value = max (_min_yval, first_legal_value);
870 first_legal_value = min (_max_yval, first_legal_value);
872 /* remove all events earlier than the new "front" */
876 while (i != _events.end() && !_events.empty()) {
877 ControlList::iterator tmp;
882 if ((*i)->when > first_legal_coordinate) {
892 /* shift all remaining points left to keep their same
896 for (i = _events.begin(); i != _events.end(); ++i) {
897 (*i)->when -= first_legal_coordinate;
900 /* add a new point for the interpolated new value */
902 _events.push_front (new ControlEvent (0, first_legal_value));
908 maybe_signal_changed ();
912 ControlList::unlocked_eval (double x) const
914 pair<EventList::iterator,EventList::iterator> range;
920 const_iterator length_check_iter = _events.begin();
921 for (npoints = 0; npoints < 4; ++npoints, ++length_check_iter) {
922 if (length_check_iter == _events.end()) {
929 return _default_value;
932 return _events.front()->value;
935 if (x >= _events.back()->when) {
936 return _events.back()->value;
937 } else if (x <= _events.front()->when) {
938 return _events.front()->value;
941 lpos = _events.front()->when;
942 lval = _events.front()->value;
943 upos = _events.back()->when;
944 uval = _events.back()->value;
946 if (_interpolation == Discrete) {
950 /* linear interpolation betweeen the two points */
951 fraction = (double) (x - lpos) / (double) (upos - lpos);
952 return lval + (fraction * (uval - lval));
955 if (x >= _events.back()->when) {
956 return _events.back()->value;
957 } else if (x <= _events.front()->when) {
958 return _events.front()->value;
961 return multipoint_eval (x);
964 /*NOTREACHED*/ /* stupid gcc */
965 return _default_value;
969 ControlList::multipoint_eval (double x) const
975 /* "Stepped" lookup (no interpolation) */
976 /* FIXME: no cache. significant? */
977 if (_interpolation == Discrete) {
978 const ControlEvent cp (x, 0);
979 EventList::const_iterator i = lower_bound (_events.begin(), _events.end(), &cp, time_comparator);
981 // shouldn't have made it to multipoint_eval
982 assert(i != _events.end());
984 if (i == _events.begin() || (*i)->when == x)
987 return (*(--i))->value;
990 /* Only do the range lookup if x is in a different range than last time
991 * this was called (or if the lookup cache has been marked "dirty" (left<0) */
992 if ((_lookup_cache.left < 0) ||
993 ((_lookup_cache.left > x) ||
994 (_lookup_cache.range.first == _events.end()) ||
995 ((*_lookup_cache.range.second)->when < x))) {
997 const ControlEvent cp (x, 0);
999 _lookup_cache.range = equal_range (_events.begin(), _events.end(), &cp, time_comparator);
1002 pair<const_iterator,const_iterator> range = _lookup_cache.range;
1004 if (range.first == range.second) {
1006 /* x does not exist within the list as a control point */
1008 _lookup_cache.left = x;
1010 if (range.first != _events.begin()) {
1012 lpos = (*range.first)->when;
1013 lval = (*range.first)->value;
1015 /* we're before the first point */
1016 // return _default_value;
1017 return _events.front()->value;
1020 if (range.second == _events.end()) {
1021 /* we're after the last point */
1022 return _events.back()->value;
1025 upos = (*range.second)->when;
1026 uval = (*range.second)->value;
1028 /* linear interpolation betweeen the two points
1032 fraction = (double) (x - lpos) / (double) (upos - lpos);
1033 return lval + (fraction * (uval - lval));
1037 /* x is a control point in the data */
1038 _lookup_cache.left = -1;
1039 return (*range.first)->value;
1043 ControlList::build_search_cache_if_necessary (double start) const
1045 /* Only do the range lookup if x is in a different range than last time
1046 * this was called (or if the search cache has been marked "dirty" (left<0) */
1047 if (!_events.empty() && ((_search_cache.left < 0) || (_search_cache.left > start))) {
1049 const ControlEvent start_point (start, 0);
1051 //cerr << "REBUILD: (" << _search_cache.left << ".." << _search_cache.right << ") := ("
1052 // << start << ".." << end << ")" << endl;
1054 _search_cache.first = lower_bound (_events.begin(), _events.end(), &start_point, time_comparator);
1055 _search_cache.left = start;
1059 /** Get the earliest event after \a start using the current interpolation style.
1061 * If an event is found, \a x and \a y are set to its coordinates.
1063 * \param inclusive Include events with timestamp exactly equal to \a start
1064 * \return true if event is found (and \a x and \a y are valid).
1067 ControlList::rt_safe_earliest_event (double start, double& x, double& y, bool inclusive) const
1069 // FIXME: It would be nice if this was unnecessary..
1070 Glib::Mutex::Lock lm(_lock, Glib::TRY_LOCK);
1075 return rt_safe_earliest_event_unlocked (start, x, y, inclusive);
1079 /** Get the earliest event after \a start using the current interpolation style.
1081 * If an event is found, \a x and \a y are set to its coordinates.
1083 * \param inclusive Include events with timestamp exactly equal to \a start
1084 * \return true if event is found (and \a x and \a y are valid).
1087 ControlList::rt_safe_earliest_event_unlocked (double start, double& x, double& y, bool inclusive) const
1089 if (_interpolation == Discrete) {
1090 return rt_safe_earliest_event_discrete_unlocked(start, x, y, inclusive);
1092 return rt_safe_earliest_event_linear_unlocked(start, x, y, inclusive);
1097 /** Get the earliest event after \a start without interpolation.
1099 * If an event is found, \a x and \a y are set to its coordinates.
1101 * \param inclusive Include events with timestamp exactly equal to \a start
1102 * \return true if event is found (and \a x and \a y are valid).
1105 ControlList::rt_safe_earliest_event_discrete_unlocked (double start, double& x, double& y, bool inclusive) const
1107 build_search_cache_if_necessary (start);
1109 if (_search_cache.first != _events.end()) {
1110 const ControlEvent* const first = *_search_cache.first;
1112 const bool past_start = (inclusive ? first->when >= start : first->when > start);
1114 /* Earliest points is in range, return it */
1120 /* Move left of cache to this point
1121 * (Optimize for immediate call this cycle within range) */
1122 _search_cache.left = x;
1123 ++_search_cache.first;
1132 /* No points in range */
1138 /** Get the earliest time the line crosses an integer (Linear interpolation).
1140 * If an event is found, \a x and \a y are set to its coordinates.
1142 * \param inclusive Include events with timestamp exactly equal to \a start
1143 * \return true if event is found (and \a x and \a y are valid).
1146 ControlList::rt_safe_earliest_event_linear_unlocked (double start, double& x, double& y, bool inclusive) const
1148 // cout << "earliest_event(start: " << start << ", x: " << x << ", y: " << y << ", inclusive: " << inclusive << ")" << endl;
1150 const_iterator length_check_iter = _events.begin();
1151 if (_events.empty()) { // 0 events
1153 } else if (_events.end() == ++length_check_iter) { // 1 event
1154 return rt_safe_earliest_event_discrete_unlocked (start, x, y, inclusive);
1157 // Hack to avoid infinitely repeating the same event
1158 build_search_cache_if_necessary (start);
1160 if (_search_cache.first != _events.end()) {
1162 const ControlEvent* first = NULL;
1163 const ControlEvent* next = NULL;
1165 /* Step is after first */
1166 if (_search_cache.first == _events.begin() || (*_search_cache.first)->when <= start) {
1167 first = *_search_cache.first;
1168 ++_search_cache.first;
1169 if (_search_cache.first == _events.end()) {
1172 next = *_search_cache.first;
1174 /* Step is before first */
1176 const_iterator prev = _search_cache.first;
1179 next = *_search_cache.first;
1182 if (inclusive && first->when == start) {
1185 /* Move left of cache to this point
1186 * (Optimize for immediate call this cycle within range) */
1187 _search_cache.left = x;
1188 //++_search_cache.range.first;
1193 if (fabs(first->value - next->value) <= 1) {
1194 if (next->when > start) {
1197 /* Move left of cache to this point
1198 * (Optimize for immediate call this cycle within range) */
1199 _search_cache.left = x;
1200 //++_search_cache.range.first;
1201 assert(inclusive ? x >= start : x > start);
1208 const double slope = (next->value - first->value) / (double)(next->when - first->when);
1209 //cerr << "start y: " << start_y << endl;
1211 //y = first->value + (slope * fabs(start - first->when));
1214 if (first->value < next->value) // ramping up
1216 else // ramping down
1219 x = first->when + (y - first->value) / (double)slope;
1221 while ((inclusive && x < start) || (x <= start && y != next->value)) {
1223 if (first->value < next->value) // ramping up
1225 else // ramping down
1228 x = first->when + (y - first->value) / (double)slope;
1231 /*cerr << first->value << " @ " << first->when << " ... "
1232 << next->value << " @ " << next->when
1233 << " = " << y << " @ " << x << endl;*/
1235 assert( (y >= first->value && y <= next->value)
1236 || (y <= first->value && y >= next->value) );
1239 const bool past_start = (inclusive ? x >= start : x > start);
1241 /* Move left of cache to this point
1242 * (Optimize for immediate call this cycle within range) */
1243 _search_cache.left = x;
1244 assert(inclusive ? x >= start : x > start);
1250 /* No points in the future, so no steps (towards them) in the future */
1257 /** @param start Start position in model coordinates.
1258 * @param end End position in model coordinates.
1259 * @param op 0 = cut, 1 = copy, 2 = clear.
1261 boost::shared_ptr<ControlList>
1262 ControlList::cut_copy_clear (double start, double end, int op)
1264 boost::shared_ptr<ControlList> nal = create (_parameter);
1266 ControlEvent cp (start, 0.0);
1269 Glib::Mutex::Lock lm (_lock);
1271 /* first, determine s & e, two iterators that define the range of points
1272 affected by this operation
1275 if ((s = lower_bound (_events.begin(), _events.end(), &cp, time_comparator)) == _events.end()) {
1279 /* and the last that is at or after `end' */
1281 e = upper_bound (_events.begin(), _events.end(), &cp, time_comparator);
1284 /* if "start" isn't the location of an existing point,
1285 evaluate the curve to get a value for the start. Add a point to
1286 both the existing event list, and if its not a "clear" operation,
1287 to the copy ("nal") as well.
1289 Note that the time positions of the points in each list are different
1290 because we want the copy ("nal") to have a zero time reference.
1294 /* before we begin any cut/clear operations, get the value of the curve
1298 double end_value = unlocked_eval (end);
1300 if ((*s)->when != start) {
1302 double val = unlocked_eval (start);
1304 if (op == 0) { // cut
1305 if (start > _events.front()->when) {
1306 _events.insert (s, (new ControlEvent (start, val)));
1310 if (op != 2) { // ! clear
1311 nal->_events.push_back (new ControlEvent (0, val));
1315 for (iterator x = s; x != e; ) {
1317 /* adjust new points to be relative to start, which
1318 has been set to zero.
1322 nal->_events.push_back (new ControlEvent ((*x)->when - start, (*x)->value));
1326 x = _events.erase (x);
1332 if (e == _events.end() || (*e)->when != end) {
1334 /* only add a boundary point if there is a point after "end"
1337 if (op == 0 && (e != _events.end() && end < (*e)->when)) { // cut
1338 _events.insert (e, new ControlEvent (end, end_value));
1341 if (op != 2 && (e != _events.end() && end < (*e)->when)) { // cut/copy
1342 nal->_events.push_back (new ControlEvent (end - start, end_value));
1350 maybe_signal_changed ();
1357 boost::shared_ptr<ControlList>
1358 ControlList::cut (double start, double end)
1360 return cut_copy_clear (start, end, 0);
1363 boost::shared_ptr<ControlList>
1364 ControlList::copy (double start, double end)
1366 return cut_copy_clear (start, end, 1);
1370 ControlList::clear (double start, double end)
1372 cut_copy_clear (start, end, 2);
1375 /** @param pos Position in model coordinates */
1377 ControlList::paste (ControlList& alist, double pos, float /*times*/)
1379 if (alist._events.empty()) {
1384 Glib::Mutex::Lock lm (_lock);
1388 ControlEvent cp (pos, 0.0);
1390 where = upper_bound (_events.begin(), _events.end(), &cp, time_comparator);
1392 for (iterator i = alist.begin();i != alist.end(); ++i) {
1393 _events.insert (where, new ControlEvent( (*i)->when+pos,( *i)->value));
1394 end = (*i)->when + pos;
1398 /* move all points after the insertion along the timeline by
1402 while (where != _events.end()) {
1404 if ((*where)->when <= end) {
1407 _events.erase(where);
1418 maybe_signal_changed ();
1422 /** Move automation around according to a list of region movements.
1423 * @param return true if anything was changed, otherwise false (ie nothing needed changing)
1426 ControlList::move_ranges (const list< RangeMove<double> >& movements)
1428 typedef list< RangeMove<double> > RangeMoveList;
1431 Glib::Mutex::Lock lm (_lock);
1433 /* a copy of the events list before we started moving stuff around */
1434 EventList old_events = _events;
1436 /* clear the source and destination ranges in the new list */
1437 bool things_erased = false;
1438 for (RangeMoveList::const_iterator i = movements.begin (); i != movements.end (); ++i) {
1440 if (erase_range_internal (i->from, i->from + i->length, _events)) {
1441 things_erased = true;
1444 if (erase_range_internal (i->to, i->to + i->length, _events)) {
1445 things_erased = true;
1449 /* if nothing was erased, there is nothing to do */
1450 if (!things_erased) {
1454 /* copy the events into the new list */
1455 for (RangeMoveList::const_iterator i = movements.begin (); i != movements.end (); ++i) {
1456 iterator j = old_events.begin ();
1457 const double limit = i->from + i->length;
1458 const double dx = i->to - i->from;
1459 while (j != old_events.end () && (*j)->when <= limit) {
1460 if ((*j)->when >= i->from) {
1461 ControlEvent* ev = new ControlEvent (**j);
1463 _events.push_back (ev);
1470 _events.sort (event_time_less_than);
1472 _sort_pending = true;
1478 maybe_signal_changed ();
1483 ControlList::set_interpolation (InterpolationStyle s)
1485 if (_interpolation == s) {
1490 InterpolationChanged (s); /* EMIT SIGNAL */
1493 } // namespace Evoral