-
Notifications
You must be signed in to change notification settings - Fork 558
/
arrays_benchmark_test.go
79 lines (68 loc) · 1.55 KB
/
arrays_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
package govalidator
// Benchmark testing is produced with randomly filled array of 1 million elements
import (
"math/rand"
"testing"
)
func randomInt(min, max int) int {
return min + rand.Intn(max-min)
}
func randomArray(n int) (res []interface{}) {
res = make([]interface{}, n)
for i := 0; i < n; i++ {
res[i] = randomInt(-1000, 1000)
}
return
}
func BenchmarkEach(b *testing.B) {
data := randomArray(1000000)
b.ResetTimer()
for n := 0; n < b.N; n++ {
acc := 0
var fn Iterator = func(value interface{}, index int) {
acc = acc + value.(int)
}
Each(data, fn)
}
}
func BenchmarkMap(b *testing.B) {
data := randomArray(1000000)
b.ResetTimer()
for n := 0; n < b.N; n++ {
var fn ResultIterator = func(value interface{}, index int) interface{} {
return value.(int) * 3
}
_ = Map(data, fn)
}
}
func BenchmarkFind(b *testing.B) {
data := randomArray(1000000)
b.ResetTimer()
for n := 0; n < b.N; n++ {
findElement := 96
var fn1 ConditionIterator = func(value interface{}, index int) bool {
return value.(int) == findElement
}
_ = Find(data, fn1)
}
}
func BenchmarkFilter(b *testing.B) {
data := randomArray(1000000)
b.ResetTimer()
for n := 0; n < b.N; n++ {
var fn ConditionIterator = func(value interface{}, index int) bool {
return value.(int)%2 == 0
}
_ = Filter(data, fn)
}
}
func BenchmarkCount(b *testing.B) {
data := randomArray(1000000)
b.ResetTimer()
for n := 0; n < b.N; n++ {
var fn ConditionIterator = func(value interface{}, index int) bool {
return value.(int)%2 == 0
}
_ = Count(data, fn)
}
}