beego datatables排序函数

datatables是个很不错的表格，使用GO时排序问题很麻烦，于是写了个函数,这是datatables1.8的

package tools

import (
	"github.com/astaxie/beego/context"
	"strconv"
)

//datatables的排序
func DT_order(aColumns []string, Input *context.BeegoInput) string {
	maps := make(map[string]string)
	if iSortCol_0, _ := strconv.Atoi(Input.Query("iSortCol_0")); iSortCol_0 > -1 {
		ranges, _ := strconv.Atoi(Input.Query("iSortingCols"))
		for i := 0; i < ranges; i++ {
			istring := strconv.Itoa(i)
			if iSortcol := Input.Query("bSortable_" + Input.Query("iSortCol_"+istring)); iSortcol == "true" {
				sordir := Input.Query("sSortDir_" + istring)
				thisSortCol, _ := strconv.Atoi(Input.Query("iSortCol_" + istring))
				if sordir == "asc" {
					maps[aColumns[thisSortCol]] = "asc"
				} else {
					maps[aColumns[thisSortCol]] = "desc"
				}
			}
		}
	}
	var order string
	if len(maps) > 0 {
		for k, v := range maps {
			if order == "" {
				order = k + " " + v
			} else {
				order += "," + k + " " + v
			}
		}
	}
	return order
}

使用方法：

order := models.DT_order([]string{"id", "username", "password"}, this.Ctx.Input)
fmt.Println(order)