improve seek algorithmic complexity O(n) -> O(log(n))

This commit is contained in:
2026-02-27 07:05:23 -08:00
parent c3cca22839
commit 197f840246
7 changed files with 73 additions and 34 deletions

View File

@@ -56,7 +56,7 @@ function set_scale(new_scale) {
// Controls
document.getElementById("control_reset").addEventListener("click", (e) => {
playback.set_head_time(elapsed(), 0.0);
playback.set_head_time(bot, elapsed(), 0.0);
});
document.getElementById("control_pause").addEventListener("click", (e) => {
paused = !paused;
@@ -65,12 +65,12 @@ document.getElementById("control_pause").addEventListener("click", (e) => {
document.getElementById("control_forward").addEventListener("click", (e) => {
const time_now = elapsed();
const playback_time = playback.get_head_time(time_now);
playback.set_head_time(time_now, playback_time + 2.0);
playback.set_head_time(bot, time_now, playback_time + 2.0);
});
document.getElementById("control_backward").addEventListener("click", (e) => {
const time_now = elapsed();
const playback_time = playback.get_head_time(time_now);
playback.set_head_time(time_now, playback_time - 2.0);
playback.set_head_time(bot, time_now, playback_time - 2.0);
});
document.getElementById("control_slower").addEventListener("click", (e) => {
set_scale((scale * 4) / 5);