⚡ Bolt: Optimize array allocations in ticker discovery - #109
Conversation
Co-authored-by: toreleon <42534763+toreleon@users.noreply.github.com>
|
👋 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 New to Jules? Learn more at jules.google/docs. For security, I will only act on instructions from the user who triggered this task. |
Co-authored-by: toreleon <42534763+toreleon@users.noreply.github.com>
💡 What: Replaced O(N)
.map(),.slice(), and.reduce()calls with in-place indexedforloops inbuildCandidateandrsi14functions withinsrc/tools/discover.ts.🎯 Why: To reduce unnecessary memory allocations and garbage collection overhead during the frequently executed ticker discovery process (which processes up to 12 candidates concurrently out of hundreds of tickers).
📊 Impact: Expected to reduce memory footprint and garbage collection pauses, making the candidate discovery process faster and more stable when filtering large stock universes.
🔬 Measurement: Run
pnpm test tests/discover.test.tsto verify the functionality remains identical. Profiling thediscoverTickersfunction will show reduced object allocation counts.PR created automatically by Jules for task 11773082166246151397 started by @toreleon