-
Notifications
You must be signed in to change notification settings - Fork 2
/
Copy pathappendkv_test.go
83 lines (70 loc) · 1.88 KB
/
appendkv_test.go
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
// Copyright (c) 2013 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 btree
import (
"bytes"
"math/rand"
"testing"
)
var datafile = "./data/appendkv_datafile.dat"
func Test_KV(t *testing.T) {
store := testStore(true)
defer func() {
store.Destroy()
}()
fpos := store.appendKey([]byte("Hello world"))
if bytes.Equal(store.fetchKey(fpos), []byte("Hello world")) == false {
t.Fail()
}
}
var fposs = make([]int64, 0)
var maxEntries = 100000
func Benchmark_appendKV(b *testing.B) {
store := testStore(true)
defer func() {
store.Destroy()
}()
data := "abcdefghijklmnopqrstuvwxyz " + "abcdefghijklmnopqrstuvwxyz "
data += data
data += data
b.ResetTimer()
for i := 0; i < b.N; i++ {
store.appendValue([]byte(data))
}
}
func Benchmark_appendFetchSetup(b *testing.B) {
store := testStore(true)
defer func() {
store.Close()
}()
data := "abcdefghijklmnopqrstuvwxyz " + "abcdefghijklmnopqrstuvwxyz "
data += data
data += data
for i := 0; i < maxEntries; i++ {
fposs = append(fposs, store.appendKey([]byte(data)))
}
b.SkipNow()
}
func Benchmark_appendFetchKV(b *testing.B) {
store := testStore(true)
defer func() {
store.Close()
}()
b.ResetTimer()
for i := 0; i < b.N; i++ {
store.fetchKey(fposs[rand.Intn(maxEntries)])
}
}
func Benchmark_appendFetchFinish(b *testing.B) {
store := testStore(true)
defer func() {
store.Destroy()
}()
b.SkipNow()
}