-
Notifications
You must be signed in to change notification settings - Fork 10
/
Copy pathnode_test.go
169 lines (160 loc) · 2.85 KB
/
node_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
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
package golsm
import (
"bytes"
"testing"
)
func Test_Node_Get(t *testing.T) {
conf, err := NewConfig("./lsm")
if err != nil {
t.Error(err)
return
}
sstWriter, err := NewSSTWriter("test_node_get.sst", conf)
if err != nil {
t.Error(err)
return
}
defer sstWriter.Close()
kvs := []*KV{
{
Key: []byte("a"),
Value: []byte("b"),
},
{
Key: []byte("b"),
Value: []byte("c"),
},
{
Key: []byte("c"),
Value: []byte("d"),
},
{
Key: []byte("d"),
Value: []byte("e"),
},
}
for _, kv := range kvs {
sstWriter.Append(kv.Key, kv.Value)
}
size, blockToFilter, index := sstWriter.Finish()
sstReader, err := NewSSTReader("test_node_get.sst", conf)
if err != nil {
t.Error(err)
return
}
defer sstReader.Close()
node := NewNode(conf, "test_node_get.sst", sstReader, 0, 0, size, blockToFilter, index)
for _, kv := range kvs {
v, ok, err := node.Get(kv.Key)
if err != nil {
t.Error(err)
continue
}
if !ok {
t.Errorf("get key: %s failed", kv.Key)
continue
}
if !bytes.Equal(v, kv.Value) {
t.Errorf("key: %s, expect v: %s, got: %v", kv.Key, kv.Value, v)
}
}
_, ok, err := node.Get([]byte("e"))
if err != nil {
t.Error(err)
return
}
if ok {
t.Errorf("key: e, expect ok: %t, got: %t", false, true)
}
}
func Test_Node_binarySearchIndex(t *testing.T) {
tests := []struct {
name string
index []*Index
key []byte
expectIndexExist bool
expectIndexKey []byte
}{
{
index: []*Index{
{
Key: []byte("a"),
},
{
Key: []byte("b"),
},
},
key: []byte("c"),
},
{
index: []*Index{
{
Key: []byte("a"),
},
{
Key: []byte("b"),
},
{
Key: []byte("d"),
},
},
key: []byte("c"),
expectIndexExist: true,
expectIndexKey: []byte("d"),
},
{
index: []*Index{
{
Key: []byte("b"),
},
{
Key: []byte("d"),
},
{
Key: []byte("e"),
},
{
Key: []byte("f"),
},
},
key: []byte("a"),
expectIndexExist: true,
expectIndexKey: []byte("b"),
},
{
index: []*Index{
{
Key: []byte("b"),
},
{
Key: []byte("d"),
},
{
Key: []byte("e"),
},
{
Key: []byte("f"),
},
},
key: []byte("g"),
},
}
node := Node{}
for _, test := range tests {
if pass := t.Run(test.name, func(t *testing.T) {
node.index = test.index
index, ok := node.binarySearchIndex(test.key, 0, len(node.index)-1)
if ok != test.expectIndexExist {
t.Errorf("key: %s expect index exist: %t, got: %t", test.key, test.expectIndexExist, ok)
}
if !ok {
return
}
if !bytes.Equal(index.Key, test.expectIndexKey) {
t.Errorf("key: %s expect index key: %s, got: %s", test.key, test.expectIndexKey, index.Key)
}
}); !pass {
t.Errorf("%s not pass", test.name)
}
}
}