7e36109b3c
This API (unexported) will estimate the amount of memory needed to execute
a search query over an index before the collector begins data collection.
Sample estimates for certain queries:
{Size: 10, BenchmarkUpsidedownSearchOverhead}
ESTIMATE BENCHMEM
TermQuery 4616 4796
MatchQuery 5210 5405
DisjunctionQuery (Match queries) 7700 8447
DisjunctionQuery (Term queries) 6514 6591
ConjunctionQuery (Match queries) 7524 8175
Nested disjunction query (disjunction of disjunctions) 10306 10708
…
104 lines
2.5 KiB
Go
104 lines
2.5 KiB
Go
// Copyright (c) 2017 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 searcher
|
|
|
|
import (
|
|
"reflect"
|
|
|
|
"github.com/blevesearch/bleve/index"
|
|
"github.com/blevesearch/bleve/search"
|
|
"github.com/blevesearch/bleve/size"
|
|
)
|
|
|
|
var reflectStaticSizeFilteringSearcher int
|
|
|
|
func init() {
|
|
var fs FilteringSearcher
|
|
reflectStaticSizeFilteringSearcher = int(reflect.TypeOf(fs).Size())
|
|
}
|
|
|
|
// FilterFunc defines a function which can filter documents
|
|
// returning true means keep the document
|
|
// returning false means do not keep the document
|
|
type FilterFunc func(d *search.DocumentMatch) bool
|
|
|
|
// FilteringSearcher wraps any other searcher, but checks any Next/Advance
|
|
// call against the supplied FilterFunc
|
|
type FilteringSearcher struct {
|
|
child search.Searcher
|
|
accept FilterFunc
|
|
}
|
|
|
|
func NewFilteringSearcher(s search.Searcher, filter FilterFunc) *FilteringSearcher {
|
|
return &FilteringSearcher{
|
|
child: s,
|
|
accept: filter,
|
|
}
|
|
}
|
|
|
|
func (f *FilteringSearcher) Size() int {
|
|
return reflectStaticSizeFilteringSearcher + size.SizeOfPtr +
|
|
f.child.Size()
|
|
}
|
|
|
|
func (f *FilteringSearcher) Next(ctx *search.SearchContext) (*search.DocumentMatch, error) {
|
|
next, err := f.child.Next(ctx)
|
|
for next != nil && err == nil {
|
|
if f.accept(next) {
|
|
return next, nil
|
|
}
|
|
next, err = f.child.Next(ctx)
|
|
}
|
|
return nil, err
|
|
}
|
|
|
|
func (f *FilteringSearcher) Advance(ctx *search.SearchContext, ID index.IndexInternalID) (*search.DocumentMatch, error) {
|
|
adv, err := f.child.Advance(ctx, ID)
|
|
if err != nil {
|
|
return nil, err
|
|
}
|
|
if adv == nil {
|
|
return nil, nil
|
|
}
|
|
if f.accept(adv) {
|
|
return adv, nil
|
|
}
|
|
return f.Next(ctx)
|
|
}
|
|
|
|
func (f *FilteringSearcher) Close() error {
|
|
return f.child.Close()
|
|
}
|
|
|
|
func (f *FilteringSearcher) Weight() float64 {
|
|
return f.child.Weight()
|
|
}
|
|
|
|
func (f *FilteringSearcher) SetQueryNorm(n float64) {
|
|
f.child.SetQueryNorm(n)
|
|
}
|
|
|
|
func (f *FilteringSearcher) Count() uint64 {
|
|
return f.child.Count()
|
|
}
|
|
|
|
func (f *FilteringSearcher) Min() int {
|
|
return f.child.Min()
|
|
}
|
|
|
|
func (f *FilteringSearcher) DocumentMatchPoolSize() int {
|
|
return f.child.DocumentMatchPoolSize()
|
|
}
|