/
row.go
68 lines (60 loc) 路 1.26 KB
/
row.go
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
package table
// Row row
type Row struct {
table *Table
values []interface{}
strValues []string
}
// Rows rows
type Rows []*Row
// Len count
func (r Rows) Len() int {
return len(r)
}
// Swap swap rows
func (r Rows) Swap(i, j int) {
r[i], r[j] = r[j], r[i]
}
// Less less
func (r Rows) Less(i, j int) bool {
sortOrder := r[i].table.sort
var k int
for k = 0; k < len(sortOrder)-1; k++ {
s := sortOrder[k]
if s.order == SortDesc {
if gt(r[i].values[s.index], r[j].values[s.index], s.sortFn) {
return true
}
if gt(r[j].values[s.index], r[i].values[s.index], s.sortFn) {
return false
}
} else {
if lt(r[i].values[s.index], r[j].values[s.index], s.sortFn) {
return true
}
if lt(r[j].values[s.index], r[i].values[s.index], s.sortFn) {
return false
}
}
}
s := sortOrder[k]
if s.order == SortDesc {
return gt(r[i].values[s.index], r[j].values[s.index], s.sortFn)
}
return lt(r[i].values[s.index], r[j].values[s.index], s.sortFn)
}
func gt(a interface{}, b interface{}, fn SortFn) bool {
return lt(b, a, fn)
}
func lt(a interface{}, b interface{}, fn SortFn) bool {
if fn != nil {
return fn(a, b)
}
switch a.(type) {
case int:
return a.(int) < b.(int)
case string:
return a.(string) < b.(string)
}
return false
}