smokephil/ardour
1
0
Fork 0
mirror of https://github.com/Ardour/ardour.git synced 2025-12-07 23:35:03 +01:00
Code Issues Projects Releases Wiki Activity

Fix O(n) search on MIDI rec region update (now O(log(n)) per update, but could be O(1) with caching...)

Browse source 
git-svn-id: svn://localhost/ardour2/branches/3.0@5843 d708f5d6-7413-0410-9779-e7cbd77b26cf
This commit is contained in:
David Robillard 2009-10-21 16:39:39 +00:00
parent 2c59ddede5
commit 86a09c58e3
3 changed files with 18 additions and 7 deletions
Download patch file Download diff file Expand all files Collapse all files

19
libs/evoral/src/Sequence.cpp
View file

@ -99,12 +99,10 @@ Sequence<Time>::const_iterator::const_iterator(const Sequence<Time>& seq, Time t
seq.read_lock();
// Find first note which begins after t
boost::shared_ptr< Note<Time> > search_note(new Note<Time>(0, t, 0, 0, 0));
_note_iter = seq.notes().lower_bound(search_note);
assert(_note_iter == seq.notes().end() || (*_note_iter)->time() >= t);
// Find first note which begins at or after t
_note_iter = seq.note_lower_bound(t);
// Find first sysex event after t
// Find first sysex event at or after t
for (typename Sequence<Time>::SysExes::const_iterator i = seq.sysexes().begin();
i != seq.sysexes().end(); ++i) {
if ((*i)->time() >= t) {
@ -776,6 +774,17 @@ Sequence<Time>::set_notes (const Sequence<Time>::Notes& n)
_notes = n;
}
/** Return the earliest note with time >= t */
template<typename Time>
typename Sequence<Time>::Notes::const_iterator
Sequence<Time>::note_lower_bound (Time t) const
{
boost::shared_ptr< Note<Time> > search_note(new Note<Time>(0, t, 0, 0, 0));
typename Sequence<Time>::Notes::const_iterator i = _notes.lower_bound(search_note);
assert(i == _notes.end() || (*i)->time() >= t);
return i;
}
template class Sequence<Evoral::MusicalTime>;
} // namespace Evoral