95 lines
2 KiB
Go
95 lines
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 facet
|
|
|
|
import (
|
|
"sort"
|
|
|
|
"github.com/blevesearch/bleve/index"
|
|
"github.com/blevesearch/bleve/search"
|
|
)
|
|
|
|
type TermsFacetBuilder struct {
|
|
size int
|
|
field string
|
|
termsCount map[string]int
|
|
total int
|
|
missing int
|
|
}
|
|
|
|
func NewTermsFacetBuilder(field string, size int) *TermsFacetBuilder {
|
|
return &TermsFacetBuilder{
|
|
size: size,
|
|
field: field,
|
|
termsCount: make(map[string]int),
|
|
}
|
|
}
|
|
|
|
func (fb *TermsFacetBuilder) Field() string {
|
|
return fb.field
|
|
}
|
|
|
|
func (fb *TermsFacetBuilder) Update(ft index.FieldTerms) {
|
|
terms, ok := ft[fb.field]
|
|
if ok {
|
|
for _, term := range terms {
|
|
existingCount, existed := fb.termsCount[term]
|
|
if existed {
|
|
fb.termsCount[term] = existingCount + 1
|
|
} else {
|
|
fb.termsCount[term] = 1
|
|
}
|
|
fb.total++
|
|
}
|
|
} else {
|
|
fb.missing++
|
|
}
|
|
}
|
|
|
|
func (fb *TermsFacetBuilder) Result() *search.FacetResult {
|
|
rv := search.FacetResult{
|
|
Field: fb.field,
|
|
Total: fb.total,
|
|
Missing: fb.missing,
|
|
}
|
|
|
|
rv.Terms = make([]*search.TermFacet, 0, len(fb.termsCount))
|
|
|
|
for term, count := range fb.termsCount {
|
|
tf := &search.TermFacet{
|
|
Term: term,
|
|
Count: count,
|
|
}
|
|
|
|
rv.Terms = append(rv.Terms, tf)
|
|
}
|
|
|
|
sort.Sort(rv.Terms)
|
|
|
|
// we now have the list of the top N facets
|
|
trimTopN := fb.size
|
|
if trimTopN > len(rv.Terms) {
|
|
trimTopN = len(rv.Terms)
|
|
}
|
|
rv.Terms = rv.Terms[:trimTopN]
|
|
|
|
notOther := 0
|
|
for _, tf := range rv.Terms {
|
|
notOther += tf.Count
|
|
}
|
|
rv.Other = fb.total - notOther
|
|
|
|
return &rv
|
|
}
|