2017-09-17 01:46:21 +05:30
|
|
|
// Copyright (c) 2017 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 searcher
|
|
|
|
|
|
|
|
import (
|
2020-09-07 04:21:14 +05:30
|
|
|
"fmt"
|
2021-01-18 06:51:14 +05:30
|
|
|
"github.com/blevesearch/bleve/v2/search"
|
|
|
|
index "github.com/blevesearch/bleve_index_api"
|
2017-09-17 01:46:21 +05:30
|
|
|
)
|
|
|
|
|
|
|
|
func NewMultiTermSearcher(indexReader index.IndexReader, terms []string,
|
|
|
|
field string, boost float64, options search.SearcherOptions, limit bool) (
|
|
|
|
search.Searcher, error) {
|
2020-09-07 04:21:14 +05:30
|
|
|
|
|
|
|
if tooManyClauses(len(terms)) {
|
|
|
|
if optionsDisjunctionOptimizable(options) {
|
|
|
|
return optimizeMultiTermSearcher(indexReader, terms, field, boost, options)
|
|
|
|
}
|
|
|
|
if limit {
|
|
|
|
return nil, tooManyClausesErr(field, len(terms))
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
qsearchers, err := makeBatchSearchers(indexReader, terms, field, boost, options)
|
|
|
|
if err != nil {
|
|
|
|
return nil, err
|
2019-02-18 06:20:26 +05:30
|
|
|
}
|
|
|
|
|
2020-09-07 04:21:14 +05:30
|
|
|
// build disjunction searcher of these ranges
|
|
|
|
return newMultiTermSearcherInternal(indexReader, qsearchers, field, boost,
|
|
|
|
options, limit)
|
|
|
|
}
|
|
|
|
|
|
|
|
func NewMultiTermSearcherBytes(indexReader index.IndexReader, terms [][]byte,
|
|
|
|
field string, boost float64, options search.SearcherOptions, limit bool) (
|
|
|
|
search.Searcher, error) {
|
|
|
|
|
|
|
|
if tooManyClauses(len(terms)) {
|
|
|
|
if optionsDisjunctionOptimizable(options) {
|
|
|
|
return optimizeMultiTermSearcherBytes(indexReader, terms, field, boost, options)
|
|
|
|
}
|
|
|
|
|
|
|
|
if limit {
|
|
|
|
return nil, tooManyClausesErr(field, len(terms))
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
qsearchers, err := makeBatchSearchersBytes(indexReader, terms, field, boost, options)
|
|
|
|
if err != nil {
|
|
|
|
return nil, err
|
|
|
|
}
|
|
|
|
|
|
|
|
// build disjunction searcher of these ranges
|
|
|
|
return newMultiTermSearcherInternal(indexReader, qsearchers, field, boost,
|
|
|
|
options, limit)
|
|
|
|
}
|
|
|
|
|
|
|
|
func newMultiTermSearcherInternal(indexReader index.IndexReader,
|
|
|
|
searchers []search.Searcher, field string, boost float64,
|
|
|
|
options search.SearcherOptions, limit bool) (
|
|
|
|
search.Searcher, error) {
|
|
|
|
|
|
|
|
// build disjunction searcher of these ranges
|
|
|
|
searcher, err := newDisjunctionSearcher(indexReader, searchers, 0, options,
|
|
|
|
limit)
|
|
|
|
if err != nil {
|
|
|
|
for _, s := range searchers {
|
|
|
|
_ = s.Close()
|
|
|
|
}
|
|
|
|
return nil, err
|
|
|
|
}
|
|
|
|
|
|
|
|
return searcher, nil
|
|
|
|
}
|
|
|
|
|
|
|
|
func optimizeMultiTermSearcher(indexReader index.IndexReader, terms []string,
|
|
|
|
field string, boost float64, options search.SearcherOptions) (
|
|
|
|
search.Searcher, error) {
|
|
|
|
var finalSearcher search.Searcher
|
|
|
|
for len(terms) > 0 {
|
|
|
|
var batchTerms []string
|
|
|
|
if len(terms) > DisjunctionMaxClauseCount {
|
|
|
|
batchTerms = terms[:DisjunctionMaxClauseCount]
|
|
|
|
terms = terms[DisjunctionMaxClauseCount:]
|
|
|
|
} else {
|
|
|
|
batchTerms = terms
|
|
|
|
terms = nil
|
|
|
|
}
|
|
|
|
batch, err := makeBatchSearchers(indexReader, batchTerms, field, boost, options)
|
|
|
|
if err != nil {
|
|
|
|
return nil, err
|
|
|
|
}
|
|
|
|
if finalSearcher != nil {
|
|
|
|
batch = append(batch, finalSearcher)
|
|
|
|
}
|
|
|
|
cleanup := func() {
|
|
|
|
for _, searcher := range batch {
|
|
|
|
if searcher != nil {
|
|
|
|
_ = searcher.Close()
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
finalSearcher, err = optimizeCompositeSearcher("disjunction:unadorned",
|
|
|
|
indexReader, batch, options)
|
|
|
|
// all searchers in batch should be closed, regardless of error or optimization failure
|
|
|
|
// either we're returning, or continuing and only finalSearcher is needed for next loop
|
|
|
|
cleanup()
|
|
|
|
if err != nil {
|
|
|
|
return nil, err
|
|
|
|
}
|
|
|
|
if finalSearcher == nil {
|
|
|
|
return nil, fmt.Errorf("unable to optimize")
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return finalSearcher, nil
|
|
|
|
}
|
|
|
|
|
|
|
|
func makeBatchSearchers(indexReader index.IndexReader, terms []string, field string,
|
|
|
|
boost float64, options search.SearcherOptions) ([]search.Searcher, error) {
|
|
|
|
|
2017-09-17 01:46:21 +05:30
|
|
|
qsearchers := make([]search.Searcher, len(terms))
|
|
|
|
qsearchersClose := func() {
|
|
|
|
for _, searcher := range qsearchers {
|
|
|
|
if searcher != nil {
|
|
|
|
_ = searcher.Close()
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
for i, term := range terms {
|
|
|
|
var err error
|
|
|
|
qsearchers[i], err = NewTermSearcher(indexReader, term, field, boost, options)
|
|
|
|
if err != nil {
|
|
|
|
qsearchersClose()
|
|
|
|
return nil, err
|
|
|
|
}
|
|
|
|
}
|
2020-09-07 04:21:14 +05:30
|
|
|
return qsearchers, nil
|
2017-09-17 01:46:21 +05:30
|
|
|
}
|
|
|
|
|
2020-09-07 04:21:14 +05:30
|
|
|
func optimizeMultiTermSearcherBytes(indexReader index.IndexReader, terms [][]byte,
|
|
|
|
field string, boost float64, options search.SearcherOptions) (
|
2017-09-17 01:46:21 +05:30
|
|
|
search.Searcher, error) {
|
2020-09-07 04:21:14 +05:30
|
|
|
|
|
|
|
var finalSearcher search.Searcher
|
|
|
|
for len(terms) > 0 {
|
|
|
|
var batchTerms [][]byte
|
|
|
|
if len(terms) > DisjunctionMaxClauseCount {
|
|
|
|
batchTerms = terms[:DisjunctionMaxClauseCount]
|
|
|
|
terms = terms[DisjunctionMaxClauseCount:]
|
|
|
|
} else {
|
|
|
|
batchTerms = terms
|
|
|
|
terms = nil
|
|
|
|
}
|
|
|
|
batch, err := makeBatchSearchersBytes(indexReader, batchTerms, field, boost, options)
|
|
|
|
if err != nil {
|
|
|
|
return nil, err
|
|
|
|
}
|
|
|
|
if finalSearcher != nil {
|
|
|
|
batch = append(batch, finalSearcher)
|
|
|
|
}
|
|
|
|
cleanup := func() {
|
|
|
|
for _, searcher := range batch {
|
|
|
|
if searcher != nil {
|
|
|
|
_ = searcher.Close()
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
finalSearcher, err = optimizeCompositeSearcher("disjunction:unadorned",
|
|
|
|
indexReader, batch, options)
|
|
|
|
// all searchers in batch should be closed, regardless of error or optimization failure
|
|
|
|
// either we're returning, or continuing and only finalSearcher is needed for next loop
|
|
|
|
cleanup()
|
|
|
|
if err != nil {
|
|
|
|
return nil, err
|
|
|
|
}
|
|
|
|
if finalSearcher == nil {
|
|
|
|
return nil, fmt.Errorf("unable to optimize")
|
|
|
|
}
|
2019-02-18 06:20:26 +05:30
|
|
|
}
|
2020-09-07 04:21:14 +05:30
|
|
|
return finalSearcher, nil
|
|
|
|
}
|
|
|
|
|
|
|
|
func makeBatchSearchersBytes(indexReader index.IndexReader, terms [][]byte, field string,
|
|
|
|
boost float64, options search.SearcherOptions) ([]search.Searcher, error) {
|
2019-02-18 06:20:26 +05:30
|
|
|
|
2017-09-17 01:46:21 +05:30
|
|
|
qsearchers := make([]search.Searcher, len(terms))
|
|
|
|
qsearchersClose := func() {
|
|
|
|
for _, searcher := range qsearchers {
|
|
|
|
if searcher != nil {
|
|
|
|
_ = searcher.Close()
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
for i, term := range terms {
|
|
|
|
var err error
|
|
|
|
qsearchers[i], err = NewTermSearcherBytes(indexReader, term, field, boost, options)
|
|
|
|
if err != nil {
|
|
|
|
qsearchersClose()
|
|
|
|
return nil, err
|
|
|
|
}
|
|
|
|
}
|
2020-09-07 04:21:14 +05:30
|
|
|
return qsearchers, nil
|
2017-09-17 01:46:21 +05:30
|
|
|
}
|