From 6a4df5aefd1ddf9c0ec4fd726830597200de301f Mon Sep 17 00:00:00 2001
From: Mikhail Chekan <mikhail.chekan@polyus-nt.ru>
Date: Fri, 20 Aug 2021 16:45:38 +0800
Subject: [PATCH] Sort search results (subpath aware)

---
 shroom/search.go | 25 ++++++++++++++++++++++++-
 1 file changed, 24 insertions(+), 1 deletion(-)

diff --git a/shroom/search.go b/shroom/search.go
index e9ee449..bdce218 100644
--- a/shroom/search.go
+++ b/shroom/search.go
@@ -1,6 +1,7 @@
 package shroom
 
 import (
+	"sort"
 	"strings"
 
 	"github.com/bouncepaw/mycorrhiza/hyphae"
@@ -11,11 +12,33 @@ func YieldHyphaNamesContainingString(query string) <-chan string {
 	query = util.CanonicalName(query)
 	out := make(chan string)
 	go func() {
+		// To make it unicode-friendly and lean, we cast every string into rune slices, sort, and only then cast them back
+		raw := make([][]rune, 0)
 		for h := range hyphae.YieldExistingHyphae() {
 			if hyphaNameMatchesString(h.Name, query) {
-				out <- h.Name
+				raw = append(raw, []rune(h.Name))
 			}
 		}
+		sort.Slice(raw, func(i, j int) bool {
+			const slash rune = 47 // == '/'
+			// Classic lexicographical sort with a twist
+			c := 0
+			for {
+				if c == len(raw[i]) { return true }
+				if c == len(raw[j]) { return false }
+				if raw[i][c] == raw[j][c] {
+					c++
+				} else {
+					// The twist: subhyphae-awareness is about pushing slash upwards
+					if raw[i][c] == slash { return true }
+					if raw[j][c] == slash { return false }
+					return raw[i][c] < raw[j][c]
+				}
+			}
+		})
+		for _, name := range raw {
+			out <- string(name)
+		}
 		close(out)
 	}()
 	return out