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
45 lines
1.4 KiB
Go
45 lines
1.4 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 simple
|
|
|
|
import (
|
|
"github.com/blevesearch/bleve/search"
|
|
"github.com/blevesearch/bleve/search/highlight"
|
|
)
|
|
|
|
// SimpleFragmentScorer will score fragments by how many
|
|
// unique terms occur in the fragment with no regard for
|
|
// any boost values used in the original query
|
|
type SimpleFragmentScorer struct {
|
|
tlm search.TermLocationMap
|
|
}
|
|
|
|
func NewSimpleFragmentScorer(tlm search.TermLocationMap) *SimpleFragmentScorer {
|
|
return &SimpleFragmentScorer{
|
|
tlm: tlm,
|
|
}
|
|
}
|
|
|
|
func (s *SimpleFragmentScorer) Score(f *highlight.Fragment) {
|
|
score := 0.0
|
|
OUTER:
|
|
for _, locations := range s.tlm {
|
|
for _, location := range locations {
|
|
if int(location.Start) >= f.Start && int(location.End) <= f.End {
|
|
score += 1.0
|
|
// once we find a term in the fragment
|
|
// don't care about additional matches
|
|
continue OUTER
|
|
}
|
|
}
|
|
}
|
|
f.Score = score
|
|
}
|