0ct0pu5/siyuan
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

🎨 Improve notebook sorting https://github.com/siyuan-note/siyuan/issues/13598

Browse source
This commit is contained in:
Daniel 2024-12-24 16:25:26 +08:00
parent 5b3fa67332
commit b12906321f
No known key found for this signature in database
GPG key ID: 86211BA83DF03017
1 changed files with 2 additions and 6 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

8
kernel/model/box.go
View file

@ -154,8 +154,6 @@ func ListNotebooks() (ret []*Box, err error) {
sort.Slice(ret, func(i, j int) bool {
return util.PinYinCompare(ret[j].Name, ret[i].Name)
})
case util.SortModeUpdatedASC:
case util.SortModeUpdatedDESC:
case util.SortModeAlphanumASC:
sort.Slice(ret, func(i, j int) bool {
return util.NaturalCompare(ret[i].Name, ret[j].Name)
@ -166,12 +164,10 @@ func ListNotebooks() (ret []*Box, err error) {
})
case util.SortModeCustom:
sort.Slice(ret, func(i, j int) bool { return ret[i].Sort < ret[j].Sort })
case util.SortModeRefCountASC:
case util.SortModeRefCountDESC:
case util.SortModeCreatedASC:
sort.Slice(ret, func(i, j int) bool { return util.NaturalCompare(ret[j].ID, ret[i].ID) })
sort.Slice(ret, func(i, j int) bool { return ret[i].ID < ret[j].ID })
case util.SortModeCreatedDESC:
sort.Slice(ret, func(i, j int) bool { return util.NaturalCompare(ret[j].ID, ret[i].ID) })
sort.Slice(ret, func(i, j int) bool { return ret[i].ID > ret[j].ID })
}
return
}