This PR fixes #48. Since we now use binary search to find notes, the ordered list has to be sorted at all times, otherwise some notes won't be able to be found.
The only time where this sorting becomes invalidated is when we are moving notes along the timeline, so we now sort before invoking the move action, and we sort after each move action do/undo.
This PR fixes #48. Since we now use binary search to find notes, the ordered list has to be sorted at all times, otherwise some notes won't be able to be found.
The only time where this sorting becomes invalidated is when we are moving notes along the timeline, so we now sort before invoking the move action, and we sort after each move action do/undo.