2014-08-11 17:03:29 +02:00
|
|
|
// 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.
|
2014-09-01 17:15:38 +02:00
|
|
|
package facets
|
2014-08-11 17:03:29 +02:00
|
|
|
|
|
|
|
import (
|
|
|
|
"container/list"
|
|
|
|
|
2014-08-28 21:38:57 +02:00
|
|
|
"github.com/blevesearch/bleve/index"
|
2014-09-01 17:15:38 +02:00
|
|
|
"github.com/blevesearch/bleve/search"
|
2014-08-11 17:03:29 +02:00
|
|
|
)
|
|
|
|
|
|
|
|
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) 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++
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2014-09-01 17:15:38 +02:00
|
|
|
func (fb *TermsFacetBuilder) Result() search.FacetResult {
|
|
|
|
rv := search.FacetResult{
|
2014-08-11 17:03:29 +02:00
|
|
|
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 {
|
2014-09-01 17:15:38 +02:00
|
|
|
tf := &search.TermFacet{
|
2014-08-11 17:03:29 +02:00
|
|
|
Term: term,
|
|
|
|
Count: count,
|
|
|
|
}
|
|
|
|
|
|
|
|
for e := topN.Front(); e != nil; e = e.Next() {
|
2014-09-01 17:15:38 +02:00
|
|
|
curr := e.Value.(*search.TermFacet)
|
2014-08-11 17:03:29 +02:00
|
|
|
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
|
2014-09-01 17:15:38 +02:00
|
|
|
rv.Terms = make([]*search.TermFacet, topN.Len())
|
2014-08-11 17:03:29 +02:00
|
|
|
i := 0
|
|
|
|
notOther := 0
|
|
|
|
for e := topN.Back(); e != nil; e = e.Prev() {
|
2014-09-01 17:15:38 +02:00
|
|
|
rv.Terms[i] = e.Value.(*search.TermFacet)
|
2014-08-11 17:03:29 +02:00
|
|
|
i++
|
2014-09-01 17:15:38 +02:00
|
|
|
notOther += e.Value.(*search.TermFacet).Count
|
2014-08-11 17:03:29 +02:00
|
|
|
}
|
|
|
|
rv.Other = fb.total - notOther
|
|
|
|
|
|
|
|
return rv
|
|
|
|
}
|