gibheer/bleve
0
0
Fork 0
Code

Revert "optimize when disjunction query has only a single child"

Browse Source 
See also: https://issues.couchbase.com/browse/MB-21046

This reverts commit 6d6fae2895.

It turns out that boolean searcher was depending on its 'should'
constituent (a disjunction query) and its min state changes, so a
rewrite wasn't safe/correct given this situation.
This commit is contained in:
Steve Yen 2016-09-26 14:44:24 -07:00
parent 1f79f65b6a
commit 2b3e6ee836
1 changed files with 0 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
query_disjunction.go
View File

@ -66,10 +66,6 @@ func (q *disjunctionQuery) SetMin(m float64) Query {
}
func (q *disjunctionQuery) Searcher(i index.IndexReader, m *IndexMapping, explain bool) (search.Searcher, error) {
if len(q.Disjuncts) == 1 {
return q.Disjuncts[0].Searcher(i, m, explain)
}
ss := make([]search.Searcher, len(q.Disjuncts))
for in, disjunct := range q.Disjuncts {
var err error