This repository has been archived by the owner on Apr 23, 2024. It is now read-only.
-
Notifications
You must be signed in to change notification settings - Fork 4
/
search_test.go
138 lines (113 loc) · 2.97 KB
/
search_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
package main
import (
"fmt"
"log"
"math/rand"
"os"
"testing"
"github.com/mtgban/go-mtgban/mtgmatcher"
)
var NameToBeFound string
var EditionToBeFound string
var NumberToBeFound string
func TestMain(m *testing.M) {
err := loadDatastore()
if err != nil {
log.Fatalln(err)
}
DevMode = true
BenchMode = true
loadScrapersNG()
DatabaseLoaded = true
sets := mtgmatcher.GetSets()
for _, set := range sets {
if len(set.Cards) == 0 {
continue
}
index := rand.Intn(len(set.Cards))
NameToBeFound = set.Cards[index].Name
EditionToBeFound = set.Name
NumberToBeFound = set.Cards[index].Number
log.Println("Looking up", NameToBeFound, "from", set.Name, NumberToBeFound)
break
}
os.Exit(m.Run())
}
func BenchmarkRegexp(b *testing.B) {
input := fmt.Sprintf("%s sm:prefix cn:%s f:foil vendor:CK date>%s", NameToBeFound, NumberToBeFound, EditionToBeFound)
b.ResetTimer()
for n := 0; n < b.N; n++ {
parseSearchOptionsNG(input, nil, nil)
}
}
func BenchmarkSearchExact(b *testing.B) {
config := SearchConfig{
CleanQuery: NameToBeFound,
}
for n := 0; n < b.N; n++ {
allKeys, _ := searchAndFilter(config)
searchParallelNG(allKeys, config)
}
}
func BenchmarkSearchPrefix(b *testing.B) {
config := parseSearchOptionsNG(fmt.Sprintf("%s sm:prefix", NameToBeFound), nil, nil)
b.ResetTimer()
for n := 0; n < b.N; n++ {
allKeys, _ := searchAndFilter(config)
searchParallelNG(allKeys, config)
}
}
func BenchmarkSearchAllFromEdition(b *testing.B) {
config := parseSearchOptionsNG(fmt.Sprintf("s:%s", EditionToBeFound), nil, nil)
b.ResetTimer()
for n := 0; n < b.N; n++ {
allKeys, _ := searchAndFilter(config)
searchParallelNG(allKeys, config)
}
}
func BenchmarkSearchWithEdition(b *testing.B) {
config := parseSearchOptionsNG(fmt.Sprintf("%s s:%s", NameToBeFound, EditionToBeFound), nil, nil)
b.ResetTimer()
for n := 0; n < b.N; n++ {
allKeys, _ := searchAndFilter(config)
searchParallelNG(allKeys, config)
}
}
func BenchmarkSearchWithNumber(b *testing.B) {
config := parseSearchOptionsNG(fmt.Sprintf("%s cn:%s", NameToBeFound, NumberToBeFound), nil, nil)
b.ResetTimer()
for n := 0; n < b.N; n++ {
allKeys, _ := searchAndFilter(config)
searchParallelNG(allKeys, config)
}
}
func BenchmarkSearchWithEditionPrefix(b *testing.B) {
config := parseSearchOptionsNG(fmt.Sprintf("%s s:%s sm:prefix", NameToBeFound, EditionToBeFound), nil, nil)
b.ResetTimer()
for n := 0; n < b.N; n++ {
allKeys, _ := searchAndFilter(config)
searchParallelNG(allKeys, config)
}
}
func BenchmarkSearchOnlyRetail(b *testing.B) {
config := SearchConfig{
CleanQuery: NameToBeFound,
SkipBuylist: true,
}
b.ResetTimer()
for n := 0; n < b.N; n++ {
allKeys, _ := searchAndFilter(config)
searchParallelNG(allKeys, config)
}
}
func BenchmarkSearchOnlyBuylist(b *testing.B) {
config := SearchConfig{
CleanQuery: NameToBeFound,
SkipRetail: true,
}
b.ResetTimer()
for n := 0; n < b.N; n++ {
allKeys, _ := searchAndFilter(config)
searchParallelNG(allKeys, config)
}
}