Merge pull request jorgerojas26#130 from svanharmelen/feat/order-tree

Make the items in the tree alphabetically ordered

components/Tree.go

@@ -2,6 +2,9 @@ package components
 
 import (
 	"fmt"
+	"maps"
+	"slices"
+	"sort"
 	"strings"
 
 	"github.com/gdamore/tcell/v2"
@@ -291,7 +294,16 @@ func NewTree(dbName string, dbdriver drivers.Driver) *Tree {
 func (tree *Tree) databasesToNodes(children map[string][]string, node *tview.TreeNode, defaultExpanded bool) {
 	node.ClearChildren()
 
-	for key, values := range children {
+	// Sort the keys and use them to loop over the
+	// children so they are always in the same order.
+	sortedKeys := slices.Sorted(maps.Keys(children))
+
+	for _, key := range sortedKeys {
+		values := children[key]
+
+		// Sort the values.
+		sort.Strings(values)
+
 		var rootNode *tview.TreeNode
 
 		nodeReference := node.GetReference().(string)

go.mod

@@ -1,6 +1,6 @@
 module github.com/jorgerojas26/lazysql
 
-go 1.20
+go 1.23
 
 require (
 	github.com/DATA-DOG/go-sqlmock v1.5.2