24a2b57e29
the motivation for this commit is long and detailed and has been documented externally here: https://gist.github.com/mschoch/5cc5c9cf4669a5fe8512cb7770d3c1a2 the core of the changes are: 1. recognize that collector/searcher need only a fixed number of DocumentMatch instances, and this number can be determined from the structure of the query, not the size of the data 2. knowing this, instances can be allocated in bulk, up front and they can be reused without locking (since all search operations take place in a single goroutine 3. combined with previous commits which enabled reuse of the IndexInternalID []byte, this allows for no allocation/copy of these bytes as well (by using DocumentMatch Reset() method when returning entries to the pool
81 lines
2.2 KiB
Go
81 lines
2.2 KiB
Go
// Copyright (c) 2013 Couchbase, Inc.
|
|
// Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file
|
|
// except in compliance with the License. You may obtain a copy of the License at
|
|
// http://www.apache.org/licenses/LICENSE-2.0
|
|
// Unless required by applicable law or agreed to in writing, software distributed under the
|
|
// License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND,
|
|
// either express or implied. See the License for the specific language governing permissions
|
|
// and limitations under the License.
|
|
|
|
package searchers
|
|
|
|
import (
|
|
"testing"
|
|
|
|
"github.com/blevesearch/bleve/search"
|
|
)
|
|
|
|
func TestMatchNoneSearch(t *testing.T) {
|
|
|
|
twoDocIndexReader, err := twoDocIndex.Reader()
|
|
if err != nil {
|
|
t.Error(err)
|
|
}
|
|
defer func() {
|
|
err := twoDocIndexReader.Close()
|
|
if err != nil {
|
|
t.Fatal(err)
|
|
}
|
|
}()
|
|
|
|
noneSearcher, err := NewMatchNoneSearcher(twoDocIndexReader)
|
|
if err != nil {
|
|
t.Fatal(err)
|
|
}
|
|
|
|
tests := []struct {
|
|
searcher search.Searcher
|
|
results []*search.DocumentMatch
|
|
}{
|
|
{
|
|
searcher: noneSearcher,
|
|
results: []*search.DocumentMatch{},
|
|
},
|
|
}
|
|
|
|
for testIndex, test := range tests {
|
|
defer func() {
|
|
err := test.searcher.Close()
|
|
if err != nil {
|
|
t.Fatal(err)
|
|
}
|
|
}()
|
|
|
|
ctx := &search.SearchContext{
|
|
DocumentMatchPool: search.NewDocumentMatchPool(test.searcher.DocumentMatchPoolSize()),
|
|
}
|
|
next, err := test.searcher.Next(ctx)
|
|
i := 0
|
|
for err == nil && next != nil {
|
|
if i < len(test.results) {
|
|
if !next.IndexInternalID.Equals(test.results[i].IndexInternalID) {
|
|
t.Errorf("expected result %d to have id %s got %s for test %d", i, test.results[i].IndexInternalID, next.IndexInternalID, testIndex)
|
|
}
|
|
if !scoresCloseEnough(next.Score, test.results[i].Score) {
|
|
t.Errorf("expected result %d to have score %v got %v for test %d", i, test.results[i].Score, next.Score, testIndex)
|
|
t.Logf("scoring explanation: %s", next.Expl)
|
|
}
|
|
}
|
|
ctx.DocumentMatchPool.Put(next)
|
|
next, err = test.searcher.Next(ctx)
|
|
i++
|
|
}
|
|
if err != nil {
|
|
t.Fatalf("error iterating searcher: %v for test %d", err, testIndex)
|
|
}
|
|
if len(test.results) != i {
|
|
t.Errorf("expected %d results got %d for test %d", len(test.results), i, testIndex)
|
|
}
|
|
}
|
|
}
|