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-24 - Optimize computeTaskMetrics with Int32Array and standard loops
**Learning:** In hot loops over large array of tasks, using standard `for` loops and contiguous typed arrays (e.g., `Int32Array`) rather than standard `Map` caching and `Array.prototype.reduce`/`forEach` eliminates the overhead of JS engine callback allocation, garbage collection, and hash-lookups.
**Action:** Replace `Map` usages paired with functional iteration loops with standard indexed loops and TypedArrays for primitive data mappings whenever processing metrics for performance-critical high-iteration loops.
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) => {
// ⚡ Bolt: Use Int32Array instead of Map for O(1) contiguous memory access without hash overhead
// ⚡ Bolt: Replace reduce/forEach with standard for loops to eliminate JS engine callback allocation
const len = state.tasks.length;
const durationCache = new Int32Array(len);
let totalDays = 0;

for (let i = 0; i < len; i++) {
const task = state.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 = state.tasks[i];
const durationDays = durationCache[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 +1414,7 @@ function computeTaskMetrics() {
plannedDateWarning,
actualDateWarning
});
});
}
Comment on lines 1414 to +1417

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 substitution is behavior-preserving

Both loops walk state.tasks by identical index over an unchanged length, and calculateDurationDays only returns non-negative integers (app.js), so Int32Array storage loses no precision. Indexing by position also avoids the collision a duplicate task.id would have caused in the previous Map.

(Refers to this code)

Open in Devin Review

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


return {
totalDays,
Expand Down
Loading