From 5293c19d9e6842732c9901ea7647eaeada14b644 Mon Sep 17 00:00:00 2001
From: "google-labs-jules[bot]"
 <161369871+google-labs-jules[bot]@users.noreply.github.com>
Date: Sun, 19 Jul 2026 14:17:05 +0000
Subject: [PATCH 1/3] perf: optimize handleSaveAll with O(1) map lookup

Replaces the O(N * M) recursive lookup inside the save-all loop with an
O(N + M) map-based lookup. The file tree is traversed once before the
loop to construct a flat Map of file paths to items, allowing O(1)
lookups during iteration.

Co-authored-by: beingniloy <235952944+beingniloy@users.noreply.github.com>
---
 .jules/bolt.md                     |  4 ++++
 src/contexts/FileSystemContext.tsx | 16 +++++++++++++++-
 2 files changed, 19 insertions(+), 1 deletion(-)

diff --git a/.jules/bolt.md b/.jules/bolt.md
index 24d688a..b568c9b 100644
--- a/.jules/bolt.md
+++ b/.jules/bolt.md
@@ -1,3 +1,7 @@
 ## 2026-07-17 - [Static Analysis Scan Cache]
 **Learning:** Workspace static analysis recursively crawls all project files, performing regex and string scanning for warnings (e.g. empty blocks, `console.log`, TODO/FIXME). When typing, React's state is updated and the entire file tree is re-scanned repeatedly on every keystroke, which causes significant performance lag and blocking UI in large workspaces.
 **Action:** Use a `WeakMap` to cache computed static analysis results per-item based on the immutable `FileSystemItem` object references. When React does an immutable update, unchanged files retain their reference and bypass re-scanning by using the cache, while only modified files (with new references) are re-evaluated. Old references are automatically garbage collected.
+
+## 2026-07-20 - [O(1) Map Lookups in Save All Operation]
+**Learning:** When performing a "Save All" operation on multiple dirty tabs, performing a recursive tree-search look-up (like `findFileInTree`) for each tab within a loop leads to an $O(N \times M)$ runtime complexity, where $N$ is the number of files in the file tree and $M$ is the number of tabs being saved. This can cause visible blocking lags in workspace interaction when handling large repositories or saving numerous tabs at once.
+**Action:** Before looping over the tabs, traverse the file tree once to build a flat `Map` keyed by file path in $O(N)$ time. Look up file nodes inside the loop using the `Map` in $O(1)$ time, reducing the overall complexity of the lookups in the loop to $O(N + M)$.
diff --git a/src/contexts/FileSystemContext.tsx b/src/contexts/FileSystemContext.tsx
index f08e81e..a505197 100644
--- a/src/contexts/FileSystemContext.tsx
+++ b/src/contexts/FileSystemContext.tsx
@@ -365,9 +365,23 @@ export function FileSystemProvider({ children }: { children: ReactNode }) {
   const handleSaveAll = useCallback(async () => {
     if (window.electronAPI) {
       try {
+        // Build a Map of files for O(1) lookups
+        const fileMap = new Map<string, FileSystemItem>();
+        const buildMap = (items: FileSystemItem[]) => {
+          for (const item of items) {
+            if (!item.isFolder) {
+              fileMap.set(item.path, item);
+            }
+            if (item.children) {
+              buildMap(item.children);
+            }
+          }
+        };
+        buildMap(files);
+
         for (const tab of openTabs) {
           if (tab.isDirty && tab.path !== 'welcome' && !tab.path.startsWith('docs/')) {
-            const fileNode = findFileInTree(files, tab.path);
+            const fileNode = fileMap.get(tab.path);
             if (fileNode) {
               await window.electronAPI.writeFile(tab.path, fileNode.content || '');
             }

From 125c3e77d79b07842994fd978b784f38aef0b365 Mon Sep 17 00:00:00 2001
From: "google-labs-jules[bot]"
 <161369871+google-labs-jules[bot]@users.noreply.github.com>
Date: Sun, 19 Jul 2026 14:18:38 +0000
Subject: [PATCH 2/3] perf: optimize handleSaveAll with O(1) map lookup

Replaces the O(N * M) recursive lookup inside the save-all loop with an
O(N + M) map-based lookup. The file tree is traversed once before the
loop to construct a flat Map of file paths to items, allowing O(1)
lookups during iteration.

Co-authored-by: beingniloy <235952944+beingniloy@users.noreply.github.com>

From aff2fd94d7b5b14a08d2088dbd16c223196dba76 Mon Sep 17 00:00:00 2001
From: "google-labs-jules[bot]"
 <161369871+google-labs-jules[bot]@users.noreply.github.com>
Date: Sun, 19 Jul 2026 14:20:24 +0000
Subject: [PATCH 3/3] perf: optimize handleSaveAll with O(1) map lookup

Replaces the O(N * M) recursive lookup inside the save-all loop with an
O(N + M) map-based lookup. The file tree is traversed once before the
loop to construct a flat Map of file paths to items, allowing O(1)
lookups during iteration.

Co-authored-by: beingniloy <235952944+beingniloy@users.noreply.github.com>