⚡ Bolt: Optimize Job Event Sequence Number Calculation - #161
Conversation
Replaced `list_for_job` array indexing with a direct `get_max_sequence_no` SQLAlchemy query across job services to avoid memory overhead when calculating the next sequence number. Includes a critical learning entry in `.jules/bolt.md`. Co-authored-by: crabcanon <3458947+crabcanon@users.noreply.github.com>
|
The latest updates on your projects. Learn more about Vercel for GitHub.
|
|
👋 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. |
1 participant
💡 What: Replaced loading all job events into memory (
list_for_jobarray indexing) with a direct SQL aggregation (get_max_sequence_no) in the repository.🎯 Why: Retrieving a list of potentially thousands of job events just to find the max sequence number causes an N+1 query-like memory and CPU overhead.
📊 Impact: Reduces memory overhead and network payload size from O(n) to O(1) during job event appends.
🔬 Measurement: Verify changes in
apps/api/src/cortex_api/services/jobs.pyandpackages/*/src/*/jobs.pyfiles. Tests run passing.PR created automatically by Jules for task 3374161818851354395 started by @crabcanon