mirror of https://github.com/gobwas/glob.git
add test
This commit is contained in:
parent
3222d37775
commit
de3f4464d6
|
@ -46,3 +46,37 @@ func TestBTree(t *testing.T) {
|
|||
}
|
||||
}
|
||||
}
|
||||
|
||||
type fakeMatcher struct {
|
||||
len int
|
||||
name string
|
||||
}
|
||||
|
||||
func (f *fakeMatcher) Match(string) bool {
|
||||
return true
|
||||
}
|
||||
func (f *fakeMatcher) Index(s string) (int, []int) {
|
||||
return 0, []int{1}
|
||||
}
|
||||
func (f *fakeMatcher) Len() int {
|
||||
return f.len
|
||||
}
|
||||
func (f *fakeMatcher) String() string {
|
||||
return f.name
|
||||
}
|
||||
|
||||
func BenchmarkMatchBTree(b *testing.B) {
|
||||
l := &fakeMatcher{4, "left_fake"}
|
||||
r := &fakeMatcher{4, "right_fake"}
|
||||
v := &fakeMatcher{2, "value_fake"}
|
||||
|
||||
// must be <= len(l + r + v)
|
||||
fixture := "abcdefghijabcdefghijabcdefghijabcdefghijabcdefghijabcdefghijabcdefghijabcdefghij"
|
||||
|
||||
bt := NewBTree(v, l, r)
|
||||
|
||||
b.SetParallelism(1)
|
||||
for i := 0; i < b.N; i++ {
|
||||
bt.Match(fixture)
|
||||
}
|
||||
}
|
||||
|
|
Loading…
Reference in New Issue