2ee7289bc8
this started initially to relocate highlighting into a self contained package, which would then also use the registry however, it turned into a much larger refactor in order to avoid cyclic imports now facets, searchers, scorers and collectors are also broken out into subpackages of search
95 lines
2.2 KiB
Go
95 lines
2.2 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 (
|
|
"github.com/blevesearch/bleve/index"
|
|
"github.com/blevesearch/bleve/search"
|
|
"github.com/blevesearch/bleve/search/scorers"
|
|
)
|
|
|
|
type TermSearcher struct {
|
|
index index.Index
|
|
term string
|
|
field string
|
|
explain bool
|
|
reader index.TermFieldReader
|
|
scorer *scorers.TermQueryScorer
|
|
}
|
|
|
|
func NewTermSearcher(index index.Index, term string, field string, boost float64, explain bool) (*TermSearcher, error) {
|
|
reader, err := index.TermFieldReader([]byte(term), field)
|
|
if err != nil {
|
|
return nil, err
|
|
}
|
|
scorer := scorers.NewTermQueryScorer(term, field, boost, index.DocCount(), reader.Count(), explain)
|
|
return &TermSearcher{
|
|
index: index,
|
|
term: term,
|
|
field: field,
|
|
explain: explain,
|
|
reader: reader,
|
|
scorer: scorer,
|
|
}, nil
|
|
}
|
|
|
|
func (s *TermSearcher) Count() uint64 {
|
|
return s.reader.Count()
|
|
}
|
|
|
|
func (s *TermSearcher) Weight() float64 {
|
|
return s.scorer.Weight()
|
|
}
|
|
|
|
func (s *TermSearcher) SetQueryNorm(qnorm float64) {
|
|
s.scorer.SetQueryNorm(qnorm)
|
|
}
|
|
|
|
func (s *TermSearcher) Next() (*search.DocumentMatch, error) {
|
|
termMatch, err := s.reader.Next()
|
|
if err != nil {
|
|
return nil, err
|
|
}
|
|
|
|
if termMatch == nil {
|
|
return nil, nil
|
|
}
|
|
|
|
// score match
|
|
docMatch := s.scorer.Score(termMatch)
|
|
// return doc match
|
|
return docMatch, nil
|
|
|
|
}
|
|
|
|
func (s *TermSearcher) Advance(ID string) (*search.DocumentMatch, error) {
|
|
termMatch, err := s.reader.Advance(ID)
|
|
if err != nil {
|
|
return nil, err
|
|
}
|
|
|
|
if termMatch == nil {
|
|
return nil, nil
|
|
}
|
|
|
|
// score match
|
|
docMatch := s.scorer.Score(termMatch)
|
|
|
|
// return doc match
|
|
return docMatch, nil
|
|
}
|
|
|
|
func (s *TermSearcher) Close() {
|
|
s.reader.Close()
|
|
}
|
|
|
|
func (s *TermSearcher) Min() int {
|
|
return 0
|
|
}
|