gibheer/bleve
0
0
Fork 0
Code

apply same colletor benchmark change

Browse Source
This commit is contained in:
Marty Schoch 2016-08-24 15:56:26 -04:00
parent 0322ecd441
commit 5e94145cf4
2 changed files with 16 additions and 5 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

5
search/collectors/bench_test.go
View File

@ -10,7 +10,9 @@ import (
"golang.org/x/net/context"
)
func benchHelper(numOfMatches int, collector search.Collector, b *testing.B) {
type createCollector func() search.Collector
func benchHelper(numOfMatches int, cc createCollector, b *testing.B) {
matches := make([]*search.DocumentMatch, 0, numOfMatches)
for i := 0; i < numOfMatches; i++ {
matches = append(matches, &search.DocumentMatch{
@ -25,6 +27,7 @@ func benchHelper(numOfMatches int, collector search.Collector, b *testing.B) {
searcher := &stubSearcher{
matches: matches,
}
collector := cc()
err := collector.Collect(context.Background(), searcher, &stubReader{})
if err != nil {
b.Fatal(err)

16
search/collectors/collector_heap_test.go
View File

@ -401,17 +401,25 @@ func TestPaginationSameScores(t *testing.T) {
}
func BenchmarkTop10of100000Scores(b *testing.B) {
benchHelper(10000, NewHeapCollector(10, 0, search.SortOrder{&search.SortScore{Desc: true}}), b)
benchHelper(10000, func() search.Collector {
return NewHeapCollector(10, 0, search.SortOrder{&search.SortScore{Desc: true}})
}, b)
}
func BenchmarkTop100of100000Scores(b *testing.B) {
benchHelper(10000, NewHeapCollector(100, 0, search.SortOrder{&search.SortScore{Desc: true}}), b)
benchHelper(10000, func() search.Collector {
return NewHeapCollector(100, 0, search.SortOrder{&search.SortScore{Desc: true}})
}, b)
}
func BenchmarkTop10of1000000Scores(b *testing.B) {
benchHelper(100000, NewHeapCollector(10, 0, search.SortOrder{&search.SortScore{Desc: true}}), b)
benchHelper(100000, func() search.Collector {
return NewHeapCollector(10, 0, search.SortOrder{&search.SortScore{Desc: true}})
}, b)
}
func BenchmarkTop100of1000000Scores(b *testing.B) {
benchHelper(100000, NewHeapCollector(100, 0, search.SortOrder{&search.SortScore{Desc: true}}), b)
benchHelper(100000, func() search.Collector {
return NewHeapCollector(100, 0, search.SortOrder{&search.SortScore{Desc: true}})
}, b)
}