/
sortconv.go
93 lines (57 loc) · 1.06 KB
/
sortconv.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
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
package hashing
import "reflect"
/**
* The hashing library's sort functions.
* @author rnojiri
**/
// strings
type byString []reflect.Value
func (s byString) Len() int {
return len(s)
}
func (s byString) Swap(i, j int) {
s[i], s[j] = s[j], s[i]
}
func (s byString) Less(i, j int) bool {
return s[i].String() < s[j].String()
}
// floats
type byFloat []reflect.Value
func (s byFloat) Len() int {
return len(s)
}
func (s byFloat) Swap(i, j int) {
s[i], s[j] = s[j], s[i]
}
func (s byFloat) Less(i, j int) bool {
return s[i].Float() < s[j].Float()
}
// int
type byInt []reflect.Value
func (s byInt) Len() int {
return len(s)
}
func (s byInt) Swap(i, j int) {
s[i], s[j] = s[j], s[i]
}
func (s byInt) Less(i, j int) bool {
return s[i].Int() < s[j].Int()
}
// boolean
type byBool []reflect.Value
func (s byBool) Len() int {
return len(s)
}
func (s byBool) Swap(i, j int) {
s[i], s[j] = s[j], s[i]
}
func (s byBool) Less(i, j int) bool {
var inti, intj byte
if s[i].Bool() {
inti = 1
}
if s[j].Bool() {
intj = 1
}
return inti < intj
}