fb0f4bbecd
Previously bleve allowed you to create a memory-only index by
simply passing "" as the path argument to the New() method.
This was not clear when reading the code, and led to some
problematic error cases as well.
Now, to create a memory-only index one should use the
NewMemOnly() method. Passing "" as the path argument
to the New() method will now return os.ErrInvalid.
Advanced users calling NewUsing() can create disk-based or
memory-only indexes, but the change here is that pass ""
as the path argument no longer defaults you into getting
a memory-only index. Instead, the KV store is selected
manually, just as it is for the disk-based solutions.
Here is an example use of the NewUsing() method to create
a memory-only index:
NewUsing("", indexMapping, Config.DefaultIndexType,
Config.DefaultMemKVStore, nil)
Config.DefaultMemKVStore is just a new default value
added to the configuration, it currently points to
gtreap.Name (which could have been used directly
instead for more control)
closes #427
92 lines
2.1 KiB
Go
92 lines
2.1 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 gtreap
|
|
|
|
import (
|
|
"testing"
|
|
|
|
"github.com/blevesearch/bleve/index/store"
|
|
"github.com/blevesearch/bleve/index/store/test"
|
|
)
|
|
|
|
func open(t *testing.T, mo store.MergeOperator) store.KVStore {
|
|
rv, err := New(mo, map[string]interface{}{
|
|
"path": "",
|
|
})
|
|
if err != nil {
|
|
t.Fatal(err)
|
|
}
|
|
return rv
|
|
}
|
|
|
|
func cleanup(t *testing.T, s store.KVStore) {
|
|
err := s.Close()
|
|
if err != nil {
|
|
t.Fatal(err)
|
|
}
|
|
}
|
|
|
|
func TestGTreapKVCrud(t *testing.T) {
|
|
s := open(t, nil)
|
|
defer cleanup(t, s)
|
|
test.CommonTestKVCrud(t, s)
|
|
}
|
|
|
|
func TestGTreapReaderIsolation(t *testing.T) {
|
|
s := open(t, nil)
|
|
defer cleanup(t, s)
|
|
test.CommonTestReaderIsolation(t, s)
|
|
}
|
|
|
|
func TestGTreapReaderOwnsGetBytes(t *testing.T) {
|
|
s := open(t, nil)
|
|
defer cleanup(t, s)
|
|
test.CommonTestReaderOwnsGetBytes(t, s)
|
|
}
|
|
|
|
func TestGTreapWriterOwnsBytes(t *testing.T) {
|
|
s := open(t, nil)
|
|
defer cleanup(t, s)
|
|
test.CommonTestWriterOwnsBytes(t, s)
|
|
}
|
|
|
|
func TestGTreapPrefixIterator(t *testing.T) {
|
|
s := open(t, nil)
|
|
defer cleanup(t, s)
|
|
test.CommonTestPrefixIterator(t, s)
|
|
}
|
|
|
|
func TestGTreapPrefixIteratorSeek(t *testing.T) {
|
|
s := open(t, nil)
|
|
defer cleanup(t, s)
|
|
test.CommonTestPrefixIteratorSeek(t, s)
|
|
}
|
|
|
|
func TestGTreapRangeIterator(t *testing.T) {
|
|
s := open(t, nil)
|
|
defer cleanup(t, s)
|
|
test.CommonTestRangeIterator(t, s)
|
|
}
|
|
|
|
func TestGTreapRangeIteratorSeek(t *testing.T) {
|
|
s := open(t, nil)
|
|
defer cleanup(t, s)
|
|
test.CommonTestRangeIteratorSeek(t, s)
|
|
}
|
|
|
|
func TestGTreapMerge(t *testing.T) {
|
|
s := open(t, &test.TestMergeCounter{})
|
|
defer cleanup(t, s)
|
|
test.CommonTestMerge(t, s)
|
|
}
|