mirror of
https://codeberg.org/forgejo/forgejo.git
synced 2024-11-27 04:43:59 +01:00
Rename repo_model.SearchOrderByMap to repo_model.OrderByMap (#31359)
https://github.com/go-gitea/gitea/pull/30876#discussion_r1637112394 (cherry picked from commit 78e8296e113e2fd9259ec05fe87035427821ea0b)
This commit is contained in:
parent
5d10c3446a
commit
3246e83251
4 changed files with 22 additions and 22 deletions
|
@ -5,8 +5,8 @@ package repo
|
|||
|
||||
import "code.gitea.io/gitea/models/db"
|
||||
|
||||
// SearchOrderByMap represents all possible search order
|
||||
var SearchOrderByMap = map[string]map[string]db.SearchOrderBy{
|
||||
// OrderByMap represents all possible search order
|
||||
var OrderByMap = map[string]map[string]db.SearchOrderBy{
|
||||
"asc": {
|
||||
"alpha": "owner_name ASC, name ASC",
|
||||
"created": db.SearchOrderByOldest,
|
||||
|
@ -31,22 +31,22 @@ var SearchOrderByMap = map[string]map[string]db.SearchOrderBy{
|
|||
},
|
||||
}
|
||||
|
||||
// SearchOrderByFlatMap is similar to SearchOrderByMap but use human language keywords
|
||||
// OrderByFlatMap is similar to OrderByMap but use human language keywords
|
||||
// to decide between asc and desc
|
||||
var SearchOrderByFlatMap = map[string]db.SearchOrderBy{
|
||||
"newest": SearchOrderByMap["desc"]["created"],
|
||||
"oldest": SearchOrderByMap["asc"]["created"],
|
||||
"leastupdate": SearchOrderByMap["asc"]["updated"],
|
||||
"reversealphabetically": SearchOrderByMap["desc"]["alpha"],
|
||||
"alphabetically": SearchOrderByMap["asc"]["alpha"],
|
||||
"reversesize": SearchOrderByMap["desc"]["size"],
|
||||
"size": SearchOrderByMap["asc"]["size"],
|
||||
"reversegitsize": SearchOrderByMap["desc"]["git_size"],
|
||||
"gitsize": SearchOrderByMap["asc"]["git_size"],
|
||||
"reverselfssize": SearchOrderByMap["desc"]["lfs_size"],
|
||||
"lfssize": SearchOrderByMap["asc"]["lfs_size"],
|
||||
"moststars": SearchOrderByMap["desc"]["stars"],
|
||||
"feweststars": SearchOrderByMap["asc"]["stars"],
|
||||
"mostforks": SearchOrderByMap["desc"]["forks"],
|
||||
"fewestforks": SearchOrderByMap["asc"]["forks"],
|
||||
var OrderByFlatMap = map[string]db.SearchOrderBy{
|
||||
"newest": OrderByMap["desc"]["created"],
|
||||
"oldest": OrderByMap["asc"]["created"],
|
||||
"leastupdate": OrderByMap["asc"]["updated"],
|
||||
"reversealphabetically": OrderByMap["desc"]["alpha"],
|
||||
"alphabetically": OrderByMap["asc"]["alpha"],
|
||||
"reversesize": OrderByMap["desc"]["size"],
|
||||
"size": OrderByMap["asc"]["size"],
|
||||
"reversegitsize": OrderByMap["desc"]["git_size"],
|
||||
"gitsize": OrderByMap["asc"]["git_size"],
|
||||
"reverselfssize": OrderByMap["desc"]["lfs_size"],
|
||||
"lfssize": OrderByMap["asc"]["lfs_size"],
|
||||
"moststars": OrderByMap["desc"]["stars"],
|
||||
"feweststars": OrderByMap["asc"]["stars"],
|
||||
"mostforks": OrderByMap["desc"]["forks"],
|
||||
"fewestforks": OrderByMap["asc"]["forks"],
|
||||
}
|
||||
|
|
|
@ -184,7 +184,7 @@ func Search(ctx *context.APIContext) {
|
|||
if len(sortOrder) == 0 {
|
||||
sortOrder = "asc"
|
||||
}
|
||||
if searchModeMap, ok := repo_model.SearchOrderByMap[sortOrder]; ok {
|
||||
if searchModeMap, ok := repo_model.OrderByMap[sortOrder]; ok {
|
||||
if orderBy, ok := searchModeMap[sortMode]; ok {
|
||||
opts.OrderBy = orderBy
|
||||
} else {
|
||||
|
|
|
@ -63,7 +63,7 @@ func RenderRepoSearch(ctx *context.Context, opts *RepoSearchOptions) {
|
|||
sortOrder = setting.UI.ExploreDefaultSort
|
||||
}
|
||||
|
||||
if order, ok := repo_model.SearchOrderByFlatMap[sortOrder]; ok {
|
||||
if order, ok := repo_model.OrderByFlatMap[sortOrder]; ok {
|
||||
orderBy = order
|
||||
} else {
|
||||
sortOrder = "recentupdate"
|
||||
|
|
|
@ -629,7 +629,7 @@ func SearchRepo(ctx *context.Context) {
|
|||
if len(sortOrder) == 0 {
|
||||
sortOrder = "asc"
|
||||
}
|
||||
if searchModeMap, ok := repo_model.SearchOrderByMap[sortOrder]; ok {
|
||||
if searchModeMap, ok := repo_model.OrderByMap[sortOrder]; ok {
|
||||
if orderBy, ok := searchModeMap[sortMode]; ok {
|
||||
opts.OrderBy = orderBy
|
||||
} else {
|
||||
|
|
Loading…
Reference in a new issue