feat: Add NCDU-style hierarchical tree navigation

- Add TreeNode type in pkg/types/tree.go for hierarchical structure
- Add ScanDirectory() method for lazy folder scanning
- Add StateTree state with drill-down/back navigation (→/l, ←/h)
- Add renderTreeView with breadcrumb, icons, and depth warnings
- Add --tui flag to scan command for interactive TUI
- Integrate Bubble Tea spinner and progress for tree scanning
- All 11 tests pass

Author: thanhdevapp

cmd/root/scan.go

@@ -6,6 +6,7 @@ import (
 
 	"github.com/spf13/cobra"
 	"github.com/thanhdevapp/dev-cleaner/internal/scanner"
+	"github.com/thanhdevapp/dev-cleaner/internal/tui"
 	"github.com/thanhdevapp/dev-cleaner/internal/ui"
 	"github.com/thanhdevapp/dev-cleaner/pkg/types"
 )
@@ -15,6 +16,7 @@ var (
 	scanAndroid bool
 	scanNode    bool
 	scanAll     bool
+	scanTUI     bool
 )
 
 // scanCmd represents the scan command
@@ -41,6 +43,7 @@ func init() {
 	scanCmd.Flags().BoolVar(&scanAndroid, "android", false, "Scan Android/Gradle artifacts only")
 	scanCmd.Flags().BoolVar(&scanNode, "node", false, "Scan Node.js artifacts only")
 	scanCmd.Flags().BoolVar(&scanAll, "all", true, "Scan all categories (default)")
+	scanCmd.Flags().BoolVar(&scanTUI, "tui", false, "Launch interactive TUI for selection")
 }
 
 func runScan(cmd *cobra.Command, args []string) {
@@ -83,6 +86,15 @@ func runScan(cmd *cobra.Command, args []string) {
 	// Sort by size (largest first)
 	sortBySize(results)
 
+	// Launch TUI if --tui flag is set
+	if scanTUI {
+		if err := tui.Run(results, false); err != nil {
+			fmt.Fprintf(os.Stderr, "Error running TUI: %v\n", err)
+			os.Exit(1)
+		}
+		return
+	}
+
 	// Print results with enhanced UI
 	ui.PrintResults(results)
 	ui.PrintSummary(results)

dev-cleaner

@@ -12,6 +12,7 @@ require (
 require (
 	github.com/aymanbagabas/go-osc52/v2 v2.0.1 // indirect
 	github.com/charmbracelet/colorprofile v0.2.3-0.20250311203215-f60798e515dc // indirect
+	github.com/charmbracelet/harmonica v0.2.0 // indirect
 	github.com/charmbracelet/x/ansi v0.10.1 // indirect
 	github.com/charmbracelet/x/cellbuf v0.0.13-0.20250311204145-2c3ea96c31dd // indirect
 	github.com/charmbracelet/x/term v0.2.1 // indirect

go.mod

@@ -6,6 +6,8 @@ github.com/charmbracelet/bubbletea v1.3.10 h1:otUDHWMMzQSB0Pkc87rm691KZ3SWa4KUlv
 github.com/charmbracelet/bubbletea v1.3.10/go.mod h1:ORQfo0fk8U+po9VaNvnV95UPWA1BitP1E0N6xJPlHr4=
 github.com/charmbracelet/colorprofile v0.2.3-0.20250311203215-f60798e515dc h1:4pZI35227imm7yK2bGPcfpFEmuY1gc2YSTShr4iJBfs=
 github.com/charmbracelet/colorprofile v0.2.3-0.20250311203215-f60798e515dc/go.mod h1:X4/0JoqgTIPSFcRA/P6INZzIuyqdFY5rm8tb41s9okk=
+github.com/charmbracelet/harmonica v0.2.0 h1:8NxJWRWg/bzKqqEaaeFNipOu77YR5t8aSwG4pgaUBiQ=
+github.com/charmbracelet/harmonica v0.2.0/go.mod h1:KSri/1RMQOZLbw7AHqgcBycp8pgJnQMYYT8QZRqZ1Ao=
 github.com/charmbracelet/lipgloss v1.1.0 h1:vYXsiLHVkK7fp74RkV7b2kq9+zDLoEU4MZoFqR/noCY=
 github.com/charmbracelet/lipgloss v1.1.0/go.mod h1:/6Q8FR2o+kj8rz4Dq0zQc3vYf7X+B0binUUBwA0aL30=
 github.com/charmbracelet/x/ansi v0.10.1 h1:rL3Koar5XvX0pHGfovN03f5cxLbCF2YvLeyz7D2jVDQ=

go.sum

@@ -2,6 +2,7 @@
 package scanner
 
 import (
+	"fmt"
 	"io/fs"
 	"os"
 	"path/filepath"
@@ -111,3 +112,85 @@ func (s *Scanner) PathExists(path string) bool {
 	_, err := os.Stat(path)
 	return err == nil
 }
+
+// ScanDirectory scans a single directory lazily and returns TreeNode with children
+func (s *Scanner) ScanDirectory(path string, currentDepth int, maxDepth int) (*types.TreeNode, error) {
+	// Depth limit check
+	if currentDepth >= maxDepth {
+		return nil, fmt.Errorf("max depth %d reached", maxDepth)
+	}
+
+	// Read directory entries
+	entries, err := os.ReadDir(path)
+	if err != nil {
+		return nil, fmt.Errorf("failed to read directory %s: %w", path, err)
+	}
+
+	// Calculate total size
+	totalSize, fileCount, _ := s.calculateSize(path)
+
+	// Build TreeNode
+	node := &types.TreeNode{
+		Path:      path,
+		Name:      types.GetBasename(path),
+		Size:      totalSize,
+		IsDir:     true,
+		Children:  make([]*types.TreeNode, 0),
+		Scanned:   true,
+		Depth:     currentDepth,
+		FileCount: fileCount,
+	}
+
+	// Process children
+	for _, entry := range entries {
+		childPath := filepath.Join(path, entry.Name())
+
+		// Skip symlinks to avoid cycles
+		info, err := entry.Info()
+		if err != nil {
+			continue
+		}
+		if info.Mode()&os.ModeSymlink != 0 {
+			continue
+		}
+
+		isDir := entry.IsDir()
+		var childSize int64
+		var childFileCount int
+
+		if isDir {
+			// For directories, calculate size
+			childSize, childFileCount, _ = s.calculateSize(childPath)
+		} else {
+			// For files, use file size
+			childSize = info.Size()
+			childFileCount = 1
+		}
+
+		child := &types.TreeNode{
+			Path:      childPath,
+			Name:      entry.Name(),
+			Size:      childSize,
+			IsDir:     isDir,
+			Scanned:   false, // Lazy - not scanned yet
+			Depth:     currentDepth + 1,
+			FileCount: childFileCount,
+		}
+
+		node.AddChild(child)
+	}
+
+	return node, nil
+}
+
+// ScanResultToTreeNode converts ScanResult to initial TreeNode
+func (s *Scanner) ScanResultToTreeNode(result types.ScanResult) (*types.TreeNode, error) {
+	node := types.ScanResultToTreeNode(result)
+
+	// Verify path exists
+	if !s.PathExists(result.Path) {
+		return nil, fmt.Errorf("path does not exist: %s", result.Path)
+	}
+
+	return node, nil
+}