5094d2d097
Previously, the PrefixIterator() for moss was implemented by comparing the prefix bytes on every Next(). With this optimization, the next larger endKeyExclusive is computed at the iterator's initialization, which allows us to avoid all those prefix comparisons.
87 lines
1.8 KiB
Go
87 lines
1.8 KiB
Go
// Copyright (c) 2016 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 moss
|
|
|
|
import (
|
|
"math/big"
|
|
|
|
"github.com/couchbase/moss"
|
|
|
|
"github.com/blevesearch/bleve/index/store"
|
|
)
|
|
|
|
type Reader struct {
|
|
store *Store
|
|
ss moss.Snapshot
|
|
}
|
|
|
|
func (r *Reader) Get(k []byte) (v []byte, err error) {
|
|
v, err = r.ss.Get(k, moss.ReadOptions{})
|
|
if err != nil {
|
|
return nil, err
|
|
}
|
|
if v != nil {
|
|
return append(make([]byte, 0, len(v)), v...), nil
|
|
}
|
|
return nil, nil
|
|
}
|
|
|
|
func (r *Reader) MultiGet(keys [][]byte) ([][]byte, error) {
|
|
return store.MultiGet(r, keys)
|
|
}
|
|
|
|
var bigOne = big.NewInt(1)
|
|
|
|
func (r *Reader) PrefixIterator(k []byte) store.KVIterator {
|
|
kEnd := big.NewInt(0).Add(big.NewInt(0).SetBytes(k), bigOne).Bytes()
|
|
|
|
iter, err := r.ss.StartIterator(k, kEnd, moss.IteratorOptions{})
|
|
if err != nil {
|
|
return nil
|
|
}
|
|
|
|
rv := &Iterator{
|
|
store: r.store,
|
|
ss: r.ss,
|
|
iter: iter,
|
|
start: k,
|
|
end: kEnd,
|
|
}
|
|
|
|
rv.checkDone()
|
|
|
|
return rv
|
|
}
|
|
|
|
func (r *Reader) RangeIterator(start, end []byte) store.KVIterator {
|
|
iter, err := r.ss.StartIterator(start, end, moss.IteratorOptions{})
|
|
if err != nil {
|
|
return nil
|
|
}
|
|
|
|
rv := &Iterator{
|
|
store: r.store,
|
|
ss: r.ss,
|
|
iter: iter,
|
|
start: start,
|
|
end: end,
|
|
}
|
|
|
|
rv.checkDone()
|
|
|
|
return rv
|
|
}
|
|
|
|
func (r *Reader) Close() error {
|
|
return r.ss.Close()
|
|
}
|