This repository has been archived by the owner on Aug 4, 2024. It is now read-only.
-
Notifications
You must be signed in to change notification settings - Fork 2
/
itertools_benchmark_test.go
228 lines (213 loc) · 4.11 KB
/
itertools_benchmark_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
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
package itertools
import (
"math/rand"
"reflect"
"testing"
)
const repeatTimes = 1000
const stringLength = 100
func randBool(n int) []bool {
m := make([]bool, n)
for i := 0; i < n; i++ {
if rand.Intn(2)%2 == 0 {
m[i] = true
} else {
m[i] = false
}
}
return m
}
func BenchmarkIter(b *testing.B) {
arr := rand.Perm(repeatTimes)
for n := 0; n < b.N; n++ {
counter := 0
ch := Iter(arr)
for range ch {
counter++
}
if counter != repeatTimes {
b.Log("Iter result not long enough")
b.Fail()
}
}
}
func BenchmarkRepeatEdge(b *testing.B) {
for n := 0; n < b.N; n++ {
testString := generateRandomString(stringLength)
ch := Repeat(testString, repeatTimes)
counter := 0
for value := range ch {
if reflect.ValueOf(value).Len() == stringLength {
counter++
}
}
if counter != repeatTimes {
b.Log("Repeat result not long enough")
b.Fail()
}
}
}
func BenchmarkNext(b *testing.B) {
for n := 0; n < b.N; n++ {
arr := rand.Perm(repeatTimes)
counter := 0
ch := Iter(arr)
for counter < repeatTimes {
counter++
Next(ch)
}
if counter != repeatTimes {
b.Log("Next result not long enough")
b.Fail()
}
}
}
func BenchmarkZip(b *testing.B) {
for i := 0; i < b.N; i++ {
counter := 0
first := rand.Perm(repeatTimes)
second := rand.Perm(repeatTimes)
third := rand.Perm(repeatTimes)
ch := Zip(first, second, third)
for range ch {
counter++
}
if counter != repeatTimes {
b.Log("Next result not long enough")
b.Fail()
}
}
}
func BenchmarkAccumulate(b *testing.B) {
for i := 0; i < b.N; i++ {
counter := 0
arr := rand.Perm(repeatTimes)
ch := Accumulate(arr, "", 0)
for range ch {
counter++
}
if counter != repeatTimes {
b.Log("Accumulate results not long enough")
b.Fail()
}
}
}
func BenchmarkAccumulateWithStart(b *testing.B) {
for i := 0; i < b.N; i++ {
counter := 0
arr := rand.Perm(repeatTimes)
ch := Accumulate(arr, "", 100)
for range ch {
counter++
}
if counter-1 != repeatTimes {
b.Log("Accumulate results not long enough")
b.Fail()
}
}
}
func BenchmarkAccumulateMultiply(b *testing.B) {
for i := 0; i < b.N; i++ {
counter := 0
arr := rand.Perm(repeatTimes)
ch := Accumulate(arr, "multiply", 0)
for range ch {
counter++
}
if counter != repeatTimes {
b.Log("Accumulate results not long enough")
b.Fail()
}
}
}
func BenchmarkAccumulateMultiplyWithStart(b *testing.B) {
for i := 0; i < b.N; i++ {
counter := 0
arr := rand.Perm(repeatTimes)
ch := Accumulate(arr, "multiply", 100)
for range ch {
counter++
}
if counter-1 != repeatTimes {
b.Log("Accumulate results not long enough")
b.Fail()
}
}
}
func BenchmarkDropwhile(b *testing.B) {
for i := 0; i < b.N; i++ {
arr := rand.Perm(repeatTimes)
predicate := Predicate(func(i interface{}) bool {
return i.(int) < 5
})
ch := Dropwhile(predicate, arr)
for range ch {
continue
}
}
}
func BenchmarkFilterfalse(b *testing.B) {
for i := 0; i < b.N; i++ {
arr := rand.Perm(repeatTimes)
isOdd := Predicate(func(i interface{}) bool {
result := i.(int) % 2
if result == 1 {
return true
}
return false
})
ch := Filterfalse(isOdd, arr)
for range ch {
continue
}
}
}
func BenchmarkTeeString(b *testing.B) {
for i := 0; i < b.N; i++ {
counter := 0
param := generateRandomString(stringLength)
ch := Tee(param, 4)
for range ch {
counter++
}
if counter != stringLength/4 {
b.Log("Tee results not long enough")
b.Fail()
}
}
}
func BenchmarkTeeArray(b *testing.B) {
for i := 0; i < b.N; i++ {
arr := rand.Perm(repeatTimes)
counter := 0
ch := Tee(arr, 4)
for range ch {
counter++
}
if counter != repeatTimes/4 {
b.Log("Tee results not long enough")
b.Fail()
}
}
}
func BenchmarkCompress(b *testing.B) {
for i := 0; i < b.N; i++ {
chCounter := 0
sCounter := 0
data := rand.Perm(repeatTimes)
selector := randBool(repeatTimes)
for i := range selector {
if selector[i] {
sCounter++
}
}
ch := Compress(data, selector)
for range ch {
chCounter++
}
if chCounter != sCounter {
b.Log("Compress results are the wrong len")
b.Fail()
}
}
}