internal/storage/postgres/utils/common.go (1)

87-96: Replace bubble sort with standard library sort for better performance.

The bubble sort implementation has O(n²) time complexity. While typical xip_list sizes may be small, using sort.Slice from the standard library would be more idiomatic, maintainable, and efficient (O(n log n)).

Apply this diff to use the standard library:

+import (
+	"sort"
+	// ... other imports
+)

 // sortXips sorts a slice of xip values in ascending order
 func sortXips(xips []uint64) {
-	for i := 0; i < len(xips)-1; i++ {
-		for j := i + 1; j < len(xips); j++ {
-			if xips[i] > xips[j] {
-				xips[i], xips[j] = xips[j], xips[i]
-			}
-		}
-	}
+	sort.Slice(xips, func(i, j int) bool {
+		return xips[i] < xips[j]
+	})
 }

Configuration used: CodeRabbit UI

Review profile: CHILL

Plan: Pro

internal/storage/postgres/utils/common.go (2)

94-98: Consider pre-allocating the xipStrs slice.

Since the final size of xipStrs is known upfront (len(xips)), pre-allocating the slice can avoid multiple allocations and improve performance slightly.

Apply this diff:

 	// Rebuild xip_list string
-	var xipStrs []string
+	xipStrs := make([]string, 0, len(xips))
 	for _, xip := range xips {
 		xipStrs = append(xipStrs, fmt.Sprintf("%d", xip))
 	}

---

102-111: Prefer standard library sort for better performance.

The bubble sort implementation has O(n²) time complexity. While PostgreSQL snapshots typically have small xip_list sizes, using the standard library's sort.Slice would be more efficient and idiomatic.

Apply this diff:

+import (
+	"sort"
+	// ... other imports
+)

 // sortXips sorts a slice of xip values in ascending order
 func sortXips(xips []uint64) {
-	for i := 0; i < len(xips)-1; i++ {
-		for j := i + 1; j < len(xips); j++ {
-			if xips[i] > xips[j] {
-				xips[i], xips[j] = xips[j], xips[i]
-			}
-		}
-	}
+	sort.Slice(xips, func(i, j int) bool {
+		return xips[i] < xips[j]
+	})
 }

Configuration used: CodeRabbit UI

Review profile: CHILL

Plan: Pro