Versions in this module Expand all Collapse all v1 v1.1.7 Aug 25, 2024 Changes in this version + var DisjunctionHeapTakeover = 10 + var DisjunctionMaxClauseCount = 0 + var GeoBitsShift1 = geo.GeoBits << 1 + var GeoBitsShift1Minus1 = GeoBitsShift1 - 1 + var MaxFuzziness = 2 + func ComputeGeoRange(term uint64, shift uint, sminLon, sminLat, smaxLon, smaxLat float64, ...) (onBoundary, notOnBoundary [][]byte, err error) + func NewConjunctionSearcher(indexReader search.Reader, qsearchers []search.Searcher, ...) (search.Searcher, error) + func NewDisjunctionSearcher(indexReader search.Reader, qsearchers []search.Searcher, min int, ...) (search.Searcher, error) + func NewFuzzySearcher(indexReader search.Reader, term string, prefix, fuzziness int, field string, ...) (search.Searcher, error) + func NewGeoBoundedPolygonSearcher(indexReader search.Reader, polygon []geo.Point, field string, boost float64, ...) (search.Searcher, error) + func NewGeoBoundingBoxSearcher(indexReader search.Reader, minLon, minLat, maxLon, maxLat float64, ...) (search.Searcher, error) + func NewGeoPointDistanceSearcher(indexReader search.Reader, centerLon, centerLat, dist float64, field string, ...) (search.Searcher, error) + func NewMultiTermSearcher(indexReader search.Reader, terms []string, field string, boost float64, ...) (search.Searcher, error) + func NewMultiTermSearcherBytes(indexReader search.Reader, terms [][]byte, field string, boost float64, ...) (search.Searcher, error) + func NewMultiTermSearcherIndividualBoost(indexReader search.Reader, terms []string, termBoosts []float64, field string, ...) (search.Searcher, error) + func NewNumericRangeSearcher(indexReader search.Reader, min, max float64, inclusiveMin, inclusiveMax bool, ...) (search.Searcher, error) + func NewRegexpStringSearcher(indexReader search.Reader, pattern, field string, boost float64, ...) (search.Searcher, error) + func NewTermPrefixSearcher(indexReader search.Reader, prefix, field string, boost float64, ...) (search.Searcher, error) + func NewTermRangeSearcher(indexReader search.Reader, min, max []byte, inclusiveMin, inclusiveMax bool, ...) (search.Searcher, error) + type BooleanSearcher struct + func NewBooleanSearcher(mustSearcher, shouldSearcher, mustNotSearcher search.Searcher, ...) (*BooleanSearcher, error) + func (s *BooleanSearcher) Advance(ctx *search.Context, number uint64) (*search.DocumentMatch, error) + func (s *BooleanSearcher) Close() error + func (s *BooleanSearcher) Count() uint64 + func (s *BooleanSearcher) DocumentMatchPoolSize() int + func (s *BooleanSearcher) Min() int + func (s *BooleanSearcher) Next(ctx *search.Context) (*search.DocumentMatch, error) + func (s *BooleanSearcher) Size() int + type ConjunctionSearcher struct + func (s *ConjunctionSearcher) Advance(ctx *search.Context, number uint64) (*search.DocumentMatch, error) + func (s *ConjunctionSearcher) Close() (rv error) + func (s *ConjunctionSearcher) Count() uint64 + func (s *ConjunctionSearcher) DocumentMatchPoolSize() int + func (s *ConjunctionSearcher) Min() int + func (s *ConjunctionSearcher) Next(ctx *search.Context) (*search.DocumentMatch, error) + func (s *ConjunctionSearcher) Size() int + type DisjunctionHeapSearcher struct + func (s *DisjunctionHeapSearcher) Advance(ctx *search.Context, number uint64) (*search.DocumentMatch, error) + func (s *DisjunctionHeapSearcher) Close() (rv error) + func (s *DisjunctionHeapSearcher) Count() uint64 + func (s *DisjunctionHeapSearcher) DocumentMatchPoolSize() int + func (s *DisjunctionHeapSearcher) Len() int + func (s *DisjunctionHeapSearcher) Less(i, j int) bool + func (s *DisjunctionHeapSearcher) Min() int + func (s *DisjunctionHeapSearcher) Next(ctx *search.Context) (*search.DocumentMatch, error) + func (s *DisjunctionHeapSearcher) Optimize(kind string, octx segment.OptimizableContext) (segment.OptimizableContext, error) + func (s *DisjunctionHeapSearcher) Pop() interface{} + func (s *DisjunctionHeapSearcher) Push(x interface{}) + func (s *DisjunctionHeapSearcher) Size() int + func (s *DisjunctionHeapSearcher) Swap(i, j int) + type DisjunctionSliceSearcher struct + func (s *DisjunctionSliceSearcher) Advance(ctx *search.Context, number uint64) (*search.DocumentMatch, error) + func (s *DisjunctionSliceSearcher) Close() (rv error) + func (s *DisjunctionSliceSearcher) Count() uint64 + func (s *DisjunctionSliceSearcher) DocumentMatchPoolSize() int + func (s *DisjunctionSliceSearcher) Min() int + func (s *DisjunctionSliceSearcher) Next(ctx *search.Context) (*search.DocumentMatch, error) + func (s *DisjunctionSliceSearcher) Optimize(kind string, octx segment.OptimizableContext) (segment.OptimizableContext, error) + func (s *DisjunctionSliceSearcher) Size() int + type FilterFunc func(d *search.DocumentMatch) bool + type FilteringSearcher struct + func NewFilteringSearcher(s search.Searcher, filter FilterFunc) *FilteringSearcher + func (f *FilteringSearcher) Advance(ctx *search.Context, number uint64) (*search.DocumentMatch, error) + func (f *FilteringSearcher) Close() error + func (f *FilteringSearcher) Count() uint64 + func (f *FilteringSearcher) DocumentMatchPoolSize() int + func (f *FilteringSearcher) Min() int + func (f *FilteringSearcher) Next(ctx *search.Context) (*search.DocumentMatch, error) + func (f *FilteringSearcher) Size() int + type MatchAllSearcher struct + func NewMatchAllSearcher(indexReader search.Reader, boost float64, scorer search.Scorer, ...) (*MatchAllSearcher, error) + func (s *MatchAllSearcher) Advance(ctx *search.Context, number uint64) (*search.DocumentMatch, error) + func (s *MatchAllSearcher) Close() error + func (s *MatchAllSearcher) Count() uint64 + func (s *MatchAllSearcher) DocumentMatchPoolSize() int + func (s *MatchAllSearcher) Min() int + func (s *MatchAllSearcher) Next(ctx *search.Context) (*search.DocumentMatch, error) + func (s *MatchAllSearcher) Size() int + type MatchNoneSearcher struct + func NewMatchNoneSearcher(indexReader search.Reader, options search.SearcherOptions) (*MatchNoneSearcher, error) + func (s *MatchNoneSearcher) Advance(ctx *search.Context, number uint64) (*search.DocumentMatch, error) + func (s *MatchNoneSearcher) Close() error + func (s *MatchNoneSearcher) Count() uint64 + func (s *MatchNoneSearcher) DocumentMatchPoolSize() int + func (s *MatchNoneSearcher) Min() int + func (s *MatchNoneSearcher) Next(ctx *search.Context) (*search.DocumentMatch, error) + func (s *MatchNoneSearcher) SetQueryNorm(_ float64) + func (s *MatchNoneSearcher) Size() int + func (s *MatchNoneSearcher) Weight() float64 + type OrderedSearcherList []search.Searcher + func (otrl OrderedSearcherList) Len() int + func (otrl OrderedSearcherList) Less(i, j int) bool + func (otrl OrderedSearcherList) Swap(i, j int) + type PhraseSearcher struct + func NewMultiPhraseSearcher(indexReader search.Reader, terms [][]string, field string, ...) (*PhraseSearcher, error) + func NewSloppyMultiPhraseSearcher(indexReader search.Reader, terms [][]string, field string, slop int, ...) (*PhraseSearcher, error) + func (s *PhraseSearcher) Advance(ctx *search.Context, number uint64) (*search.DocumentMatch, error) + func (s *PhraseSearcher) Close() error + func (s *PhraseSearcher) Count() uint64 + func (s *PhraseSearcher) DocumentMatchPoolSize() int + func (s *PhraseSearcher) Min() int + func (s *PhraseSearcher) Next(ctx *search.Context) (*search.DocumentMatch, error) + func (s *PhraseSearcher) Size() int + type TermSearcher struct + func NewTermSearcher(indexReader search.Reader, term, field string, boost float64, ...) (*TermSearcher, error) + func NewTermSearcherBytes(indexReader search.Reader, term []byte, field string, boost float64, ...) (*TermSearcher, error) + func (s *TermSearcher) Advance(ctx *search.Context, number uint64) (*search.DocumentMatch, error) + func (s *TermSearcher) Close() error + func (s *TermSearcher) Count() uint64 + func (s *TermSearcher) DocumentMatchPoolSize() int + func (s *TermSearcher) Min() int + func (s *TermSearcher) Next(ctx *search.Context) (*search.DocumentMatch, error) + func (s *TermSearcher) Optimize(kind string, octx segment.OptimizableContext) (segment.OptimizableContext, error) + func (s *TermSearcher) Size() int
Go to main page