Andreas/siyuan
1
0
Fork 0
mirror of https://github.com/siyuan-note/siyuan.git synced 2025-12-16 22:50:13 +01:00
Code Issues Projects Releases Packages Wiki Activity Actions 1

🎨 Improve doc tree Name Alphabet sorting https://github.com/siyuan-note/siyuan/issues/14773

Browse source
This commit is contained in:
Daniel 2025-05-08 00:48:35 +08:00
parent 949a57d42e
commit 0ef8783ce3
No known key found for this signature in database
GPG key ID: 86211BA83DF03017
1 changed files with 3 additions and 3 deletions
Download patch file Download diff file Expand all files Collapse all files

6
kernel/util/sort.go
View file

@ -87,13 +87,13 @@ func PinYinCompare4FileTree(str1, str2 string) bool {
// 长度不相等的情况下，比较前面相等的部分 // 长度不相等的情况下，比较前面相等的部分
if len(a) < len(b) { if len(a) < len(b) {
if 0 == bytes.Compare(a, b[:len(a)]) { // 前面相等的情况下，比较长度 if 0 == bytes.Compare(a, b[:len(a)]) { // 前面相等的情况下短的在前
return len(a) > len(b[:len(a)]) return true
} }
return bytes.Compare(a, b[:len(a)]) < 0 return bytes.Compare(a, b[:len(a)]) < 0
} }
if 0 == bytes.Compare(a[:len(b)], b) { if 0 == bytes.Compare(a[:len(b)], b) {
return len(a[:len(b)]) > len(b) return false
} }
return bytes.Compare(a[:len(b)], b) < 0 return bytes.Compare(a[:len(b)], b) < 0
} }