132 lines
3.5 KiB
Go
132 lines
3.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 mem
|
|
|
|
import (
|
|
"reflect"
|
|
"sort"
|
|
"strings"
|
|
|
|
"github.com/RoaringBitmap/roaring"
|
|
"github.com/blevesearch/bleve/index"
|
|
"github.com/blevesearch/bleve/index/scorch/segment"
|
|
"github.com/blevesearch/bleve/size"
|
|
)
|
|
|
|
var reflectStaticSizeDictionary int
|
|
|
|
func init() {
|
|
var d Dictionary
|
|
reflectStaticSizeDictionary = int(reflect.TypeOf(d).Size())
|
|
}
|
|
|
|
// Dictionary is the in-memory representation of the term dictionary
|
|
type Dictionary struct {
|
|
segment *Segment
|
|
field string
|
|
fieldID uint16
|
|
}
|
|
|
|
func (d *Dictionary) Size() int {
|
|
sizeInBytes := reflectStaticSizeDictionary + size.SizeOfPtr +
|
|
len(d.field)
|
|
|
|
if d.segment != nil {
|
|
sizeInBytes += int(d.segment.Size())
|
|
}
|
|
|
|
return sizeInBytes
|
|
}
|
|
|
|
// PostingsList returns the postings list for the specified term
|
|
func (d *Dictionary) PostingsList(term string,
|
|
except *roaring.Bitmap) (segment.PostingsList, error) {
|
|
return d.InitPostingsList(term, except, nil)
|
|
}
|
|
|
|
func (d *Dictionary) InitPostingsList(term string, except *roaring.Bitmap,
|
|
prealloc *PostingsList) (*PostingsList, error) {
|
|
rv := prealloc
|
|
if rv == nil {
|
|
rv = &PostingsList{}
|
|
}
|
|
rv.dictionary = d
|
|
rv.term = term
|
|
rv.postingsID = d.segment.Dicts[d.fieldID][term]
|
|
rv.except = except
|
|
return rv, nil
|
|
}
|
|
|
|
// Iterator returns an iterator for this dictionary
|
|
func (d *Dictionary) Iterator() segment.DictionaryIterator {
|
|
return &DictionaryIterator{
|
|
d: d,
|
|
}
|
|
}
|
|
|
|
// PrefixIterator returns an iterator which only visits terms having the
|
|
// the specified prefix
|
|
func (d *Dictionary) PrefixIterator(prefix string) segment.DictionaryIterator {
|
|
offset := sort.SearchStrings(d.segment.DictKeys[d.fieldID], prefix)
|
|
return &DictionaryIterator{
|
|
d: d,
|
|
prefix: prefix,
|
|
offset: offset,
|
|
}
|
|
}
|
|
|
|
// RangeIterator returns an iterator which only visits terms between the
|
|
// start and end terms. NOTE: bleve.index API specifies the end is inclusive.
|
|
func (d *Dictionary) RangeIterator(start, end string) segment.DictionaryIterator {
|
|
offset := sort.SearchStrings(d.segment.DictKeys[d.fieldID], start)
|
|
return &DictionaryIterator{
|
|
d: d,
|
|
offset: offset,
|
|
end: end,
|
|
}
|
|
}
|
|
|
|
// DictionaryIterator is an iterator for term dictionary
|
|
type DictionaryIterator struct {
|
|
d *Dictionary
|
|
prefix string
|
|
end string
|
|
offset int
|
|
|
|
dictEntry index.DictEntry // reused across Next()'s
|
|
}
|
|
|
|
// Next returns the next entry in the dictionary
|
|
func (d *DictionaryIterator) Next() (*index.DictEntry, error) {
|
|
if d.offset > len(d.d.segment.DictKeys[d.d.fieldID])-1 {
|
|
return nil, nil
|
|
}
|
|
next := d.d.segment.DictKeys[d.d.fieldID][d.offset]
|
|
// check prefix
|
|
if d.prefix != "" && !strings.HasPrefix(next, d.prefix) {
|
|
return nil, nil
|
|
}
|
|
// check end (bleve.index API demands inclusive end)
|
|
if d.end != "" && next > d.end {
|
|
return nil, nil
|
|
}
|
|
|
|
d.offset++
|
|
postingID := d.d.segment.Dicts[d.d.fieldID][next]
|
|
d.dictEntry.Term = next
|
|
d.dictEntry.Count = d.d.segment.Postings[postingID-1].GetCardinality()
|
|
return &d.dictEntry, nil
|
|
}
|