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-07-15 - Optimize array and map operations in tight loops
**Learning:** Using `Array.prototype.reduce`/`forEach` and `Map` incurs significant callback allocation, garbage collection, and hash-lookup overhead in hot paths (like `computeTaskMetrics`).
**Action:** Replace them with standard `for` loops and `Float64Array`/`Int32Array` when processing lists sequentially and caching numeric primitive values.
24 changes: 15 additions & 9 deletions app.js
Original file line number Diff line number Diff line change
Expand Up @@ -1370,21 +1370,27 @@ 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 tasks = state.tasks;
const len = tasks.length;
// ⚡ Bolt: Use Float64Array and for loop to avoid JS engine object allocation, GC, and hash-lookup overhead.
const durationCache = new Float64Array(len);
let totalDays = 0;

for(let i = 0; i < len; i++) {
const task = tasks[i];
const duration = calculateDurationDays(task.plannedStartDate, task.plannedEndDate);
durationCache.set(task.id, duration);
return sum + duration;
}, 0);
durationCache[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);
for(let i = 0; i < len; i++) {
const task = tasks[i];
const durationDays = durationCache[i];
Comment on lines +1373 to +1393

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: Index-aligned cache equivalent to id-keyed Map

The duration cache moved from a Map keyed by task.id to a Float64Array indexed by loop position. Both loops walk state.tasks over the same range in one synchronous call, so durationCache[i] refers to the same task. byTask stays keyed by task.id and consumers are unchanged. Behavior is equivalent.

Devin Review

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

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 +1414,7 @@ function computeTaskMetrics() {
plannedDateWarning,
actualDateWarning
});
});
}

return {
totalDays,
Expand Down
Loading