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
140 lines
3.4 KiB
Go
140 lines
3.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 facets
|
|
|
|
import (
|
|
"container/list"
|
|
|
|
"github.com/blevesearch/bleve/index"
|
|
"github.com/blevesearch/bleve/numeric_util"
|
|
"github.com/blevesearch/bleve/search"
|
|
)
|
|
|
|
type numericRange struct {
|
|
min *float64
|
|
max *float64
|
|
}
|
|
|
|
type NumericFacetBuilder struct {
|
|
size int
|
|
field string
|
|
termsCount map[string]int
|
|
total int
|
|
missing int
|
|
ranges map[string]*numericRange
|
|
}
|
|
|
|
func NewNumericFacetBuilder(field string, size int) *NumericFacetBuilder {
|
|
return &NumericFacetBuilder{
|
|
size: size,
|
|
field: field,
|
|
termsCount: make(map[string]int),
|
|
ranges: make(map[string]*numericRange, 0),
|
|
}
|
|
}
|
|
|
|
func (fb *NumericFacetBuilder) AddRange(name string, min, max *float64) {
|
|
r := numericRange{
|
|
min: min,
|
|
max: max,
|
|
}
|
|
fb.ranges[name] = &r
|
|
}
|
|
|
|
func (fb *NumericFacetBuilder) Update(ft index.FieldTerms) {
|
|
terms, ok := ft[fb.field]
|
|
if ok {
|
|
for _, term := range terms {
|
|
// only consider the values which are shifted 0
|
|
prefixCoded := numeric_util.PrefixCoded(term)
|
|
shift, err := prefixCoded.Shift()
|
|
if err == nil && shift == 0 {
|
|
i64, err := prefixCoded.Int64()
|
|
if err == nil {
|
|
f64 := numeric_util.Int64ToFloat64(i64)
|
|
|
|
// look at each of the ranges for a match
|
|
for rangeName, r := range fb.ranges {
|
|
|
|
if (r.min == nil || f64 >= *r.min) && (r.max == nil || f64 < *r.max) {
|
|
|
|
existingCount, existed := fb.termsCount[rangeName]
|
|
if existed {
|
|
fb.termsCount[rangeName] = existingCount + 1
|
|
} else {
|
|
fb.termsCount[rangeName] = 1
|
|
}
|
|
fb.total++
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
} else {
|
|
fb.missing++
|
|
}
|
|
}
|
|
|
|
func (fb *NumericFacetBuilder) Result() search.FacetResult {
|
|
rv := search.FacetResult{
|
|
Field: fb.field,
|
|
Total: fb.total,
|
|
Missing: fb.missing,
|
|
}
|
|
|
|
// FIXME better implementation needed here this is quick and dirty
|
|
topN := list.New()
|
|
|
|
// walk entries and find top N
|
|
OUTER:
|
|
for term, count := range fb.termsCount {
|
|
numericRange := fb.ranges[term]
|
|
tf := &search.NumericRangeFacet{
|
|
Name: term,
|
|
Count: count,
|
|
Min: numericRange.min,
|
|
Max: numericRange.max,
|
|
}
|
|
|
|
for e := topN.Front(); e != nil; e = e.Next() {
|
|
curr := e.Value.(*search.NumericRangeFacet)
|
|
if tf.Count < curr.Count {
|
|
|
|
topN.InsertBefore(tf, e)
|
|
// if we just made the list too long
|
|
if topN.Len() > fb.size {
|
|
// remove the head
|
|
topN.Remove(topN.Front())
|
|
}
|
|
continue OUTER
|
|
}
|
|
}
|
|
// if we got to the end, we still have to add it
|
|
topN.PushBack(tf)
|
|
if topN.Len() > fb.size {
|
|
// remove the head
|
|
topN.Remove(topN.Front())
|
|
}
|
|
|
|
}
|
|
|
|
// we now have the list of the top N facets
|
|
rv.NumericRanges = make([]*search.NumericRangeFacet, topN.Len())
|
|
i := 0
|
|
notOther := 0
|
|
for e := topN.Back(); e != nil; e = e.Prev() {
|
|
rv.NumericRanges[i] = e.Value.(*search.NumericRangeFacet)
|
|
i++
|
|
notOther += e.Value.(*search.NumericRangeFacet).Count
|
|
}
|
|
rv.Other = fb.total - notOther
|
|
|
|
return rv
|
|
}
|