-
Notifications
You must be signed in to change notification settings - Fork 13
/
Copy pathbenchstring_test.go
164 lines (125 loc) · 3.36 KB
/
benchstring_test.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
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
package timsort
import (
"math/rand"
"sort"
"strconv"
"testing"
)
func makeStrings(size int, shape string) (v sort.StringSlice) {
v = make(sort.StringSlice, 0, size)
switch shape {
case "xor":
for i := 0; i < size; i++ {
v = append(v, strconv.Itoa(0xff&(i^0xab)))
}
case "sorted":
for i := 0; i < size; i++ {
v = append(v, strconv.Itoa(i))
}
case "revsorted":
for i := 0; i < size; i++ {
v = append(v, strconv.Itoa(size-i))
}
case "random":
rand.Seed(1)
for i := 0; i < size; i++ {
v = append(v, strconv.Itoa(rand.Int()))
}
default:
panic(shape)
}
return v
}
func benchmarkTimsortStr(b *testing.B, size int, shape string) {
b.StopTimer()
for j := 0; j < b.N; j++ {
v := makeStrings(size, shape)
b.StartTimer()
err := TimSort(v)
b.StopTimer()
if err != nil {
b.Fatalf("TimSort: %v", err)
}
}
}
func benchmarkStandardSortStr(b *testing.B, size int, shape string) {
b.StopTimer()
for j := 0; j < b.N; j++ {
v := makeStrings(size, shape)
b.StartTimer()
sort.Sort(&v)
b.StopTimer()
}
}
func BenchmarkTimsortStrXor100(b *testing.B) {
benchmarkTimsortStr(b, 100, "xor")
}
func BenchmarkStandardSortStrXor100(b *testing.B) {
benchmarkStandardSortStr(b, 100, "xor")
}
func BenchmarkTimsortStrSorted100(b *testing.B) {
benchmarkTimsortStr(b, 100, "sorted")
}
func BenchmarkStandardSortStrSorted100(b *testing.B) {
benchmarkStandardSortStr(b, 100, "sorted")
}
func BenchmarkTimsortStrRevSorted100(b *testing.B) {
benchmarkTimsortStr(b, 100, "revsorted")
}
func BenchmarkStandardSortStrRevSorted100(b *testing.B) {
benchmarkStandardSortStr(b, 100, "revsorted")
}
func BenchmarkTimsortStrRandom100(b *testing.B) {
benchmarkTimsortStr(b, 100, "random")
}
func BenchmarkStandardSortStrRandom100(b *testing.B) {
benchmarkStandardSortStr(b, 100, "random")
}
func BenchmarkTimsortStrXor1K(b *testing.B) {
benchmarkTimsortStr(b, 1024, "xor")
}
func BenchmarkStandardSortStrXor1K(b *testing.B) {
benchmarkStandardSortStr(b, 1024, "xor")
}
func BenchmarkTimsortStrSorted1K(b *testing.B) {
benchmarkTimsortStr(b, 1024, "sorted")
}
func BenchmarkStandardSortStrSorted1K(b *testing.B) {
benchmarkStandardSortStr(b, 1024, "sorted")
}
func BenchmarkTimsortStrRevSorted1K(b *testing.B) {
benchmarkTimsortStr(b, 1024, "revsorted")
}
func BenchmarkStandardSortStrRevSorted1K(b *testing.B) {
benchmarkStandardSortStr(b, 1024, "revsorted")
}
func BenchmarkTimsortStrRandom1K(b *testing.B) {
benchmarkTimsortStr(b, 1024, "random")
}
func BenchmarkStandardSortStrRandom1K(b *testing.B) {
benchmarkStandardSortStr(b, 1024, "random")
}
func BenchmarkTimsortStrXor1M(b *testing.B) {
benchmarkTimsortStr(b, 1024*1024, "xor")
}
func BenchmarkStandardSortStrXor1M(b *testing.B) {
benchmarkStandardSortStr(b, 1024*1024, "xor")
}
func BenchmarkTimsortStrSorted1M(b *testing.B) {
benchmarkTimsortStr(b, 1024*1024, "sorted")
}
func BenchmarkStandardSortStrSorted1M(b *testing.B) {
benchmarkStandardSortStr(b, 1024*1024, "sorted")
}
func BenchmarkTimsortStrRevSorted1M(b *testing.B) {
benchmarkTimsortStr(b, 1024*1024, "revsorted")
}
func BenchmarkStandardSortStrRevSorted1M(b *testing.B) {
benchmarkStandardSortStr(b, 1024*1024, "revsorted")
}
func BenchmarkTimsortStrRandom1M(b *testing.B) {
benchmarkTimsortStr(b, 1024*1024, "random")
}
func BenchmarkStandardSortStrRandom1M(b *testing.B) {
benchmarkStandardSortStr(b, 1024*1024, "random")
}