5aa9e95468
index id's are now opaque (until finally returned to top-level user) - the TermFieldDoc's returned by TermFieldReader no longer contain doc id - instead they return an opaque IndexInternalID - items returned are still in the "natural index order" - but that is no longer guaranteed to be "doc id order" - correct behavior requires that they all follow the same order - but not any particular order - new API FinalizeDocID which converts index internal ID's to public string ID - APIs used internally which previously took doc id now take IndexInternalID - that is DocumentFieldTerms() and DocumentFieldTermsForFields() - however, APIs that are used externally do not reflect this change - that is Document() - DocumentIDReader follows the same changes, but this is less obvious - behavior clarified, used to iterate doc ids, BUT NOT in doc id order - method STILL available to iterate doc ids in range - but again, you won't get them in any meaningful order - new method to iterate actual doc ids from list of possible ids - this was introduced to make the DocIDSearcher continue working searchers now work with the new opaque index internal doc ids - they return new DocumentMatchInternal (which does not have string ID) scorerers also work with these opaque index internal doc ids - they return DocumentMatchInternal (which does not have string ID) collectors now also perform a final step of converting the final result - they STILL return traditional DocumentMatch (with string ID) - but they now also require an IndexReader (so that they can do the conversion)
208 lines
5.5 KiB
Go
208 lines
5.5 KiB
Go
// 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 searchers
|
|
|
|
import (
|
|
"testing"
|
|
|
|
"github.com/blevesearch/bleve/index/upside_down"
|
|
"github.com/blevesearch/bleve/search"
|
|
)
|
|
|
|
func TestDisjunctionSearch(t *testing.T) {
|
|
|
|
twoDocIndexReader, err := twoDocIndex.Reader()
|
|
if err != nil {
|
|
t.Error(err)
|
|
}
|
|
defer func() {
|
|
err := twoDocIndexReader.Close()
|
|
if err != nil {
|
|
t.Fatal(err)
|
|
}
|
|
}()
|
|
|
|
martyTermSearcher, err := NewTermSearcher(twoDocIndexReader, "marty", "name", 1.0, true)
|
|
if err != nil {
|
|
t.Fatal(err)
|
|
}
|
|
dustinTermSearcher, err := NewTermSearcher(twoDocIndexReader, "dustin", "name", 1.0, true)
|
|
if err != nil {
|
|
t.Fatal(err)
|
|
}
|
|
martyOrDustinSearcher, err := NewDisjunctionSearcher(twoDocIndexReader, []search.Searcher{martyTermSearcher, dustinTermSearcher}, 0, true)
|
|
if err != nil {
|
|
t.Fatal(err)
|
|
}
|
|
|
|
martyTermSearcher2, err := NewTermSearcher(twoDocIndexReader, "marty", "name", 1.0, true)
|
|
if err != nil {
|
|
t.Fatal(err)
|
|
}
|
|
dustinTermSearcher2, err := NewTermSearcher(twoDocIndexReader, "dustin", "name", 1.0, true)
|
|
if err != nil {
|
|
t.Fatal(err)
|
|
}
|
|
martyOrDustinSearcher2, err := NewDisjunctionSearcher(twoDocIndexReader, []search.Searcher{martyTermSearcher2, dustinTermSearcher2}, 0, true)
|
|
if err != nil {
|
|
t.Fatal(err)
|
|
}
|
|
|
|
raviTermSearcher, err := NewTermSearcher(twoDocIndexReader, "ravi", "name", 1.0, true)
|
|
if err != nil {
|
|
t.Fatal(err)
|
|
}
|
|
nestedRaviOrMartyOrDustinSearcher, err := NewDisjunctionSearcher(twoDocIndexReader, []search.Searcher{raviTermSearcher, martyOrDustinSearcher2}, 0, true)
|
|
if err != nil {
|
|
t.Fatal(err)
|
|
}
|
|
|
|
tests := []struct {
|
|
searcher search.Searcher
|
|
results []*search.DocumentMatchInternal
|
|
}{
|
|
{
|
|
searcher: martyOrDustinSearcher,
|
|
results: []*search.DocumentMatchInternal{
|
|
{
|
|
ID: upside_down.InternalId("1"),
|
|
Score: 0.6775110856165737,
|
|
},
|
|
{
|
|
ID: upside_down.InternalId("3"),
|
|
Score: 0.6775110856165737,
|
|
},
|
|
},
|
|
},
|
|
// test a nested disjunction
|
|
{
|
|
searcher: nestedRaviOrMartyOrDustinSearcher,
|
|
results: []*search.DocumentMatchInternal{
|
|
{
|
|
ID: upside_down.InternalId("1"),
|
|
Score: 0.2765927424732821,
|
|
},
|
|
{
|
|
ID: upside_down.InternalId("3"),
|
|
Score: 0.2765927424732821,
|
|
},
|
|
{
|
|
ID: upside_down.InternalId("4"),
|
|
Score: 0.5531854849465642,
|
|
},
|
|
},
|
|
},
|
|
}
|
|
|
|
for testIndex, test := range tests {
|
|
defer func() {
|
|
err := test.searcher.Close()
|
|
if err != nil {
|
|
t.Fatal(err)
|
|
}
|
|
}()
|
|
|
|
next, err := test.searcher.Next(nil)
|
|
i := 0
|
|
for err == nil && next != nil {
|
|
if i < len(test.results) {
|
|
if !next.ID.Equals(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 = test.searcher.Next(nil)
|
|
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) {
|
|
|
|
twoDocIndexReader, err := twoDocIndex.Reader()
|
|
if err != nil {
|
|
t.Error(err)
|
|
}
|
|
defer func() {
|
|
err := twoDocIndexReader.Close()
|
|
if err != nil {
|
|
t.Fatal(err)
|
|
}
|
|
}()
|
|
|
|
martyTermSearcher, err := NewTermSearcher(twoDocIndexReader, "marty", "name", 1.0, true)
|
|
if err != nil {
|
|
t.Fatal(err)
|
|
}
|
|
dustinTermSearcher, err := NewTermSearcher(twoDocIndexReader, "dustin", "name", 1.0, true)
|
|
if err != nil {
|
|
t.Fatal(err)
|
|
}
|
|
martyOrDustinSearcher, err := NewDisjunctionSearcher(twoDocIndexReader, []search.Searcher{martyTermSearcher, dustinTermSearcher}, 0, true)
|
|
if err != nil {
|
|
t.Fatal(err)
|
|
}
|
|
|
|
match, err := martyOrDustinSearcher.Advance(upside_down.InternalId("3"), nil)
|
|
if err != nil {
|
|
t.Errorf("unexpected error: %v", err)
|
|
}
|
|
if match == nil {
|
|
t.Errorf("expected 3, got nil")
|
|
}
|
|
}
|
|
|
|
func TestDisjunctionSearchTooMany(t *testing.T) {
|
|
|
|
// set to max to a low non-zero value
|
|
DisjunctionMaxClauseCount = 2
|
|
defer func() {
|
|
// reset it after the test
|
|
DisjunctionMaxClauseCount = 0
|
|
}()
|
|
|
|
twoDocIndexReader, err := twoDocIndex.Reader()
|
|
if err != nil {
|
|
t.Error(err)
|
|
}
|
|
defer func() {
|
|
err := twoDocIndexReader.Close()
|
|
if err != nil {
|
|
t.Fatal(err)
|
|
}
|
|
}()
|
|
|
|
martyTermSearcher, err := NewTermSearcher(twoDocIndexReader, "marty", "name", 1.0, true)
|
|
if err != nil {
|
|
t.Fatal(err)
|
|
}
|
|
dustinTermSearcher, err := NewTermSearcher(twoDocIndexReader, "dustin", "name", 1.0, true)
|
|
if err != nil {
|
|
t.Fatal(err)
|
|
}
|
|
steveTermSearcher, err := NewTermSearcher(twoDocIndexReader, "steve", "name", 1.0, true)
|
|
if err != nil {
|
|
t.Fatal(err)
|
|
}
|
|
_, err = NewDisjunctionSearcher(twoDocIndexReader, []search.Searcher{martyTermSearcher, dustinTermSearcher, steveTermSearcher}, 0, true)
|
|
if err == nil {
|
|
t.Fatal(err)
|
|
}
|
|
}
|