0
0
bleve/search/search_term_disjunction_test.go

162 lines
3.6 KiB
Go
Raw Normal View History

2014-04-25 17:31:28 +02:00
// Copyright (c) 2014 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 TestTermDisjunctionSearch(t *testing.T) {
tests := []struct {
index index.Index
query Query
results []*DocumentMatch
}{
{
index: twoDocIndex,
query: &TermDisjunctionQuery{
Terms: []Query{
&TermQuery{
Term: "marty",
Field: "name",
BoostVal: 1.0,
Explain: true,
},
&TermQuery{
Term: "dustin",
Field: "name",
BoostVal: 1.0,
Explain: true,
},
},
Explain: true,
Min: 0,
},
results: []*DocumentMatch{
&DocumentMatch{
ID: "1",
Score: 0.6775110856165737,
},
&DocumentMatch{
ID: "3",
Score: 0.6775110856165737,
},
},
},
2014-04-25 18:33:42 +02:00
// test a nested disjunction
{
index: twoDocIndex,
query: &TermDisjunctionQuery{
Terms: []Query{
&TermQuery{
Term: "ravi",
Field: "name",
BoostVal: 1.0,
Explain: true,
},
&TermDisjunctionQuery{
Terms: []Query{
&TermQuery{
Term: "marty",
Field: "name",
BoostVal: 1.0,
Explain: true,
},
&TermQuery{
Term: "dustin",
Field: "name",
BoostVal: 1.0,
Explain: true,
},
},
Explain: true,
Min: 0,
},
},
Explain: true,
Min: 0,
},
results: []*DocumentMatch{
&DocumentMatch{
ID: "1",
Score: 0.33875554280828685,
},
&DocumentMatch{
ID: "3",
Score: 0.33875554280828685,
},
&DocumentMatch{
ID: "4",
Score: 0.5531854849465642,
},
},
},
2014-04-25 17:31:28 +02:00
}
for testIndex, test := range tests {
searcher, err := test.query.Searcher(test.index)
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) {
2014-04-25 17:31:28 +02:00
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)
}
}
}
func TestDisjunctionAdvance(t *testing.T) {
query := &TermDisjunctionQuery{
Terms: []Query{
&TermQuery{
Term: "marty",
Field: "name",
BoostVal: 1.0,
Explain: true,
},
&TermQuery{
Term: "dustin",
Field: "name",
BoostVal: 1.0,
Explain: true,
},
},
Explain: true,
Min: 0,
}
searcher, err := query.Searcher(twoDocIndex)
match, err := searcher.Advance("3")
if err != nil {
t.Errorf("unexpected error: %v", err)
}
if match == nil {
t.Errorf("expected 3, got nil")
}
}