⚡ Bolt: Optimize time-series lookups with O(log n) binary search

[toreleon]

💡 What: Replaced O(n) .filter() array operations with O(log n) binary search lookups (findFirstBarIndex and findLastBarIndex) when clipping time-series bars in clipBars and calculating interval closures in intervalCloses.
🎯 Why: Time-series arrays (OHLCV bars) are chronologically sorted and queried constantly during tight loop iterations in backtesting (src/agent/backtestRunner.ts). The redundant O(n) array filtering and sorting operations degraded performance during heavy analysis loops.
📊 Impact: Reduced the computational complexity of time-bound sub-interval extraction from O(n log n) to O(log n), significantly speeding up historical lookups and large-scale backtesting loops.
🔬 Measurement: Verify correctness and test coverage by running pnpm test (all 91 tests should pass). Time complexity reduction is analytically verified.

---

PR created automatically by Jules for task 18389161523581407059 started by @toreleon

[google-labs-jules]

👋 Jules, reporting for duty! I'm here to lend a hand with this pull request.

When you start a review, I'll add a 👀 emoji to each comment to let you know I've read it. I'll focus on feedback directed at me and will do my best to stay out of conversations between you and other bots or reviewers to keep the noise down.

I'll push a commit with your requested changes shortly after. Please note there might be a delay between these steps, but rest assured I'm on the job!

For more direct control, you can switch me to Reactive Mode. When this mode is on, I will only act on comments where you specifically mention me with @jules. You can find this option in the Pull Request section of your global Jules UI settings. You can always switch back!

New to Jules? Learn more at jules.google/docs.

---

For security, I will only act on instructions from the user who triggered this task.