Calculate directory sizes as sum of all contents

- Add recursive directory size calculation to Drive_tree
- Directory sizes now represent total size of all nested contents
- Rename sortNodes to calculateSizesAndSort for clarity
- Process children first (bottom-up) then calculate parent sizes
- Maintain existing sorting functionality

🤖 Generated with [Claude Code](https://claude.ai/code)

Co-Authored-By: Claude <[email protected]>

1 files changed, 18 insertions, 10 deletions

diff --git a/frontend/lib/drive_server.ts b/frontend/lib/drive_server.ts
index e6dd833..6531641 100644
--- a/frontend/lib/drive_server.ts
+++ b/frontend/lib/drive_server.ts
@@ -142,8 +142,23 @@ export async function Drive_tree(): Promise<DriveTreeResponse> {
     }
   });
 
-  // Third pass: sort all levels (directories first, then files, both alphabetically)
-  const sortNodes = (nodes: DriveTreeNode[]): DriveTreeNode[] => {
+  // Third pass: calculate directory sizes and sort all levels
+  const calculateSizesAndSort = (nodes: DriveTreeNode[]): DriveTreeNode[] => {
+    // First, recursively process children and calculate their sizes
+    nodes.forEach(node => {
+      if (node.children) {
+        node.children = calculateSizesAndSort(node.children);
+        
+        // If this is a directory, calculate its size as sum of all children
+        if (node.type === "dir") {
+          node.size = node.children.reduce((total, child) => {
+            return total + (child.size || 0);
+          }, 0);
+        }
+      }
+    });
+
+    // Then sort: directories first, then files, both alphabetically
     const sorted = nodes.sort((a, b) => {
       // Directories first, then files
       if (a.type === "dir" && b.type === "file") return -1;
@@ -153,15 +168,8 @@ export async function Drive_tree(): Promise<DriveTreeResponse> {
       return a.name.toLowerCase().localeCompare(b.name.toLowerCase());
     });
 
-    // Recursively sort children
-    sorted.forEach(node => {
-      if (node.children) {
-        node.children = sortNodes(node.children);
-      }
-    });
-
     return sorted;
   };
 
-  return { root: sortNodes(rootNodes) };
+  return { root: calculateSizesAndSort(rootNodes) };
 }
\ No newline at end of file