/* This file is part of Evoral.
* Copyright (C) 2008 Dave Robillard <http://drobilla.net>
* Copyright (C) 2000-2008 Paul Davis
- *
+ *
* Evoral 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.
- *
+ *
* Evoral 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 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.,
* 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
: _parameter(id)
, _interpolation(Linear)
, _curve(0)
-{
+{
_frozen = 0;
_changed_when_thawed = false;
_min_yval = id.min();
for (const_iterator i = other._events.begin(); i != other._events.end(); ++i) {
_events.push_back (new ControlEvent (**i));
}
-
+
mark_dirty ();
}
_events.push_back (new ControlEvent ((*i)->when, (*i)->value));
}
}
-
+
mark_dirty ();
}
ControlList::operator= (const ControlList& other)
{
if (this != &other) {
-
+
_events.clear ();
-
+
for (const_iterator i = other._events.begin(); i != other._events.end(); ++i) {
_events.push_back (new ControlEvent (**i));
}
-
+
_min_yval = other._min_yval;
_max_yval = other._max_yval;
_max_xval = other._max_xval;
_default_value = other._default_value;
-
+
mark_dirty ();
maybe_signal_changed ();
}
ControlList::maybe_signal_changed ()
{
mark_dirty ();
-
- if (_frozen)
+
+ if (_frozen) {
_changed_when_thawed = true;
+ }
}
void
where = after;
}
-
+
iterator previous = _rt_insertion_point;
--previous;
-
+
if (_rt_insertion_point != _events.begin() && (*_rt_insertion_point)->value == value && (*previous)->value == value) {
(*_rt_insertion_point)->when = when;
done = true;
-
+
}
-
+
} else {
where = lower_bound (_events.begin(), _events.end(), &cp, time_comparator);
if (!done) {
_rt_insertion_point = _events.insert (where, new ControlEvent (when, value));
}
-
+
_new_value = false;
mark_dirty ();
}
(*insertion_point)->value = value;
insert = false;
break;
- }
+ }
if ((*insertion_point)->when >= when) {
break;
}
if (insert) {
-
+
_events.insert (insertion_point, new ControlEvent (when, value));
reposition_for_rt_add (0);
- }
+ }
mark_dirty ();
}
mark_dirty ();
}
maybe_signal_changed ();
-}
+}
void
ControlList::reset_range (double start, double endt)
bool reset = false;
{
- Glib::Mutex::Lock lm (_lock);
+ Glib::Mutex::Lock lm (_lock);
ControlEvent cp (start, 0.0f);
iterator s;
iterator e;
-
+
if ((s = lower_bound (_events.begin(), _events.end(), &cp, time_comparator)) != _events.end()) {
cp.when = endt;
for (iterator i = s; i != e; ++i) {
(*i)->value = _default_value;
}
-
+
reset = true;
mark_dirty ();
reposition_for_rt_add (0);
mark_dirty ();
}
-
+
}
if (erased) {
if (before == _events.end()) {
return;
}
-
+
while (before != _events.end()) {
(*before)->when += distance;
++before;
ret.second = _events.end();
for (i = lower_bound (_events.begin(), _events.end(), &cp, time_comparator); i != _events.end(); ++i) {
-
+
if (ret.first == _events.end()) {
if ((*i)->when >= xval) {
if (i != _events.begin()) {
return ret;
}
}
- }
-
+ }
+
if ((*i)->when > xval) {
ret.second = i;
break;
}
}
-void
+void
ControlList::mark_dirty () const
{
_lookup_cache.left = -1;
_search_cache.left = -1;
- if (_curve)
+
+ if (_curve) {
_curve->mark_dirty();
+ }
+
+ Dirty (); /* EMIT SIGNAL */
}
void
}
if (last_coordinate > _events.back()->when) {
-
+
/* extending end:
*/
iterator penultimate = _events.end();
--penultimate; /* points at last point */
--penultimate; /* points at the penultimate point */
-
+
if (_events.back()->value == (*penultimate)->value) {
_events.back()->when = last_coordinate;
} else {
last_val = unlocked_eval (last_coordinate);
last_val = max ((double) _min_yval, last_val);
last_val = min ((double) _max_yval, last_val);
-
+
i = _events.rbegin();
-
+
/* make i point to the last control point */
-
+
++i;
-
+
/* now go backwards, removing control points that are
beyond the new last coordinate.
*/
// FIXME: SLOW! (size() == O(n))
uint32_t sz = _events.size();
-
+
while (i != _events.rend() && sz > 2) {
ControlList::reverse_iterator tmp;
-
+
tmp = i;
++tmp;
-
+
if ((*i)->when < last_coordinate) {
break;
}
-
+
_events.erase (i.base());
--sz;
i = tmp;
}
-
+
_events.back()->when = last_coordinate;
_events.back()->value = last_val;
}
double first_legal_coordinate;
assert(!_events.empty());
-
+
if (overall_length == _events.back()->when) {
/* no change in overall length */
return;
}
-
+
if (overall_length > _events.back()->when) {
-
+
/* growing at front: duplicate first point. shift all others */
double shift = overall_length - _events.back()->when;
iterator second = _events.begin();
++second; /* points at the second point */
-
+
if (_events.front()->value == (*second)->value) {
/* first segment is flat, just move start point back to zero */
_events.front()->when = 0;
} else {
/* shrinking at front */
-
+
first_legal_coordinate = _events.back()->when - overall_length;
first_legal_value = unlocked_eval (first_legal_coordinate);
first_legal_value = max (_min_yval, first_legal_value);
/* remove all events earlier than the new "front" */
i = _events.begin();
-
+
while (i != _events.end() && !_events.empty()) {
ControlList::iterator tmp;
-
+
tmp = i;
++tmp;
-
+
if ((*i)->when > first_legal_coordinate) {
break;
}
-
+
_events.erase (i);
-
+
i = tmp;
}
-
+
/* shift all remaining points left to keep their same
relative position
*/
-
+
for (i = _events.begin(); i != _events.end(); ++i) {
(*i)->when -= first_legal_coordinate;
}
/* add a new point for the interpolated new value */
-
+
_events.push_front (new ControlEvent (0, first_legal_value));
- }
+ }
reposition_for_rt_add (0);
case 1:
return _events.front()->value;
-
+
case 2:
if (x >= _events.back()->when) {
return _events.back()->value;
- } else if (x <= _events.front()->when) {
+ } else if (x <= _events.front()->when) {
return _events.front()->value;
}
lval = _events.front()->value;
upos = _events.back()->when;
uval = _events.back()->value;
-
+
if (_interpolation == Discrete) {
return lval;
}
default:
if (x >= _events.back()->when) {
return _events.back()->value;
- } else if (x <= _events.front()->when) {
+ } else if (x <= _events.front()->when) {
return _events.front()->value;
}
double upos, lpos;
double uval, lval;
double fraction;
-
+
/* "Stepped" lookup (no interpolation) */
/* FIXME: no cache. significant? */
if (_interpolation == Discrete) {
/* Only do the range lookup if x is in a different range than last time
* this was called (or if the lookup cache has been marked "dirty" (left<0) */
if ((_lookup_cache.left < 0) ||
- ((_lookup_cache.left > x) ||
- (_lookup_cache.range.first == _events.end()) ||
+ ((_lookup_cache.left > x) ||
+ (_lookup_cache.range.first == _events.end()) ||
((*_lookup_cache.range.second)->when < x))) {
const ControlEvent cp (x, 0);
-
+
_lookup_cache.range = equal_range (_events.begin(), _events.end(), &cp, time_comparator);
}
-
+
pair<const_iterator,const_iterator> range = _lookup_cache.range;
if (range.first == range.second) {
// return _default_value;
return _events.front()->value;
}
-
+
if (range.second == _events.end()) {
/* we're after the last point */
return _events.back()->value;
upos = (*range.second)->when;
uval = (*range.second)->value;
-
+
/* linear interpolation betweeen the two points
on either side of x
*/
fraction = (double) (x - lpos) / (double) (upos - lpos);
return lval + (fraction * (uval - lval));
- }
+ }
/* x is a control point in the data */
_lookup_cache.left = -1;
}
return rt_safe_earliest_event_unlocked(start, end, x, y, inclusive);
-}
+}
/** Get the earliest event between \a start and \a end, using the current interpolation style.
bool
ControlList::rt_safe_earliest_event_unlocked(double start, double end, double& x, double& y, bool inclusive) const
{
- if (_interpolation == Discrete)
+ if (_interpolation == Discrete) {
return rt_safe_earliest_event_discrete_unlocked(start, end, x, y, inclusive);
- else
+ } else {
return rt_safe_earliest_event_linear_unlocked(start, end, x, y, inclusive);
-}
+ }
+}
/** Get the earliest event between \a start and \a end (Discrete (lack of) interpolation)
} else {
return false;
}
-
+
/* No points in range */
} else {
return false;
//<< ", x: " << x << ", y: " << y << ", inclusive: " << inclusive << ")" << endl;
const_iterator length_check_iter = _events.begin();
- if (_events.empty()) // 0 events
+ if (_events.empty()) { // 0 events
return false;
- else if (_events.end() == ++length_check_iter) // 1 event
+ } else if (_events.end() == ++length_check_iter) { // 1 event
return rt_safe_earliest_event_discrete_unlocked(start, end, x, y, inclusive);
+ }
// Hack to avoid infinitely repeating the same event
build_search_cache_if_necessary(start, end);
-
+
pair<const_iterator,const_iterator> range = _search_cache.range;
if (range.first != _events.end()) {
first = *prev;
next = *range.first;
}
-
+
if (inclusive && first->when == start) {
x = first->when;
y = first->value;
assert(x >= start);
return true;
}
-
+
if (fabs(first->value - next->value) <= 1) {
if (next->when <= end && (next->when > start)) {
x = next->when;
y = floor(y);
x = first->when + (y - first->value) / (double)slope;
-
+
while ((inclusive && x < start) || (x <= start && y != next->value)) {
-
+
if (first->value < next->value) // ramping up
y += 1.0;
else // ramping down
x = first->when + (y - first->value) / (double)slope;
}
- cerr << first->value << " @ " << first->when << " ... "
+ /*cerr << first->value << " @ " << first->when << " ... "
<< next->value << " @ " << next->when
- << " = " << y << " @ " << x << endl;
+ << " = " << y << " @ " << x << endl;*/
assert( (y >= first->value && y <= next->value)
|| (y <= first->value && y >= next->value) );
-
+
const bool past_start = (inclusive ? x >= start : x > start);
if (past_start && x < end) {
/* Move left of cache to this point
} else {
return false;
}
-
+
/* No points in the future, so no steps (towards them) in the future */
} else {
return false;
for (iterator x = start; x != end; ) {
iterator tmp;
-
+
tmp = x;
++tmp;
-
+
nal->_events.push_back (new ControlEvent (**x));
_events.erase (x);
-
+
reposition_for_rt_add (0);
x = tmp;
return nal;
}
+/** @param op 0 = cut, 1 = copy, 2 = clear */
boost::shared_ptr<ControlList>
ControlList::cut_copy_clear (double start, double end, int op)
{
boost::shared_ptr<ControlList> nal = create (_parameter);
+
iterator s, e;
- ControlEvent cp (start, 0.0);
bool changed = false;
-
+
{
Glib::Mutex::Lock lm (_lock);
+ /* find the first event in our list that is at or before `start' in time */
+ ControlEvent cp (start, 0.0);
if ((s = lower_bound (_events.begin(), _events.end(), &cp, time_comparator)) == _events.end()) {
return nal;
}
+ /* and the last that is at or after `end' */
cp.when = end;
e = upper_bound (_events.begin(), _events.end(), &cp, time_comparator);
}
for (iterator x = s; x != e; ) {
- iterator tmp;
-
- tmp = x;
+ iterator tmp = x;
++tmp;
changed = true;
-
+
/* adjust new points to be relative to start, which
has been set to zero.
*/
-
+
if (op != 2) {
nal->_events.push_back (new ControlEvent ((*x)->when - start, (*x)->value));
}
if (op != 1) {
_events.erase (x);
}
-
+
x = tmp;
}
{
Glib::Mutex::Lock lm (_lock);
-
+
for (iterator x = start; x != end; ) {
iterator tmp;
-
+
tmp = x;
++tmp;
-
+
nal->_events.push_back (new ControlEvent (**x));
-
+
x = tmp;
}
}
_events.insert (where, new ControlEvent( (*i)->when+pos,( *i)->value));
end = (*i)->when + pos;
}
-
-
- /* move all points after the insertion along the timeline by
+
+
+ /* move all points after the insertion along the timeline by
the correct amount.
*/
maybe_signal_changed ();
}
+void
+ControlList::set_interpolation (InterpolationStyle s)
+{
+ if (_interpolation == s) {
+ return;
+ }
+
+ _interpolation = s;
+ InterpolationChanged (s); /* EMIT SIGNAL */
+}
+
} // namespace Evoral
projects / ardour.git / blobdiff