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
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
|
package sortorder
import (
"math/rand"
"reflect"
"sort"
"strconv"
"testing"
)
func TestStringSort(t *testing.T) {
want := []string{
"ab", "abc1",
"abc01", "abc2",
"abc5", "abc10",
}
got := []string{
"abc5", "abc1",
"abc01", "ab",
"abc10", "abc2",
}
sort.Sort(Natural(got))
if !reflect.DeepEqual(want, got) {
t.Errorf("Error: sort failed, expected: %#q, got: %#q", want, got)
}
}
func TestNaturalLess(t *testing.T) {
testset := []struct {
s1, s2 string
less bool
}{
{"0", "00", true},
{"00", "0", false},
{"aa", "ab", true},
{"ab", "abc", true},
{"abc", "ad", true},
{"ab1", "ab2", true},
{"ab1c", "ab1c", false},
{"ab12", "abc", true},
{"ab2a", "ab10", true},
{"a0001", "a0000001", true},
{"a10", "abcdefgh2", true},
{"аб2аб", "аб10аб", true},
{"2аб", "3аб", true},
//
{"a1b", "a01b", true},
{"a01b", "a1b", false},
{"ab01b", "ab010b", true},
{"ab010b", "ab01b", false},
{"a01b001", "a001b01", true},
{"a001b01", "a01b001", false},
{"a1", "a1x", true},
{"1ax", "1b", true},
{"1b", "1ax", false},
//
{"082", "83", true},
//
{"083a", "9a", false},
{"9a", "083a", true},
}
for _, v := range testset {
if res := NaturalLess(v.s1, v.s2); res != v.less {
t.Errorf("Compared %#q to %#q: expected %v, got %v",
v.s1, v.s2, v.less, res)
}
}
}
func BenchmarkStdStringSort(b *testing.B) {
set := testSet(300)
arr := make([]string, len(set[0]))
b.ResetTimer()
for i := 0; i < b.N; i++ {
for _, list := range set {
b.StopTimer()
copy(arr, list)
b.StartTimer()
sort.Strings(arr)
}
}
}
func BenchmarkNaturalStringSort(b *testing.B) {
set := testSet(300)
arr := make([]string, len(set[0]))
b.ResetTimer()
for i := 0; i < b.N; i++ {
for _, list := range set {
b.StopTimer()
copy(arr, list)
b.StartTimer()
sort.Sort(Natural(arr))
}
}
}
func BenchmarkStdStringLess(b *testing.B) {
set := testSet(300)
b.ResetTimer()
for i := 0; i < b.N; i++ {
for j := range set[0] {
k := (j + 1) % len(set[0])
_ = set[0][j] < set[0][k]
}
}
}
func BenchmarkNaturalLess(b *testing.B) {
set := testSet(300)
b.ResetTimer()
for i := 0; i < b.N; i++ {
for j := range set[0] {
k := (j + 1) % len(set[0])
_ = NaturalLess(set[0][j], set[0][k])
}
}
}
// Get 1000 arrays of 10000-string-arrays (less if -short is specified).
func testSet(seed int) [][]string {
gen := &generator{
src: rand.New(rand.NewSource(
int64(seed),
)),
}
n := 1000
if testing.Short() {
n = 1
}
set := make([][]string, n)
for i := range set {
strings := make([]string, 10000)
for idx := range strings {
// Generate a random string
strings[idx] = gen.NextString()
}
set[i] = strings
}
return set
}
type generator struct {
src *rand.Rand
}
func (g *generator) NextInt(max int) int {
return g.src.Intn(max)
}
// Gets random random-length alphanumeric string.
func (g *generator) NextString() (str string) {
// Random-length 3-8 chars part
strlen := g.src.Intn(6) + 3
// Random-length 1-3 num
numlen := g.src.Intn(3) + 1
// Random position for num in string
numpos := g.src.Intn(strlen + 1)
// Generate the number
var num string
for i := 0; i < numlen; i++ {
num += strconv.Itoa(g.src.Intn(10))
}
// Put it all together
for i := 0; i < strlen+1; i++ {
if i == numpos {
str += num
} else {
str += string('a' + rune(g.src.Intn(16)))
}
}
return str
}
|
