Skip to content

Commit 8a25936

Browse files
author
tiger lee
authored
update performance test times to avoid accidental factors (#34)
1 parent 1e43e19 commit 8a25936

File tree

1 file changed

+12
-12
lines changed

1 file changed

+12
-12
lines changed

orderedmap_test.go

Lines changed: 12 additions & 12 deletions
Original file line numberDiff line numberDiff line change
@@ -67,8 +67,8 @@ func TestGet(t *testing.T) {
6767
t.Skip("performance test skipped in short mode")
6868
}
6969

70-
res1 := testing.Benchmark(benchmarkOrderedMap_Get(1))
71-
res4 := testing.Benchmark(benchmarkOrderedMap_Get(4))
70+
res1 := testing.Benchmark(benchmarkOrderedMap_Get(100))
71+
res4 := testing.Benchmark(benchmarkOrderedMap_Get(400))
7272

7373
// O(1) would mean that res4 should take about the same time as res1,
7474
// because we are accessing the same amount of elements, just on
@@ -119,8 +119,8 @@ func TestSet(t *testing.T) {
119119
t.Skip("performance test skipped in short mode")
120120
}
121121

122-
res1 := testing.Benchmark(benchmarkOrderedMap_Set(1))
123-
res4 := testing.Benchmark(benchmarkOrderedMap_Set(4))
122+
res1 := testing.Benchmark(benchmarkOrderedMap_Set(100))
123+
res4 := testing.Benchmark(benchmarkOrderedMap_Set(400))
124124

125125
// O(1) would mean that res4 should take about 4 times longer than res1
126126
// because we are doing 4 times the amount of Set operations. Allow for
@@ -158,8 +158,8 @@ func TestLen(t *testing.T) {
158158
t.Skip("performance test skipped in short mode")
159159
}
160160

161-
res1 := testing.Benchmark(benchmarkOrderedMap_Len(1))
162-
res4 := testing.Benchmark(benchmarkOrderedMap_Len(4))
161+
res1 := testing.Benchmark(benchmarkOrderedMap_Len(100))
162+
res4 := testing.Benchmark(benchmarkOrderedMap_Len(400))
163163

164164
// O(1) would mean that res4 should take about the same time as res1,
165165
// because we are accessing the same amount of elements, just on
@@ -216,8 +216,8 @@ func TestKeys(t *testing.T) {
216216
t.Skip("performance test skipped in short mode")
217217
}
218218

219-
res1 := testing.Benchmark(benchmarkOrderedMap_Keys(1))
220-
res4 := testing.Benchmark(benchmarkOrderedMap_Keys(4))
219+
res1 := testing.Benchmark(benchmarkOrderedMap_Keys(100))
220+
res4 := testing.Benchmark(benchmarkOrderedMap_Keys(400))
221221

222222
// O(1) would mean that res4 should take about 4 times longer than res1
223223
// because we are doing 4 times the amount of Set/Delete operations.
@@ -264,8 +264,8 @@ func TestDelete(t *testing.T) {
264264
t.Skip("performance test skipped in short mode")
265265
}
266266

267-
res1 := testing.Benchmark(benchmarkOrderedMap_Delete(1))
268-
res4 := testing.Benchmark(benchmarkOrderedMap_Delete(4))
267+
res1 := testing.Benchmark(benchmarkOrderedMap_Delete(100))
268+
res4 := testing.Benchmark(benchmarkOrderedMap_Delete(400))
269269

270270
// O(1) would mean that res4 should take about 4 times longer than res1
271271
// because we are doing 4 times the amount of Set/Delete operations.
@@ -344,8 +344,8 @@ func TestGetElement(t *testing.T) {
344344
t.Skip("performance test skipped in short mode")
345345
}
346346

347-
res1 := testing.Benchmark(benchmarkOrderedMap_GetElement(1))
348-
res4 := testing.Benchmark(benchmarkOrderedMap_GetElement(4))
347+
res1 := testing.Benchmark(benchmarkOrderedMap_GetElement(100))
348+
res4 := testing.Benchmark(benchmarkOrderedMap_GetElement(400))
349349

350350
// O(1) would mean that res4 should take about the same time as res1,
351351
// because we are accessing the same amount of elements, just on

0 commit comments

Comments
 (0)