f8fdfebb6c
- TermSearcher has alternate constructor if term is []byte, this can avoid copying in some cases. TermScorer updated to accept []byte term. Also removed a few struct fields which were not being used. - New MultiTermSearcher searches for documents containing any of a list of terms. Current implementation simply uses DisjunctionSearcher. - Several other searcher constructors now simply build a list of terms and then delegate to the MultiTermSearcher - NewPrefixSearcher - NewRegexpSearcher - NewFuzzySearcher - NewNumericRangeSearcher - NewGeoBoundingBoxSearcher and NewGeoPointDistanceSearcher make use of the MultiTermSearcher internally, and follow the pattern of returning an existing search.Searcher, as opposed to their own wrapping struct. - Callback filter functions used in NewGeoBoundingBoxSearcher and NewGeoPointDistanceSearcher have been extracted into separate functions which makes the code much easier to read.
79 lines
2.2 KiB
Go
79 lines
2.2 KiB
Go
// 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 (
|
|
"github.com/blevesearch/bleve/index"
|
|
"github.com/blevesearch/bleve/search"
|
|
)
|
|
|
|
func NewMultiTermSearcher(indexReader index.IndexReader, terms []string,
|
|
field string, boost float64, options search.SearcherOptions) (
|
|
search.Searcher, error) {
|
|
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
|
|
}
|
|
}
|
|
// build disjunction searcher of these ranges
|
|
searcher, err := NewDisjunctionSearcher(indexReader, qsearchers, 0, options)
|
|
if err != nil {
|
|
qsearchersClose()
|
|
return nil, err
|
|
}
|
|
|
|
return searcher, nil
|
|
}
|
|
|
|
func NewMultiTermSearcherBytes(indexReader index.IndexReader, terms [][]byte,
|
|
field string, boost float64, options search.SearcherOptions) (
|
|
search.Searcher, error) {
|
|
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
|
|
}
|
|
}
|
|
// build disjunction searcher of these ranges
|
|
searcher, err := NewDisjunctionSearcher(indexReader, qsearchers, 0, options)
|
|
if err != nil {
|
|
qsearchersClose()
|
|
return nil, err
|
|
}
|
|
|
|
return searcher, nil
|
|
}
|