Skip to content
Open
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
4 changes: 4 additions & 0 deletions .jules/bolt.md
Original file line number Diff line number Diff line change
Expand Up @@ -60,3 +60,7 @@ Optimized metric route processing to O(N) by creating a mapping of routes direct
## 2026-06-25 - Avoid Map allocations in frontend ERD loops and mutate asyncpg records in-place
**Learning:** The frontend `snapshotToGraph` iterates over thousands of columns to generate the graph, so repeated lookups and redundant collection assignments increase GC pressure. Backend snapshot column dictionaries are freshly instantiated for the payload, so `add_column_examples` can safely fill missing fields in place.
**Action:** Reuse existing collections while aggregating relational data, create `Map`/`Set` entries only on first use, and check for missing example fields before calling expensive inference helpers.

## 2024-05-18 - [Optimize Array Spreads and FlatMap Operations During Frontend Search]
**Learning:** Using `Array.flatMap(...)` and array spread syntax (`...`) inside large iteration loops (like filtering a large subset of ERD nodes on the frontend) creates numerous temporary array allocations, leading to heavy Garbage Collection (GC) overhead and significantly decreasing UI performance.
**Action:** Replace `flatMap()` and array spreads with standard iterative loops and explicit value accumulations (e.g. string concatenation `+=`) to avoid intermediate allocations when filtering or constructing large composite properties on the fly.
19 changes: 7 additions & 12 deletions frontend/src/App.tsx
Original file line number Diff line number Diff line change
Expand Up @@ -182,18 +182,13 @@ export default function App() {
if (!normalizedNodeSearch) return new Set<string>();
const matches = new Set<string>();
for (const node of nodes) {
const haystack = [
node.data.title,
node.data.comment ?? "",
...node.data.columns.flatMap((column) => [
column.column_name,
column.data_type,
column.column_comment ?? "",
]),
]
.join(" ")
.toLocaleLowerCase();
if (haystack.includes(normalizedNodeSearch)) {
// ⚑ Bolt: Iterate through strings directly instead of array flatMap and join, which reduces GC and allocations
let haystack = node.data.title + " " + (node.data.comment ?? "") + " ";
for (let i = 0; i < node.data.columns.length; i++) {
const column = node.data.columns[i];
haystack += column.column_name + " " + column.data_type + " " + (column.column_comment ?? "") + " ";
}
if (haystack.toLocaleLowerCase().includes(normalizedNodeSearch)) {
matches.add(node.id);
}
}
Expand Down