feat: Fix file tree handler, change colors

Author: roman-kiselenko

frontend/src/App.css

@@ -79,11 +79,11 @@ body {
 
 .dark {
   --background: oklch(0.141 0.005 285.823);
-  --foreground: #72a697;
+  --foreground: #cdd4d2;
   --card: oklch(0.21 0.006 285.885);
-  --card-foreground: #72a697;
+  --card-foreground: #cdd4d2;
   --popover: oklch(0.21 0.006 285.885);
-  --popover-foreground: #72a697;
+  --popover-foreground: #cdd4d2;
   --primary: oklch(0.92 0.004 286.32);
   --primary-foreground: oklch(0.21 0.006 285.885);
   --secondary: oklch(0.274 0.006 286.033);
@@ -102,7 +102,7 @@ body {
   --chart-4: oklch(0.627 0.265 303.9);
   --chart-5: oklch(0.645 0.246 16.439);
   --sidebar: oklch(0.21 0.006 285.885);
-  --sidebar-foreground: #72a697;
+  --sidebar-foreground: #cdd4d2;
   --sidebar-primary: oklch(0.488 0.243 264.376);
   --sidebar-primary-foreground: #72a697;
   --sidebar-accent: oklch(0.274 0.006 286.033);

frontend/src/components/views/RepoViewPage.tsx

@@ -67,6 +67,12 @@ export function RepoViewPage() {
           </div>
           <div className="flex flex-col gap-1"></div>
         </CardContent>
+        <CardContent className="px-4">
+          <div className="flex flex-col gap-1">
+           Another column
+          </div>
+          <div className="flex flex-col gap-1"></div>
+        </CardContent>
       </div>
     </div>
   );

pkg/route/files.go

@@ -18,6 +18,7 @@ type Node struct {
 }
 
 // buildFileTree constructs the hierarchical tree from a list of file paths
+// by creating a directory traversal structure
 func buildFileTree(paths []string) *Node {
 	root := &Node{
 		Name:  "",
@@ -26,45 +27,44 @@ func buildFileTree(paths []string) *Node {
 
 	for _, path := range paths {
 		isDir := strings.HasSuffix(path, "/")
-		path = strings.TrimSuffix(path, "/") // Remove trailing slash
+		path = strings.TrimSuffix(path, "/")
 
 		parts := strings.Split(path, "/")
 		current := root
 
-		// Traverse through the directory structure
 		for i := 0; i < len(parts)-1; i++ {
 			part := parts[i]
-			found := false
 
-			// Check if a child with this name already exists
+			// Find if a child with this name already exists
+			var found *Node
 			for j := range current.Items {
 				if current.Items[j].Name == part {
-					current = &current.Items[j]
-					found = true
+					found = &current.Items[j]
 					break
 				}
 			}
 
-			if !found {
+			if found == nil {
 				// Create a new directory node
-				newNode := &Node{
+				newNode := Node{
 					Name:  part,
 					Items: []Node{},
 				}
-				current.Items = append(current.Items, *newNode)
-				current = newNode
+				current.Items = append(current.Items, newNode)
+				found = &current.Items[len(current.Items)-1]
 			}
+
+			current = found
 		}
 
 		// Handle the final part (file or directory)
 		lastPart := parts[len(parts)-1]
 		if isDir {
-			// Add a new directory node
-			newNode := &Node{
+			newNode := Node{
 				Name:  lastPart,
 				Items: []Node{},
 			}
-			current.Items = append(current.Items, *newNode)
+			current.Items = append(current.Items, newNode)
 		} else {
 			// Add a file node
 			current.Items = append(current.Items, Node{Name: lastPart, Items: []Node{}})
@@ -74,26 +74,6 @@ func buildFileTree(paths []string) *Node {
 	return root
 }
 
-// collectFlatNodes returns a flat list of nodes, with each directory containing its items
-func collectFlatNodes(node *Node) []Node {
-	var result []Node
-
-	// Function to recursively traverse the tree
-	var traverse func(*Node)
-	traverse = func(n *Node) {
-		// Add current node to the result
-		result = append(result, Node{Name: n.Name, Items: n.Items})
-
-		// If this node has children, recursively process them
-		for _, child := range n.Items {
-			traverse(&child)
-		}
-	}
-
-	traverse(node)
-	return result
-}
-
 func (r *Route) Files(c *gin.Context) {
 	user, repoPath := c.Param("user"), c.Param("path")
 	fullPath := "/" + user + "/" + repoPath