![Marty Schoch](/assets/img/avatar_default.png)
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)
198 lines
4.7 KiB
Go
198 lines
4.7 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 (
|
|
"math"
|
|
|
|
"github.com/blevesearch/bleve/index"
|
|
"github.com/blevesearch/bleve/search"
|
|
)
|
|
|
|
type PhraseSearcher struct {
|
|
initialized bool
|
|
indexReader index.IndexReader
|
|
mustSearcher *ConjunctionSearcher
|
|
queryNorm float64
|
|
currMust *search.DocumentMatchInternal
|
|
slop int
|
|
terms []string
|
|
}
|
|
|
|
func NewPhraseSearcher(indexReader index.IndexReader, mustSearcher *ConjunctionSearcher, terms []string) (*PhraseSearcher, error) {
|
|
// build our searcher
|
|
rv := PhraseSearcher{
|
|
indexReader: indexReader,
|
|
mustSearcher: mustSearcher,
|
|
terms: terms,
|
|
}
|
|
rv.computeQueryNorm()
|
|
return &rv, nil
|
|
}
|
|
|
|
func (s *PhraseSearcher) computeQueryNorm() {
|
|
// first calculate sum of squared weights
|
|
sumOfSquaredWeights := 0.0
|
|
if s.mustSearcher != nil {
|
|
sumOfSquaredWeights += s.mustSearcher.Weight()
|
|
}
|
|
|
|
// now compute query norm from this
|
|
s.queryNorm = 1.0 / math.Sqrt(sumOfSquaredWeights)
|
|
// finally tell all the downstream searchers the norm
|
|
if s.mustSearcher != nil {
|
|
s.mustSearcher.SetQueryNorm(s.queryNorm)
|
|
}
|
|
}
|
|
|
|
func (s *PhraseSearcher) initSearchers() error {
|
|
var err error
|
|
// get all searchers pointing at their first match
|
|
if s.mustSearcher != nil {
|
|
s.currMust, err = s.mustSearcher.Next(nil)
|
|
if err != nil {
|
|
return err
|
|
}
|
|
}
|
|
|
|
s.initialized = true
|
|
return nil
|
|
}
|
|
|
|
func (s *PhraseSearcher) advanceNextMust() error {
|
|
var err error
|
|
|
|
if s.mustSearcher != nil {
|
|
s.currMust, err = s.mustSearcher.Next(nil)
|
|
if err != nil {
|
|
return err
|
|
}
|
|
}
|
|
|
|
return nil
|
|
}
|
|
|
|
func (s *PhraseSearcher) Weight() float64 {
|
|
var rv float64
|
|
rv += s.mustSearcher.Weight()
|
|
|
|
return rv
|
|
}
|
|
|
|
func (s *PhraseSearcher) SetQueryNorm(qnorm float64) {
|
|
s.mustSearcher.SetQueryNorm(qnorm)
|
|
}
|
|
|
|
func (s *PhraseSearcher) Next(preAllocated *search.DocumentMatchInternal) (*search.DocumentMatchInternal, error) {
|
|
if !s.initialized {
|
|
err := s.initSearchers()
|
|
if err != nil {
|
|
return nil, err
|
|
}
|
|
}
|
|
|
|
var rv *search.DocumentMatchInternal
|
|
for s.currMust != nil {
|
|
rvftlm := make(search.FieldTermLocationMap, 0)
|
|
freq := 0
|
|
firstTerm := s.terms[0]
|
|
for field, termLocMap := range s.currMust.Locations {
|
|
rvtlm := make(search.TermLocationMap, 0)
|
|
locations, ok := termLocMap[firstTerm]
|
|
if ok {
|
|
OUTER:
|
|
for _, location := range locations {
|
|
crvtlm := make(search.TermLocationMap, 0)
|
|
INNER:
|
|
for i := 0; i < len(s.terms); i++ {
|
|
nextTerm := s.terms[i]
|
|
if nextTerm != "" {
|
|
// look through all these term locations
|
|
// to try and find the correct offsets
|
|
nextLocations, ok := termLocMap[nextTerm]
|
|
if ok {
|
|
for _, nextLocation := range nextLocations {
|
|
if nextLocation.Pos == location.Pos+float64(i) && nextLocation.SameArrayElement(location) {
|
|
// found a location match for this term
|
|
crvtlm.AddLocation(nextTerm, nextLocation)
|
|
continue INNER
|
|
}
|
|
}
|
|
// if we got here we didn't find a location match for this term
|
|
continue OUTER
|
|
} else {
|
|
continue OUTER
|
|
}
|
|
}
|
|
}
|
|
// if we got here all the terms matched
|
|
freq++
|
|
search.MergeTermLocationMaps(rvtlm, crvtlm)
|
|
rvftlm[field] = rvtlm
|
|
}
|
|
}
|
|
}
|
|
|
|
if freq > 0 {
|
|
// return match
|
|
rv = s.currMust
|
|
rv.Locations = rvftlm
|
|
err := s.advanceNextMust()
|
|
if err != nil {
|
|
return nil, err
|
|
}
|
|
return rv, nil
|
|
}
|
|
|
|
err := s.advanceNextMust()
|
|
if err != nil {
|
|
return nil, err
|
|
}
|
|
}
|
|
|
|
return nil, nil
|
|
}
|
|
|
|
func (s *PhraseSearcher) Advance(ID index.IndexInternalID, preAllocated *search.DocumentMatchInternal) (*search.DocumentMatchInternal, error) {
|
|
if !s.initialized {
|
|
err := s.initSearchers()
|
|
if err != nil {
|
|
return nil, err
|
|
}
|
|
}
|
|
var err error
|
|
s.currMust, err = s.mustSearcher.Advance(ID, nil)
|
|
if err != nil {
|
|
return nil, err
|
|
}
|
|
return s.Next(preAllocated)
|
|
}
|
|
|
|
func (s *PhraseSearcher) Count() uint64 {
|
|
// for now return a worst case
|
|
var sum uint64
|
|
sum += s.mustSearcher.Count()
|
|
return sum
|
|
}
|
|
|
|
func (s *PhraseSearcher) Close() error {
|
|
if s.mustSearcher != nil {
|
|
err := s.mustSearcher.Close()
|
|
if err != nil {
|
|
return err
|
|
}
|
|
}
|
|
return nil
|
|
}
|
|
|
|
func (s *PhraseSearcher) Min() int {
|
|
return 0
|
|
}
|