f225d484b3
many bugs fixed in existing search phrase query updated to support gaps in term sequence new query types all,none,match,phrase match and new query syntax search, like google search: +/-(optional field qualifier:)<term or quoted phrase>
117 lines
2.7 KiB
Go
117 lines
2.7 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 search
|
|
|
|
import (
|
|
"testing"
|
|
|
|
"github.com/couchbaselabs/bleve/index"
|
|
)
|
|
|
|
func TestMatchAllSearch(t *testing.T) {
|
|
|
|
tests := []struct {
|
|
index index.Index
|
|
query Query
|
|
queryNorm float64
|
|
results []*DocumentMatch
|
|
}{
|
|
{
|
|
index: twoDocIndex,
|
|
query: &MatchAllQuery{
|
|
BoostVal: 1.0,
|
|
Explain: true,
|
|
},
|
|
queryNorm: 1.0,
|
|
results: []*DocumentMatch{
|
|
&DocumentMatch{
|
|
ID: "1",
|
|
Score: 1.0,
|
|
},
|
|
&DocumentMatch{
|
|
ID: "2",
|
|
Score: 1.0,
|
|
},
|
|
&DocumentMatch{
|
|
ID: "3",
|
|
Score: 1.0,
|
|
},
|
|
&DocumentMatch{
|
|
ID: "4",
|
|
Score: 1.0,
|
|
},
|
|
&DocumentMatch{
|
|
ID: "5",
|
|
Score: 1.0,
|
|
},
|
|
},
|
|
},
|
|
{
|
|
index: twoDocIndex,
|
|
query: &MatchAllQuery{
|
|
BoostVal: 1.2,
|
|
Explain: true,
|
|
},
|
|
queryNorm: 0.8333333,
|
|
results: []*DocumentMatch{
|
|
&DocumentMatch{
|
|
ID: "1",
|
|
Score: 1.0,
|
|
},
|
|
&DocumentMatch{
|
|
ID: "2",
|
|
Score: 1.0,
|
|
},
|
|
&DocumentMatch{
|
|
ID: "3",
|
|
Score: 1.0,
|
|
},
|
|
&DocumentMatch{
|
|
ID: "4",
|
|
Score: 1.0,
|
|
},
|
|
&DocumentMatch{
|
|
ID: "5",
|
|
Score: 1.0,
|
|
},
|
|
},
|
|
},
|
|
}
|
|
|
|
for testIndex, test := range tests {
|
|
searcher, err := test.query.Searcher(test.index)
|
|
if test.queryNorm != 1.0 {
|
|
searcher.SetQueryNorm(test.queryNorm)
|
|
}
|
|
defer searcher.Close()
|
|
|
|
next, err := searcher.Next()
|
|
i := 0
|
|
for err == nil && next != nil {
|
|
if i < len(test.results) {
|
|
if next.ID != test.results[i].ID {
|
|
t.Errorf("expected result %d to have id %s got %s for test %d", i, test.results[i].ID, next.ID, 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)
|
|
}
|
|
}
|
|
next, err = searcher.Next()
|
|
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)
|
|
}
|
|
}
|
|
}
|