47c239ca7b
the TopNCollector now can either use a heap or a list i did not code it to use an interface, because this is a very hot loop during searching. rather, it lets bleve developers easily toggle between the two (or other ideas) by changing 2 lines The list is faster in the benchmark, but causes more allocations. The list is once again the default (for now). To switch to the heap implementation, change: store *collectStoreList to store *collectStoreHeap and newStoreList(... to newStoreHeap(...
74 lines
1.9 KiB
Go
74 lines
1.9 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 collectors
|
|
|
|
import (
|
|
"container/list"
|
|
|
|
"github.com/blevesearch/bleve/search"
|
|
)
|
|
|
|
type collectStoreList struct {
|
|
results *list.List
|
|
compare collectorCompare
|
|
}
|
|
|
|
func newStoreList(cap int, compare collectorCompare) *collectStoreList {
|
|
rv := &collectStoreList{
|
|
results: list.New(),
|
|
compare: compare,
|
|
}
|
|
|
|
return rv
|
|
}
|
|
|
|
func (c *collectStoreList) Add(doc *search.DocumentMatch) {
|
|
for e := c.results.Front(); e != nil; e = e.Next() {
|
|
curr := e.Value.(*search.DocumentMatch)
|
|
if c.compare(doc, curr) >= 0 {
|
|
c.results.InsertBefore(doc, e)
|
|
return
|
|
}
|
|
}
|
|
// if we got to the end, we still have to add it
|
|
c.results.PushBack(doc)
|
|
}
|
|
|
|
func (c *collectStoreList) RemoveLast() *search.DocumentMatch {
|
|
return c.results.Remove(c.results.Front()).(*search.DocumentMatch)
|
|
}
|
|
|
|
func (c *collectStoreList) Final(skip int, fixup collectorFixup) (search.DocumentMatchCollection, error) {
|
|
if c.results.Len()-skip > 0 {
|
|
rv := make(search.DocumentMatchCollection, c.results.Len()-skip)
|
|
i := 0
|
|
skipped := 0
|
|
for e := c.results.Back(); e != nil; e = e.Prev() {
|
|
if skipped < skip {
|
|
skipped++
|
|
continue
|
|
}
|
|
|
|
rv[i] = e.Value.(*search.DocumentMatch)
|
|
err := fixup(rv[i])
|
|
if err != nil {
|
|
return nil, err
|
|
}
|
|
i++
|
|
}
|
|
return rv, nil
|
|
}
|
|
return search.DocumentMatchCollection{}, nil
|
|
}
|
|
|
|
func (c *collectStoreList) Len() int {
|
|
return c.results.Len()
|
|
}
|