⚡ Bolt: Binary search optimizations for time-series extraction

[toreleon]

💡 What: Replaced $O(n)$ .filter() and .sort() operations with $O(\log n)$ binary searches followed by .slice() for time-series array lookups.
🎯 Why: Chronologically sorted timeseries arrays were being fully scanned via .filter() multiple times per turn inside the backtest runner and during OHLCV data retrieval.
📊 Impact: Reduces time complexity of date-bounded array lookups from $O(n)$ to $O(\log n + k)$. Improves backtest start times and interval clipping for large sets of bar data.
🔬 Measurement: Verify via pnpm test that backtest bounds logic (tests/clock.test.ts, tests/team.test.ts) behaves exactly as before but with reduced CPU overhead per interval lookup.

---

PR created automatically by Jules for task 8251011949286860423 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.