style: apply gofmt formatting

Co-authored-by: Ona <[email protected]>

Author: leodido

pkg/leeway/build.go

@@ -2936,8 +2936,8 @@ func sortPackagesByDependencyDepth(packages []*Package) []*Package {
 	// Sort by depth (descending) - packages with more dependencies first
 	// This is a stable sort, so packages with equal depth maintain their order
 	sort.SliceStable(sorted, func(i, j int) bool {
-      return depthCache[sorted[i].FullName()] > depthCache[sorted[j].FullName()]
-  })
+		return depthCache[sorted[i].FullName()] > depthCache[sorted[j].FullName()]
+	})
 
 	// Log the sorted order for debugging
 	if len(sorted) > 0 {
@@ -2950,7 +2950,7 @@ func sortPackagesByDependencyDepth(packages []*Package) []*Package {
 			"count": len(sorted),
 			"order": sortedNames,
 		}).Debug("📦 Download order (deepest dependencies first):")
-		
+
 		// Also log each package individually for easier reading
 		for i, pkg := range sorted {
 			depth := depthCache[pkg.FullName()]

pkg/leeway/build_sort_test.go

@@ -130,7 +130,7 @@ func TestSortPackagesByDependencyDepth(t *testing.T) {
 				rootNames := []string{sorted[0].FullName(), sorted[1].FullName()}
 				require.Contains(t, rootNames, "tree1-root")
 				require.Contains(t, rootNames, "tree2-root")
-				
+
 				leafNames := []string{sorted[2].FullName(), sorted[3].FullName()}
 				require.Contains(t, leafNames, "tree1-leaf")
 				require.Contains(t, leafNames, "tree2-leaf")
@@ -254,7 +254,7 @@ func TestSortPackagesByDependencyDepth_Performance(t *testing.T) {
 	// Should complete quickly even with 100 packages
 	sorted := sortPackagesByDependencyDepth(packages)
 	require.Equal(t, 100, len(sorted))
-	
+
 	// Deepest package (pkg99) should be first
 	require.Equal(t, "pkg"+string(rune(99)), sorted[0].FullName())
 	// Shallowest (leaf, pkg0) should be last
@@ -264,7 +264,7 @@ func TestSortPackagesByDependencyDepth_Performance(t *testing.T) {
 // BenchmarkSortPackagesByDependencyDepth benchmarks the sorting algorithm
 func BenchmarkSortPackagesByDependencyDepth(b *testing.B) {
 	sizes := []int{10, 50, 100, 200}
-	
+
 	for _, size := range sizes {
 		b.Run(fmt.Sprintf("%d-packages", size), func(b *testing.B) {
 			// Create a chain of packages (worst case for depth calculation)
@@ -279,7 +279,7 @@ func BenchmarkSortPackagesByDependencyDepth(b *testing.B) {
 				}
 				packages[i] = pkg
 			}
-			
+
 			b.ResetTimer()
 			for i := 0; i < b.N; i++ {
 				_ = sortPackagesByDependencyDepth(packages)
@@ -291,7 +291,7 @@ func BenchmarkSortPackagesByDependencyDepth(b *testing.B) {
 // BenchmarkCalculateDependencyDepth benchmarks depth calculation
 func BenchmarkCalculateDependencyDepth(b *testing.B) {
 	depths := []int{5, 10, 20, 50}
-	
+
 	for _, depth := range depths {
 		b.Run(fmt.Sprintf("depth-%d", depth), func(b *testing.B) {
 			// Create a linear chain of given depth
@@ -306,7 +306,7 @@ func BenchmarkCalculateDependencyDepth(b *testing.B) {
 				}
 				pkg = newPkg
 			}
-			
+
 			b.ResetTimer()
 			for i := 0; i < b.N; i++ {
 				cache := make(map[string]int)