Skip to content
Closed
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
3 changes: 3 additions & 0 deletions .jules/bolt.md
Original file line number Diff line number Diff line change
Expand Up @@ -4,3 +4,6 @@
## 2026-07-12 - Optimize renderTaskRow DOM allocations
**Learning:** Caching unattached template nodes and instantiating them via `.cloneNode(false)` reduces DOM instantiation overhead in O(N) render loops significantly.
**Action:** Apply this optimization to other hot-path rendering elements such as rows, cells, and stack containers.
## 2026-08-22 - Array reduce/forEach 및 Map 오버헤드 최적화
**Learning:** computeTaskMetrics와 같이 자주 호출되는 O(N) 순회 로직에서 JS 내장 배열 메서드(reduce, forEach)와 Map을 사용하면 콜백 할당, GC, 해시 검색 오버헤드로 인해 성능 저하가 발생합니다.
**Action:** 성능이 중요한 반복문에서는 일반 for 루프와 TypedArray(Int32Array)를 사용하여 JS 엔진 오버헤드를 최소화합니다.
26 changes: 17 additions & 9 deletions app.js
Original file line number Diff line number Diff line change
Expand Up @@ -1370,21 +1370,29 @@ function validateDateRange(startLabel, startValue, endLabel, endValue, errors) {
}

function computeTaskMetrics() {
// ⚡ Bolt: Cache durationDays during total calculation to avoid recalculating for every task
const durationCache = new Map();
const totalDays = state.tasks.reduce((sum, task) => {
const length = state.tasks.length;
// ⚡ Bolt: Use Int32Array to avoid object allocation and GC overhead for numeric caching
const durations = new Int32Array(length);
let totalDays = 0;

// ⚡ Bolt: Replace Array.reduce with a standard for loop to eliminate callback allocation overhead
for (let i = 0; i < length; i++) {
const task = state.tasks[i];
const duration = calculateDurationDays(task.plannedStartDate, task.plannedEndDate);
durationCache.set(task.id, duration);
return sum + duration;
}, 0);
durations[i] = duration;
totalDays += duration;
}

const baseDate = state.baseDate;
const byTask = new Map();
let totalWeightedPlannedRatio = 0;
let totalWeightedActualRatio = 0;

state.tasks.forEach((task) => {
const durationDays = durationCache.get(task.id);
// ⚡ Bolt: Replace Array.forEach with a standard for loop to eliminate callback allocation overhead
for (let i = 0; i < length; i++) {
const task = state.tasks[i];
// ⚡ Bolt: Avoid Map hash lookup for durations
const durationDays = durations[i];
const weightRatio = totalDays > 0 ? durationDays / totalDays : 0;
const plannedProgressRatio = calculatePlannedProgressRatio(baseDate, task.plannedStartDate, task.plannedEndDate, durationDays);
const actualProgressRatio = (ACTUAL_PROGRESS_MAP[task.actualProgressStatus] || 0) / 100;
Expand All @@ -1408,7 +1416,7 @@ function computeTaskMetrics() {
plannedDateWarning,
actualDateWarning
});
});
}
Comment on lines 1416 to +1419

Copy link
Copy Markdown

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

📝 Info: Int32Array cache stays equivalent to old Map

calculateDurationDays only returns integers, so Int32Array storage causes no truncation. Both loops walk state.tasks in the same order and length, so index i aligns with the old task.id keying. durations[i] is always a number, leaving the durationDays !== undefined branch in calculatePlannedProgressRatio unchanged.

(Refers to this code)

Open in Devin Review

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


return {
totalDays,
Expand Down
Loading