123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596 |
- // 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/search"
- )
-
- type TermsFacetBuilder struct {
- size int
- field string
- termsCount map[string]int
- total int
- missing int
- sawValue bool
- }
-
- 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) UpdateVisitor(field string, term []byte) {
- if field == fb.field {
- fb.sawValue = true
- fb.termsCount[string(term)] = fb.termsCount[string(term)] + 1
- fb.total++
- }
- }
-
- func (fb *TermsFacetBuilder) StartDoc() {
- fb.sawValue = false
- }
-
- func (fb *TermsFacetBuilder) EndDoc() {
- if !fb.sawValue {
- 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
- }
|