⚡ Bolt: computeTaskMetrics 루프 최적화

[seonghobae]

💡 무엇을

• app.js의 computeTaskMetrics 함수 내에서 사용하던 Map 캐싱 로직을 제거하고, 대신 Task 개수만큼 미리 할당된 Typed Array(Int32Array)를 사용하도록 변경했습니다.
• reduce와 forEach 같은 고차 함수(Higher-Order Functions)를 이용한 순회를 성능이 더 우수한 기본 for 루프로 교체했습니다.

🎯 왜

• computeTaskMetrics는 화면 렌더링 사이클 등에서 매우 빈번하게 호출되는 핵심 병목(Hot-path) 함수입니다.
• 기존에 사용된 Map은 삽입(set) 및 탐색(get) 시 해시 룩업(Hash-lookup) 비용이 발생합니다.
• reduce 및 forEach 배열 메서드는 JS 엔진 수준에서 매 순회마다 콜백 함수를 호출해야 하므로 할당 및 실행(Execution) 오버헤드, 가비지 컬렉션(GC) 압박을 유발합니다.
• 배열 인덱스를 이용한 접근과 기본 for 루프를 사용하면 이 두 가지 병목 요소를 완전히 제거하여 O(N) 순회의 성능을 극대화할 수 있습니다.

📊 영향

• JS 콜백 엔진 오버헤드가 제거되어 각 반복 작업에서의 런타임이 크게 줄어듭니다.
• Map 대신 고정 길이 타입 기반 배열(Int32Array)을 사용하여 메모리 힙 단편화와 가비지 컬렉터 부하를 완화했습니다. (큰 프로젝트에서 속도 개선 폭이 더 커짐)

🔬 측정

• 크롬 DevTools의 Performance 탭을 통해 수 천개의 Task를 가진 프로젝트 렌더링 시, computeTaskMetrics 함수의 Scripting Time이 눈에 띄게 감소함을 확인할 수 있습니다.

---

PR created automatically by Jules for task 8282498630000302187 started by @seonghobae

---

[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.

[coderabbitai]

Warning

Review limit reached

Next included review available in 45 minutes.

View limit details

Limit details: You’ve used the included review currently available.

You've used all free OSS reviews for now. Wait for the free limit to reset to keep reviewing this public repository.

Learn how review limits work.

Review configuration:

⚙️ Run configuration

Configuration used: Organization UI

Review profile: CHILL

Plan: Pro Plus

Run ID: e2844315-7df8-4a9a-9aa2-b1d20c13cf37

📥 Commits

Reviewing files that changed from the base of the PR and between 2c32887 and 95a7ba1.

📒 Files selected for processing (2)

• .jules/bolt.md
• app.js

---

Thanks for using CodeRabbit! It's free for OSS, and your support helps us grow. If you like it, consider giving us a shout-out.

❤️ Share

• X
• Mastodon
• Reddit
• LinkedIn

_{Comment @coderabbitai help to get the list of available commands.}

[devin-ai-integration]

Devin Review found 1 potential issue.

[devin-ai-integration]

📝 Info: Int32Array cache is behaviorally equivalent

Both loops iterate state.tasks in the same order over the unchanged array, so index alignment holds. calculateDurationDays returns non-negative integers within Int32 range given the 4-digit year cap, so no truncation. The index-based cache is more robust to duplicate task ids than the old id-keyed Map.

(Refers to this code)

---

Was this helpful? React with 👍 or 👎 to provide feedback.

[seonghobae]

Closing this lane as semantically superseded by #508, not as a merge-readiness judgment.

Fresh comparison against the same protected base develop@2c328875e00e86537df3e965170be80532571cad shows #613 at exact head 95a7ba1a045db3974e48a7a9ac2bed420adba0ad changes only .jules/bolt.md and app.js, implementing the same computeTaskMetrics() production transformation already owned by #508: duration-cache Map → index-aligned Int32Array, plus callback-heavy reduce/forEach → indexed loops while preserving the existing byTask map/result contract.

#508 at exact head 388406f030e5d0c5f0537d6ceae0d9199e7a0f58 preserves that production behavior and uniquely carries the executable evidence needed to defend it: registered unit/browser benchmark paths, immutable base/head source loading, semantic parity checks, counterbalanced 10,000-task A/B execution, bounded retries, fail-closed revision validation, and the performance threshold. #613 adds no unique buyer-visible behavior or regression contract that needs to be preserved separately; its extra local totalTasks binding is an implementation-level micro-variation rather than distinct product value.

Current #613 review state also remains non-authorizing: CodeRabbit is rate-limited, Devin’s only current thread is informational semantic-equivalence evidence, and all six current-head workflow runs are queued. Those waits do not justify keeping a duplicate production lane open when the stronger owning lane already exists.

Therefore #508 remains the single owning performance/evidence lane for this optimization.

[google-labs-jules]

Closing this lane as semantically superseded by #508, not as a merge-readiness judgment.

Fresh comparison against the same protected base develop@2c328875e00e86537df3e965170be80532571cad shows #613 at exact head 95a7ba1a045db3974e48a7a9ac2bed420adba0ad changes only .jules/bolt.md and app.js, implementing the same computeTaskMetrics() production transformation already owned by #508: duration-cache Map → index-aligned Int32Array, plus callback-heavy reduce/forEach → indexed loops while preserving the existing byTask map/result contract.

#508 at exact head 388406f030e5d0c5f0537d6ceae0d9199e7a0f58 preserves that production behavior and uniquely carries the executable evidence needed to defend it: registered unit/browser benchmark paths, immutable base/head source loading, semantic parity checks, counterbalanced 10,000-task A/B execution, bounded retries, fail-closed revision validation, and the performance threshold. #613 adds no unique buyer-visible behavior or regression contract that needs to be preserved separately; its extra local totalTasks binding is an implementation-level micro-variation rather than distinct product value.

Current #613 review state also remains non-authorizing: CodeRabbit is rate-limited, Devin’s only current thread is informational semantic-equivalence evidence, and all six current-head workflow runs are queued. Those waits do not justify keeping a duplicate production lane open when the stronger owning lane already exists.

Therefore #508 remains the single owning performance/evidence lane for this optimization.

Understood. Acknowledging that this work is now obsolete and superseded by #508, and stopping work on this task.