1 files changed, 1 insertions, 77 deletions

diff --git a/frontend/lib/drive_server.ts b/frontend/lib/drive_server.ts
index 41b9c71..8af0356 100644
--- a/frontend/lib/drive_server.ts
+++ b/frontend/lib/drive_server.ts
@@ -1,5 +1,5 @@
 import { spawnSync } from 'child_process'
-import { DriveLsEntry, DriveTreeNode, DriveTreeResponse, DriveLogEntry } from './drive_types'
+import { DriveLsEntry, DriveLogEntry } from './drive_types'
 import { Drive_split_path, Drive_basename } from './drive_shared'
 
 /**
@@ -120,82 +120,6 @@ export async function Drive_stat(path: string): Promise<string> {
   return result.stdout.trim();
 }
 
-/// builds a filesystem tree from Drive_ls entries
-export async function Drive_tree(): Promise<DriveTreeResponse> {
-  const entries = await Drive_ls('/', true);
-  
-  const nodesMap = new Map<string, DriveTreeNode>();
-  const rootNodes: DriveTreeNode[] = [];
-
-  // First pass: create all nodes
-  entries.forEach(entry => {
-    const node: DriveTreeNode = {
-      path: entry.path,
-      name: Drive_basename(entry.path),
-      type: entry.type,
-      lastmod: entry.lastmod,
-      blob: entry.blob,
-      size: entry.size,
-      author: entry.author,
-      children: entry.type === "dir" ? [] : undefined
-    };
-    nodesMap.set(entry.path, node);
-  });
-
-  // Second pass: build hierarchy
-  entries.forEach(entry => {
-    const pathParts = Drive_split_path(entry.path);
-    const node = nodesMap.get(entry.path)!;
-    
-    if (pathParts.length === 1) {
-      // Root level item
-      rootNodes.push(node);
-    } else {
-      // Find parent path by reconstructing it
-      const parentParts = pathParts.slice(0, -1);
-      const parentPath = '/' + parentParts.join('/');
-      const parent = nodesMap.get(parentPath);
-      
-      if (parent && parent.children) {
-        parent.children.push(node);
-      } else {
-        // If parent not found, add to root
-        rootNodes.push(node);
-      }
-    }
-  });
-
-  // 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;
-      if (a.type === "file" && b.type === "dir") return 1;
-      
-      // Both same type, sort alphabetically by name (case-insensitive)
-      return a.name.toLowerCase().localeCompare(b.name.toLowerCase());
-    });
-
-    return sorted;
-  };
-
-  return { root: calculateSizesAndSort(rootNodes) };
-}
 
 /// lists only directories (recursively) from the given path
 export async function Drive_ls_directories(path: string = '/'): Promise<DriveLsEntry[]> {