Lines Matching refs:_events
72 _lookup_cache.range.first = _events.end(); in ControlList()
73 _lookup_cache.range.second = _events.end(); in ControlList()
75 _search_cache.first = _events.end(); in ControlList()
81 most_recent_insert_iterator = _events.end(); in ControlList()
92 _lookup_cache.range.first = _events.end(); in ControlList()
93 _lookup_cache.range.second = _events.end(); in ControlList()
94 _search_cache.first = _events.end(); in ControlList()
100 most_recent_insert_iterator = _events.end(); in ControlList()
114 _lookup_cache.range.first = _events.end(); in ControlList()
115 _lookup_cache.range.second = _events.end(); in ControlList()
116 _search_cache.first = _events.end(); in ControlList()
132 most_recent_insert_iterator = _events.end(); in ControlList()
139 for (EventList::iterator x = _events.begin(); x != _events.end(); ++x) { in ~ControlList()
142 _events.clear (); in ~ControlList()
156 return _events == other._events; in operator ==()
189 for (EventList::iterator x = _events.begin(); x != _events.end(); ++x) { in copy_events()
192 _events.clear (); in copy_events()
195 _events.push_back (new ControlEvent ((*i)->when, (*i)->value)); in copy_events()
242 for (EventList::iterator x = _events.begin(); x != _events.end(); ++x) { in clear()
245 _events.clear (); in clear()
264 if (_events.empty() || _events.back()->when == when) { in extend_to()
267 double factor = when / _events.back()->when; in extend_to()
277 for (iterator i = _events.begin(); i != _events.end(); ++i) { in y_transform()
295 for (iterator i = _events.begin(); i != _events.end(); ++i) { in list_merge()
304 for (iterator j = _events.begin(); j != _events.end(); ++j) { in list_merge()
319 for (EventList::iterator x = _events.begin(); x != _events.end(); ++x) { in list_merge()
322 _events.clear (); in list_merge()
323 _events = nel; in list_merge()
335 for (iterator i = _events.begin(); i != _events.end(); ++i) { in _x_scale()
368 …DEBUG_TRACE (DEBUG::ControlList, string_compose ("@%1 thin from %2 events\n", this, _events.size()… in thin()
370 for (iterator i = _events.begin(); i != _events.end(); ++i) { in thin()
393 _events.erase (tmp); in thin()
404 …DEBUG_TRACE (DEBUG::ControlList, string_compose ("@%1 thin => %2 events\n", this, _events.size())); in thin()
422 _events.insert (_events.end(), new ControlEvent (when, value)); in fast_simple_add()
440 most_recent_insert_iterator = _events.end(); in unlocked_invalidate_insert_iterator()
446 if (_events.size() < 2) { in unlocked_remove_duplicates()
449 iterator i = _events.begin(); in unlocked_remove_duplicates()
451 while (i != _events.end()) { in unlocked_remove_duplicates()
453 i = _events.erase (i); in unlocked_remove_duplicates()
487 most_recent_insert_iterator = lower_bound (_events.begin(), _events.end(), &cp, time_comparator); in start_write_pass()
532 if ((s = lower_bound (_events.begin(), _events.end(), &cp, time_comparator)) != _events.end()) { in add_guard_point()
534 e = lower_bound (_events.begin(), _events.end(), &cp, time_comparator); in add_guard_point()
553 most_recent_insert_iterator = lower_bound (_events.begin(), _events.end(), &cp, time_comparator); in add_guard_point()
557 if (most_recent_insert_iterator == _events.end()) { in add_guard_point()
560 _events.push_back (new ControlEvent (when, eval_value)); in add_guard_point()
586 …most_recent_insert_iterator = _events.insert (most_recent_insert_iterator, new ControlEvent (when,… in add_guard_point()
611 iterator i = lower_bound (_events.begin(), _events.end(), &cp, time_comparator); in editor_add()
613 if (i != _events.end () && (*i)->when == when) { in editor_add()
620 if (_events.empty()) { in editor_add()
627 _events.insert (_events.end(), new ControlEvent (0, value)); in editor_add()
636 i = lower_bound (_events.begin(), _events.end(), &cp, time_comparator); in editor_add()
641 result = _events.insert (i, new ControlEvent (when, value)); in editor_add()
658 if (most_recent_insert_iterator != _events.end()) { in maybe_add_insert_guard()
664 most_recent_insert_iterator = _events.insert ( most_recent_insert_iterator, in maybe_add_insert_guard()
679 if (_events.empty()) { in maybe_insert_straight_line()
683 if (_events.back()->value == value) { in maybe_insert_straight_line()
685 EventList::iterator b = _events.end(); in maybe_insert_straight_line()
687 if (b == _events.begin()) { in maybe_insert_straight_line()
696 _events.back()->when = when; in maybe_insert_straight_line()
708 while (iter != _events.end()) { in erase_from_iterator_to()
712 iter = _events.erase (iter); in erase_from_iterator_to()
734 (most_recent_insert_iterator == _events.end()))); in add()
740 if (_events.empty() && with_initial) { in add()
747 _events.insert (_events.end(), new ControlEvent (0, opp_val)); in add()
751 _events.insert (_events.end(), new ControlEvent (0, value)); in add()
767 … most_recent_insert_iterator = lower_bound (_events.begin(), _events.end(), &cp, time_comparator); in add()
773 … (most_recent_insert_iterator == _events.end() || when > (*most_recent_insert_iterator)->when)) { in add()
777 if (most_recent_insert_iterator != _events.end()) { in add()
795 most_recent_insert_iterator = lower_bound (_events.begin(), _events.end(), &cp, time_comparator); in add()
800 if (most_recent_insert_iterator == _events.end()) { in add()
805 _events.push_back (new ControlEvent (when, value)); in add()
806 …DEBUG_TRACE (DEBUG::ControlList, string_compose ("\tactually appended, size now %1\n", _events.siz… in add()
809 most_recent_insert_iterator = _events.end(); in add()
828 if (_events.back()->when == when) { in add()
829 most_recent_insert_iterator = _events.end(); in add()
840 if (most_recent_insert_iterator != _events.begin ()) { in add()
845 if (most_recent_insert_iterator != _events.begin ()) { in add()
869 …EventList::iterator x = _events.insert (most_recent_insert_iterator, new ControlEvent (when, value… in add()
870 …olList, string_compose ("@%1 inserted new value before MRI, size now %2\n", this, _events.size())); in add()
888 _events.erase (i); in erase()
899 _events.erase (start, end); in erase()
919 _events.erase (i); in erase()
937 erased = erase_range_internal (start, endt, _events); in erase_range()
976 if (before == _events.end()) { in slide()
980 while (before != _events.end()) { in slide()
1003 erase_range_internal (pos, pos - frames, _events); in shift()
1010 for (iterator i = _events.begin(); i != _events.end(); ++i) { in shift()
1022 iterator s = lower_bound (_events.begin(), _events.end(), &cp, time_comparator); in shift()
1023 if (s != _events.end ()) { in shift()
1024 _events.insert (s, new ControlEvent (pos, v0)); in shift()
1029 iterator s = lower_bound (_events.begin(), _events.end(), &cp, time_comparator); in shift()
1030 if (s != _events.end ()) { in shift()
1031 _events.insert (s, new ControlEvent (pos - 1, v0)); in shift()
1036 iterator s = lower_bound (_events.begin(), _events.end(), &cp, time_comparator); in shift()
1037 _events.insert (s, new ControlEvent (pos, s == _events.end () ? v0 : v1)); in shift()
1067 _events.sort (event_time_less_than); in modify()
1087 ret.first = _events.end(); in control_points_adjacent()
1088 ret.second = _events.end(); in control_points_adjacent()
1090 …for (i = lower_bound (_events.begin(), _events.end(), &cp, time_comparator); i != _events.end(); +… in control_points_adjacent()
1092 if (ret.first == _events.end()) { in control_points_adjacent()
1094 if (i != _events.begin()) { in control_points_adjacent()
1131 _events.sort (event_time_less_than); in thaw()
1144 _lookup_cache.range.first = _events.end(); in mark_dirty()
1145 _lookup_cache.range.second = _events.end(); in mark_dirty()
1147 _search_cache.first = _events.end(); in mark_dirty()
1163 if (_events.empty()) { in truncate_end()
1167 if (last_coordinate == _events.back()->when) { in truncate_end()
1171 if (last_coordinate > _events.back()->when) { in truncate_end()
1176 iterator foo = _events.begin(); in truncate_end()
1179 if (foo == _events.end()) { in truncate_end()
1181 } else if (++foo == _events.end()) { in truncate_end()
1189 _events.push_back (new ControlEvent (last_coordinate, _events.back()->value)); in truncate_end()
1197 iterator penultimate = _events.end(); in truncate_end()
1201 if (_events.back()->value == (*penultimate)->value) { in truncate_end()
1202 _events.back()->when = last_coordinate; in truncate_end()
1204 _events.push_back (new ControlEvent (last_coordinate, _events.back()->value)); in truncate_end()
1216 i = _events.rbegin(); in truncate_end()
1228 uint32_t sz = _events.size(); in truncate_end()
1230 while (i != _events.rend() && sz > 2) { in truncate_end()
1240 _events.erase (i.base()); in truncate_end()
1246 _events.back()->when = last_coordinate; in truncate_end()
1247 _events.back()->value = last_val; in truncate_end()
1265 if (_events.empty()) { in truncate_start()
1268 } else if (overall_length == _events.back()->when) { in truncate_start()
1273 if (overall_length > _events.back()->when) { in truncate_start()
1277 double shift = overall_length - _events.back()->when; in truncate_start()
1280 for (np = 0, i = _events.begin(); i != _events.end(); ++i, ++np) { in truncate_start()
1287 _events.push_front (new ControlEvent (0, _events.front()->value)); in truncate_start()
1296 iterator second = _events.begin(); in truncate_start()
1299 if (_events.front()->value == (*second)->value) { in truncate_start()
1301 _events.front()->when = 0; in truncate_start()
1304 _events.push_front (new ControlEvent (0, _events.front()->value)); in truncate_start()
1312 first_legal_coordinate = _events.back()->when - overall_length; in truncate_start()
1319 i = _events.begin(); in truncate_start()
1321 while (i != _events.end() && !_events.empty()) { in truncate_start()
1331 _events.erase (i); in truncate_start()
1341 for (i = _events.begin(); i != _events.end(); ++i) { in truncate_start()
1347 _events.push_front (new ControlEvent (0, first_legal_value)); in truncate_start()
1365 const_iterator length_check_iter = _events.begin(); in unlocked_eval()
1367 if (length_check_iter == _events.end()) { in unlocked_eval()
1377 return _events.front()->value; in unlocked_eval()
1380 if (x >= _events.back()->when) { in unlocked_eval()
1381 return _events.back()->value; in unlocked_eval()
1382 } else if (x <= _events.front()->when) { in unlocked_eval()
1383 return _events.front()->value; in unlocked_eval()
1386 lpos = _events.front()->when; in unlocked_eval()
1387 lval = _events.front()->value; in unlocked_eval()
1388 upos = _events.back()->when; in unlocked_eval()
1389 uval = _events.back()->value; in unlocked_eval()
1408 if (x >= _events.back()->when) { in unlocked_eval()
1409 return _events.back()->value; in unlocked_eval()
1410 } else if (x <= _events.front()->when) { in unlocked_eval()
1411 return _events.front()->value; in unlocked_eval()
1432 EventList::const_iterator i = lower_bound (_events.begin(), _events.end(), &cp, time_comparator); in multipoint_eval()
1435 assert(i != _events.end()); in multipoint_eval()
1437 if (i == _events.begin() || (*i)->when == x) in multipoint_eval()
1447 (_lookup_cache.range.first == _events.end()) || in multipoint_eval()
1452 _lookup_cache.range = equal_range (_events.begin(), _events.end(), &cp, time_comparator); in multipoint_eval()
1463 if (range.first != _events.begin()) { in multipoint_eval()
1470 return _events.front()->value; in multipoint_eval()
1473 if (range.second == _events.end()) { in multipoint_eval()
1475 return _events.back()->value; in multipoint_eval()
1509 if (_events.empty()) { in build_search_cache_if_necessary()
1511 _search_cache.first = _events.end(); in build_search_cache_if_necessary()
1519 _search_cache.first = lower_bound (_events.begin(), _events.end(), &start_point, time_comparator); in build_search_cache_if_necessary()
1544 if (_search_cache.first != _events.end()) { in rt_safe_earliest_event_discrete_unlocked()
1587 const_iterator length_check_iter = _events.begin(); in rt_safe_earliest_event_linear_unlocked()
1588 if (_events.empty()) { // 0 events in rt_safe_earliest_event_linear_unlocked()
1590 } else if (_events.end() == ++length_check_iter) { // 1 event in rt_safe_earliest_event_linear_unlocked()
1601 if (_search_cache.first != _events.end()) { in rt_safe_earliest_event_linear_unlocked()
1618 if (_search_cache.first != _events.end()) { in rt_safe_earliest_event_linear_unlocked()
1623 if (_search_cache.first == _events.begin() || (*_search_cache.first)->when <= start) { in rt_safe_earliest_event_linear_unlocked()
1627 if (_search_cache.first == _events.end()) { in rt_safe_earliest_event_linear_unlocked()
1740 if ((s = lower_bound (_events.begin(), _events.end(), &cp, time_comparator)) == _events.end()) { in cut_copy_clear()
1746 e = upper_bound (_events.begin(), _events.end(), &cp, time_comparator); in cut_copy_clear()
1770 if (start > _events.front()->when) { in cut_copy_clear()
1771 _events.insert (s, (new ControlEvent (start, val))); in cut_copy_clear()
1776 nal->_events.push_back (new ControlEvent (0, val)); in cut_copy_clear()
1787 nal->_events.push_back (new ControlEvent ((*x)->when - start, (*x)->value)); in cut_copy_clear()
1791 x = _events.erase (x); in cut_copy_clear()
1797 if (e == _events.end() || (*e)->when != end) { in cut_copy_clear()
1802 if (op == 0 && (e != _events.end() && end < (*e)->when)) { // cut in cut_copy_clear()
1803 _events.insert (e, new ControlEvent (end, end_value)); in cut_copy_clear()
1806 if (op != 2 && (e != _events.end() && end < (*e)->when)) { // cut/copy in cut_copy_clear()
1807 nal->_events.push_back (new ControlEvent (end - start, end_value)); in cut_copy_clear()
1845 if (alist._events.empty()) { in paste()
1856 where = upper_bound (_events.begin(), _events.end(), &cp, time_comparator); in paste()
1879 _events.insert (where, new ControlEvent((*i)->when + pos, value)); in paste()
1888 while (where != _events.end()) { in paste()
1893 _events.erase(where); in paste()
1920 EventList old_events = _events; in move_ranges()
1926 if (erase_range_internal (i->from, i->from + i->length, _events)) { in move_ranges()
1930 if (erase_range_internal (i->to, i->to + i->length, _events)) { in move_ranges()
1949 _events.push_back (ev); in move_ranges()
1956 _events.sort (event_time_less_than); in move_ranges()
1998 if (_events.size() != other._events.size()) { in operator !=()
2002 EventList::const_iterator i = _events.begin (); in operator !=()
2003 EventList::const_iterator j = other._events.begin (); in operator !=()
2005 while (i != _events.end() && (*i)->when == (*j)->when && (*i)->value == (*j)->value) { in operator !=()
2010 if (i != _events.end ()) { in operator !=()
2027 if (_events.size () == 0) { in is_sorted()
2030 const_iterator i = _events.begin(); in is_sorted()
2032 while (++n != _events.end ()) { in is_sorted()
2046 for (EventList::iterator x = _events.begin(); x != _events.end(); ++x) { in dump()