188 lines
4.9 KiB
Go
188 lines
4.9 KiB
Go
|
// Copyright (c) 2014, Suryandaru Triandana <syndtr@gmail.com>
|
||
|
// All rights reserved.
|
||
|
//
|
||
|
// Use of this source code is governed by a BSD-style license that can be
|
||
|
// found in the LICENSE file.
|
||
|
|
||
|
package testutil
|
||
|
|
||
|
import (
|
||
|
"fmt"
|
||
|
"math/rand"
|
||
|
|
||
|
. "github.com/onsi/ginkgo"
|
||
|
. "github.com/onsi/gomega"
|
||
|
|
||
|
"github.com/syndtr/goleveldb/leveldb/errors"
|
||
|
"github.com/syndtr/goleveldb/leveldb/util"
|
||
|
)
|
||
|
|
||
|
func KeyValueTesting(rnd *rand.Rand, kv KeyValue, p DB, setup func(KeyValue) DB, teardown func(DB)) {
|
||
|
if rnd == nil {
|
||
|
rnd = NewRand()
|
||
|
}
|
||
|
|
||
|
if p == nil {
|
||
|
BeforeEach(func() {
|
||
|
p = setup(kv)
|
||
|
})
|
||
|
if teardown != nil {
|
||
|
AfterEach(func() {
|
||
|
teardown(p)
|
||
|
})
|
||
|
}
|
||
|
}
|
||
|
|
||
|
It("Should find all keys with Find", func() {
|
||
|
if db, ok := p.(Find); ok {
|
||
|
ShuffledIndex(nil, kv.Len(), 1, func(i int) {
|
||
|
key_, key, value := kv.IndexInexact(i)
|
||
|
|
||
|
// Using exact key.
|
||
|
rkey, rvalue, err := db.TestFind(key)
|
||
|
Expect(err).ShouldNot(HaveOccurred(), "Error for key %q", key)
|
||
|
Expect(rkey).Should(Equal(key), "Key")
|
||
|
Expect(rvalue).Should(Equal(value), "Value for key %q", key)
|
||
|
|
||
|
// Using inexact key.
|
||
|
rkey, rvalue, err = db.TestFind(key_)
|
||
|
Expect(err).ShouldNot(HaveOccurred(), "Error for key %q (%q)", key_, key)
|
||
|
Expect(rkey).Should(Equal(key))
|
||
|
Expect(rvalue).Should(Equal(value), "Value for key %q (%q)", key_, key)
|
||
|
})
|
||
|
}
|
||
|
})
|
||
|
|
||
|
It("Should return error if the key is not present", func() {
|
||
|
if db, ok := p.(Find); ok {
|
||
|
var key []byte
|
||
|
if kv.Len() > 0 {
|
||
|
key_, _ := kv.Index(kv.Len() - 1)
|
||
|
key = BytesAfter(key_)
|
||
|
}
|
||
|
rkey, _, err := db.TestFind(key)
|
||
|
Expect(err).Should(HaveOccurred(), "Find for key %q yield key %q", key, rkey)
|
||
|
Expect(err).Should(Equal(errors.ErrNotFound))
|
||
|
}
|
||
|
})
|
||
|
|
||
|
It("Should only find exact key with Get", func() {
|
||
|
if db, ok := p.(Get); ok {
|
||
|
ShuffledIndex(nil, kv.Len(), 1, func(i int) {
|
||
|
key_, key, value := kv.IndexInexact(i)
|
||
|
|
||
|
// Using exact key.
|
||
|
rvalue, err := db.TestGet(key)
|
||
|
Expect(err).ShouldNot(HaveOccurred(), "Error for key %q", key)
|
||
|
Expect(rvalue).Should(Equal(value), "Value for key %q", key)
|
||
|
|
||
|
// Using inexact key.
|
||
|
if len(key_) > 0 {
|
||
|
_, err = db.TestGet(key_)
|
||
|
Expect(err).Should(HaveOccurred(), "Error for key %q", key_)
|
||
|
Expect(err).Should(Equal(errors.ErrNotFound))
|
||
|
}
|
||
|
})
|
||
|
}
|
||
|
})
|
||
|
|
||
|
It("Should only find present key with Has", func() {
|
||
|
if db, ok := p.(Has); ok {
|
||
|
ShuffledIndex(nil, kv.Len(), 1, func(i int) {
|
||
|
key_, key, _ := kv.IndexInexact(i)
|
||
|
|
||
|
// Using exact key.
|
||
|
ret, err := db.TestHas(key)
|
||
|
Expect(err).ShouldNot(HaveOccurred(), "Error for key %q", key)
|
||
|
Expect(ret).Should(BeTrue(), "False for key %q", key)
|
||
|
|
||
|
// Using inexact key.
|
||
|
if len(key_) > 0 {
|
||
|
ret, err = db.TestHas(key_)
|
||
|
Expect(err).ShouldNot(HaveOccurred(), "Error for key %q", key_)
|
||
|
Expect(ret).ShouldNot(BeTrue(), "True for key %q", key)
|
||
|
}
|
||
|
})
|
||
|
}
|
||
|
})
|
||
|
|
||
|
TestIter := func(r *util.Range, _kv KeyValue) {
|
||
|
if db, ok := p.(NewIterator); ok {
|
||
|
iter := db.TestNewIterator(r)
|
||
|
Expect(iter.Error()).ShouldNot(HaveOccurred())
|
||
|
|
||
|
t := IteratorTesting{
|
||
|
KeyValue: _kv,
|
||
|
Iter: iter,
|
||
|
}
|
||
|
|
||
|
DoIteratorTesting(&t)
|
||
|
iter.Release()
|
||
|
}
|
||
|
}
|
||
|
|
||
|
It("Should iterates and seeks correctly", func(done Done) {
|
||
|
TestIter(nil, kv.Clone())
|
||
|
done <- true
|
||
|
}, 3.0)
|
||
|
|
||
|
RandomIndex(rnd, kv.Len(), Min(kv.Len(), 50), func(i int) {
|
||
|
type slice struct {
|
||
|
r *util.Range
|
||
|
start, limit int
|
||
|
}
|
||
|
|
||
|
key_, _, _ := kv.IndexInexact(i)
|
||
|
for _, x := range []slice{
|
||
|
{&util.Range{Start: key_, Limit: nil}, i, kv.Len()},
|
||
|
{&util.Range{Start: nil, Limit: key_}, 0, i},
|
||
|
} {
|
||
|
It(fmt.Sprintf("Should iterates and seeks correctly of a slice %d .. %d", x.start, x.limit), func(done Done) {
|
||
|
TestIter(x.r, kv.Slice(x.start, x.limit))
|
||
|
done <- true
|
||
|
}, 3.0)
|
||
|
}
|
||
|
})
|
||
|
|
||
|
RandomRange(rnd, kv.Len(), Min(kv.Len(), 50), func(start, limit int) {
|
||
|
It(fmt.Sprintf("Should iterates and seeks correctly of a slice %d .. %d", start, limit), func(done Done) {
|
||
|
r := kv.Range(start, limit)
|
||
|
TestIter(&r, kv.Slice(start, limit))
|
||
|
done <- true
|
||
|
}, 3.0)
|
||
|
})
|
||
|
}
|
||
|
|
||
|
func AllKeyValueTesting(rnd *rand.Rand, body, setup func(KeyValue) DB, teardown func(DB)) {
|
||
|
Test := func(kv *KeyValue) func() {
|
||
|
return func() {
|
||
|
var p DB
|
||
|
if setup != nil {
|
||
|
Defer("setup", func() {
|
||
|
p = setup(*kv)
|
||
|
})
|
||
|
}
|
||
|
if teardown != nil {
|
||
|
Defer("teardown", func() {
|
||
|
teardown(p)
|
||
|
})
|
||
|
}
|
||
|
if body != nil {
|
||
|
p = body(*kv)
|
||
|
}
|
||
|
KeyValueTesting(rnd, *kv, p, func(KeyValue) DB {
|
||
|
return p
|
||
|
}, nil)
|
||
|
}
|
||
|
}
|
||
|
|
||
|
Describe("with no key/value (empty)", Test(&KeyValue{}))
|
||
|
Describe("with empty key", Test(KeyValue_EmptyKey()))
|
||
|
Describe("with empty value", Test(KeyValue_EmptyValue()))
|
||
|
Describe("with one key/value", Test(KeyValue_OneKeyValue()))
|
||
|
Describe("with big value", Test(KeyValue_BigValue()))
|
||
|
Describe("with special key", Test(KeyValue_SpecialKey()))
|
||
|
Describe("with multiple key/value", Test(KeyValue_MultipleKeyValue()))
|
||
|
Describe("with generated key/value", Test(KeyValue_Generate(nil, 120, 1, 50, 10, 120)))
|
||
|
}
|