-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathfilter_test.go
More file actions
117 lines (99 loc) · 2.69 KB
/
Copy pathfilter_test.go
File metadata and controls
117 lines (99 loc) · 2.69 KB
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
package algo_test
import (
"reflect"
"testing"
"github.com/datosh/algo"
"github.com/stretchr/testify/assert"
)
func filterInterface(list interface{}, pred func(interface{}) bool) interface{} {
contentType := reflect.TypeOf(list)
contentValue := reflect.ValueOf(list)
newContent := reflect.MakeSlice(contentType, 0, 0)
for i := 0; i < contentValue.Len(); i++ {
if content := contentValue.Index(i); pred(content.Interface()) {
newContent = reflect.Append(newContent, content)
}
}
return newContent.Interface()
}
func onlyEvenInterface(i interface{}) bool {
number := i.(int)
return (number % 2) == 0
}
func onlyEven(i int) bool {
return (i % 2) == 0
}
// generateNumbers in range (including) from (excluding) to.
func generateNumbers(from, to int) []int {
var numbers []int
for i := from; i < to; i++ {
numbers = append(numbers, i)
}
return numbers
}
func Test_Filter(t *testing.T) {
t.Run("keep even numbers", func(t *testing.T) {
numbers := []int{0, 1, 2, 3, 4, 5, 6, 7, 8, 9}
filteredNumbers := algo.Filter(onlyEven)(numbers)
assert.Equal(t, 0, filteredNumbers[0])
assert.Equal(t, 2, filteredNumbers[1])
assert.Equal(t, 4, filteredNumbers[2])
assert.Equal(t, 6, filteredNumbers[3])
assert.Equal(t, 8, filteredNumbers[4])
assert.Len(t, filteredNumbers, 5)
})
}
func Benchmark_Filter(b *testing.B) {
// Setup
var listsOfNumbers [][]int
for i := 0; i < b.N; i++ {
listsOfNumbers = append(listsOfNumbers, generateNumbers(0, 100000))
}
for n := 0; n < b.N; n++ {
filteredList := algo.Filter(onlyEven)(listsOfNumbers[n])
result = filteredList[0]
}
}
func Benchmark_Filter2(b *testing.B) {
// Setup
var listsOfNumbers [][]int
for i := 0; i < b.N; i++ {
listsOfNumbers = append(listsOfNumbers, generateNumbers(0, 100000))
}
for n := 0; n < b.N; n++ {
filteredList := algo.Filter2(listsOfNumbers[n], onlyEven)
result = filteredList[0]
}
}
func Benchmark_FilterInterfaced(b *testing.B) {
// Setup
var listsOfNumbers [][]int
for i := 0; i < b.N; i++ {
listsOfNumbers = append(listsOfNumbers, generateNumbers(0, 100000))
}
for n := 0; n < b.N; n++ {
filteredList := filterInterface(listsOfNumbers[n], onlyEvenInterface)
result = (filteredList).([]int)[0]
}
}
func Benchmark_FilterBaseline(b *testing.B) {
// Setup
var listsOfNumbers [][]int
for i := 0; i < b.N; i++ {
listsOfNumbers = append(listsOfNumbers, generateNumbers(0, 100000))
}
for n := 0; n < b.N; n++ {
i := 0
for _, element := range listsOfNumbers[n] {
if (element % 2) == 0 {
listsOfNumbers[n][i] = element
i++
}
}
for j := i; j < len(listsOfNumbers[n]); j++ {
listsOfNumbers[n][j] = 0
}
listsOfNumbers[n] = listsOfNumbers[n][i:]
result = listsOfNumbers[n][0]
}
}