-
Notifications
You must be signed in to change notification settings - Fork 1
/
match_test.go
78 lines (72 loc) · 1.2 KB
/
match_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
package main
import (
"fmt"
"strconv"
"testing"
"time"
)
var MatchList = []string{
"[a-c]d",
"bd",
"*",
"test",
"?test",
"btest",
"*r",
"tractor",
"[ab]ulk",
"bulk",
}
var NMatchList = []string{
"*k",
"test",
"?test",
"btesta",
"a*r",
"btractor",
"[ab]ulk",
"dulk",
}
func TestMatch(t *testing.T) {
for i := 0; i < len(MatchList); i += 2 {
ok, err := Match(MatchList[i], MatchList[i+1])
if err != nil {
t.Fatal(err.Error())
}
if !ok {
t.Fatal("must pass. Pattern:%s String:%s", MatchList[i], MatchList[i+1])
}
}
for i := 0; i < len(NMatchList); i += 2 {
ok, err := Match(NMatchList[i], NMatchList[i+1])
if err != nil {
t.Fatal(err.Error())
}
if ok {
t.Fatal("must not pass. Pattern:%s String:%s", NMatchList[i], NMatchList[i+1])
}
}
}
type sss struct {
some int
}
func BenchmarkMove(b *testing.B) {
ttt := make(map[string]*sss, b.N)
for i := 0; i < b.N; i++ {
ttt[strconv.Itoa(i)] = &sss{some: i}
}
s := make([]string, b.N)
t := time.Now()
i := 0
for k, _ := range ttt {
s[i] = k
i++
}
fnd := 0
for i := 0; i < b.N; i++ {
if f, err := Match("1*", s[i]); f && err == nil {
fnd++
}
}
fmt.Println(b.N, " ", time.Since(t), " ", fnd)
}