forked from nutsdb/nutsdb
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathmerge_test.go
367 lines (297 loc) · 9.84 KB
/
merge_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
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
// Copyright 2023 The nutsdb Author. All rights reserved.
//
// 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 nutsdb
import (
"bytes"
"testing"
"github.com/stretchr/testify/require"
"github.com/xujiajun/utils/strconv2"
)
func TestDB_MergeForString(t *testing.T) {
bucket := "bucket"
opts := DefaultOptions
opts.SegmentSize = KB
opts.Dir = "/tmp/test-string-merge/"
for _, idxMode := range []EntryIdxMode{HintKeyValAndRAMIdxMode, HintKeyAndRAMIdxMode} {
opts.EntryIdxMode = idxMode
db, err := Open(opts)
txCreateBucket(t, db, DataStructureBTree, bucket, nil)
require.NoError(t, err)
// Merge is not needed
err = db.Merge()
require.Equal(t, ErrDontNeedMerge, err)
// Add some data
n := 1000
for i := 0; i < n; i++ {
txPut(t, db, bucket, GetTestBytes(i), GetTestBytes(i), Persistent, nil, nil)
}
// Delete some data
for i := 0; i < n/2; i++ {
txDel(t, db, bucket, GetTestBytes(i), nil)
}
// Merge and check the result
require.NoError(t, db.Merge())
dbCnt, err := db.getRecordCount()
require.NoError(t, err)
require.Equal(t, int64(n/2), dbCnt)
// Check the deleted data is deleted
for i := 0; i < n/2; i++ {
txGet(t, db, bucket, GetTestBytes(i), GetTestBytes(i), ErrKeyNotFound)
}
// Check the added data is added
for i := n / 2; i < n; i++ {
txGet(t, db, bucket, GetTestBytes(i), GetTestBytes(i), nil)
}
// Close and reopen the db
require.NoError(t, db.Close())
db, err = Open(opts)
require.NoError(t, err)
dbCnt, err = db.getRecordCount()
require.NoError(t, err)
require.Equal(t, int64(n/2), dbCnt)
// Check the deleted data is deleted
for i := 0; i < n/2; i++ {
txGet(t, db, bucket, GetTestBytes(i), GetTestBytes(i), ErrKeyNotFound)
}
// Check the added data is added
for i := n / 2; i < n; i++ {
txGet(t, db, bucket, GetTestBytes(i), GetTestBytes(i), nil)
}
require.NoError(t, db.Close())
removeDir(opts.Dir)
}
}
func TestDB_MergeForSet(t *testing.T) {
bucket := "bucket"
opts := DefaultOptions
opts.SegmentSize = KB
opts.Dir = "/tmp/test-set-merge/"
for _, idxMode := range []EntryIdxMode{HintKeyValAndRAMIdxMode, HintKeyAndRAMIdxMode} {
opts.EntryIdxMode = idxMode
db, err := Open(opts)
if exist := db.bm.ExistBucket(DataStructureSet, bucket); !exist {
txCreateBucket(t, db, DataStructureSet, bucket, nil)
}
require.NoError(t, err)
// Merge is not needed
err = db.Merge()
require.Equal(t, ErrDontNeedMerge, err)
// Add some data
n := 1000
key := GetTestBytes(0)
for i := 0; i < n; i++ {
txSAdd(t, db, bucket, key, GetTestBytes(i), nil, nil)
}
// Delete some data
for i := 0; i < n/2; i++ {
txSRem(t, db, bucket, key, GetTestBytes(i), nil)
}
// Pop a random value
var spopValue []byte
err = db.Update(func(tx *Tx) error {
var err error
spopValue, err = tx.SPop(bucket, key)
assertErr(t, err, nil)
return nil
})
require.NoError(t, err)
// Check the random value is popped
txSIsMember(t, db, bucket, key, spopValue, false)
// txSPop(t, db, bucket, key,nil)
dbCnt, err := db.getRecordCount()
require.NoError(t, err)
require.Equal(t, int64(n/2-1), dbCnt)
// Merge and check the result
require.NoError(t, db.Merge())
dbCnt, err = db.getRecordCount()
require.NoError(t, err)
require.Equal(t, int64(n/2-1), dbCnt)
// Check the random value is popped
txSIsMember(t, db, bucket, key, spopValue, false)
for i := n / 2; i < n; i++ {
v := GetTestBytes(i)
if bytes.Equal(v, spopValue) {
continue
}
txSIsMember(t, db, bucket, key, v, true)
}
// Close and reopen the db
require.NoError(t, db.Close())
// reopen db
db, err = Open(opts)
require.NoError(t, err)
dbCnt, err = db.getRecordCount()
require.NoError(t, err)
require.Equal(t, int64(n/2-1), dbCnt)
// Check the random value is popped
txSIsMember(t, db, bucket, key, spopValue, false)
for i := n / 2; i < n; i++ {
v := GetTestBytes(i)
if bytes.Equal(v, spopValue) {
continue
}
txSIsMember(t, db, bucket, key, v, true)
}
require.NoError(t, db.Close())
removeDir(opts.Dir)
}
}
// TestDB_MergeForZSet is a test function to check the Merge() function of the DB struct
// It creates a DB with two different EntryIdxMode, then adds and scores each item in the DB
// It then removes half of the items from the DB, then checks that the items that are left are the same as the ones that were removed
// It then closes the DB, reopens it, and checks that the items that were removed are now not present
func TestDB_MergeForZSet(t *testing.T) {
bucket := "bucket"
key := GetTestBytes(0)
n := 1000
opts := DefaultOptions
opts.SegmentSize = KB
opts.Dir = "/tmp/test-zset-merge/"
// test different EntryIdxMode
for _, idxMode := range []EntryIdxMode{HintKeyValAndRAMIdxMode, HintKeyAndRAMIdxMode} {
opts.EntryIdxMode = idxMode
db, err := Open(opts)
if exist := db.bm.ExistBucket(DataStructureSortedSet, bucket); !exist {
txCreateBucket(t, db, DataStructureSortedSet, bucket, nil)
}
require.NoError(t, err)
// add items
err = db.Merge()
require.Equal(t, ErrDontNeedMerge, err)
for i := 0; i < n; i++ {
score, _ := strconv2.IntToFloat64(i)
txZAdd(t, db, bucket, key, GetTestBytes(i), score, nil, nil)
}
for i := 0; i < n; i++ {
score, _ := strconv2.IntToFloat64(i)
txZScore(t, db, bucket, key, GetTestBytes(i), score, nil)
}
// remove half of the items
for i := 0; i < n/2; i++ {
txZRem(t, db, bucket, key, GetTestBytes(i), nil)
}
// check that the items that are left are the same as the ones that were removed
for i := 0; i < n/2; i++ {
score, _ := strconv2.IntToFloat64(i)
txZScore(t, db, bucket, key, GetTestBytes(i), score, ErrSortedSetMemberNotExist)
}
// check that the items that are left are the same as the ones that were removed
for i := n / 2; i < n; i++ {
score, _ := strconv2.IntToFloat64(i)
txZScore(t, db, bucket, key, GetTestBytes(i), score, nil)
}
// check that the number of items in the DB is correct
dbCnt, err := db.getRecordCount()
require.NoError(t, err)
require.Equal(t, int64(n/2), dbCnt)
// merge
require.NoError(t, db.Merge())
// check that the number of items in the DB is correct
dbCnt, err = db.getRecordCount()
require.NoError(t, err)
require.Equal(t, int64(n/2), dbCnt)
// check that the items that were removed are now not present
for i := 0; i < n/2; i++ {
score, _ := strconv2.IntToFloat64(i)
txZScore(t, db, bucket, key, GetTestBytes(i), score, ErrSortedSetMemberNotExist)
}
// check that the items that are left are the same as the ones that were removed
for i := n / 2; i < n; i++ {
score, _ := strconv2.IntToFloat64(i)
txZScore(t, db, bucket, key, GetTestBytes(i), score, nil)
}
// close db
require.NoError(t, db.Close())
// reopen db
db, err = Open(opts)
require.NoError(t, err)
dbCnt, err = db.getRecordCount()
require.NoError(t, err)
require.Equal(t, int64(n/2), dbCnt)
// check that the items that were removed are now not present
for i := 0; i < n/2; i++ {
score, _ := strconv2.IntToFloat64(i)
txZScore(t, db, bucket, key, GetTestBytes(i), score, ErrSortedSetMemberNotExist)
}
// check that the items that are left are the same as the ones that were removed
for i := n / 2; i < n; i++ {
score, _ := strconv2.IntToFloat64(i)
txZScore(t, db, bucket, key, GetTestBytes(i), score, nil)
}
require.NoError(t, db.Close())
removeDir(opts.Dir)
}
}
// TestDB_MergeForList tests the Merge() function of the DB struct.
// It creates a DB with two different EntryIdxMode, pushes and pops data, and then merges the DB.
// It then reopens the DB and checks that the data is still there.
func TestDB_MergeForList(t *testing.T) {
bucket := "bucket"
key := GetTestBytes(0)
opts := DefaultOptions
opts.SegmentSize = KB
opts.Dir = "/tmp/test-list-merge/"
// test different EntryIdxMode
for _, idxMode := range []EntryIdxMode{HintKeyValAndRAMIdxMode, HintKeyAndRAMIdxMode} {
opts.EntryIdxMode = idxMode
db, err := Open(opts)
if exist := db.bm.ExistBucket(DataStructureList, bucket); !exist {
txCreateBucket(t, db, DataStructureList, bucket, nil)
}
require.NoError(t, err)
// check that we don't need merge
err = db.Merge()
require.Equal(t, ErrDontNeedMerge, err)
// push data
n := 1000
for i := 0; i < n; i++ {
txPush(t, db, bucket, key, GetTestBytes(i), true, nil, nil)
}
for i := n; i < 2*n; i++ {
txPush(t, db, bucket, key, GetTestBytes(i), false, nil, nil)
}
// pop data
for i := n - 1; i >= n/2; i-- {
txPop(t, db, bucket, key, GetTestBytes(i), nil, true)
}
for i := 2*n - 1; i >= 3*n/2; i-- {
txPop(t, db, bucket, key, GetTestBytes(i), nil, false)
}
// trim and remove data
txLTrim(t, db, bucket, key, 0, 9, nil)
txLRem(t, db, bucket, key, 0, GetTestBytes(100), nil)
txLRemByIndex(t, db, bucket, key, nil, []int{7, 8, 9}...)
dbCnt, err := db.getRecordCount()
require.NoError(t, err)
require.Equal(t, int64(7), dbCnt)
// merge
require.NoError(t, db.Merge())
dbCnt, err = db.getRecordCount()
require.NoError(t, err)
require.Equal(t, int64(7), dbCnt)
require.NoError(t, db.Close())
// reopen db
db, err = Open(opts)
require.NoError(t, err)
dbCnt, err = db.getRecordCount()
require.NoError(t, err)
require.Equal(t, int64(7), dbCnt)
// pop data
for i := n/2 - 1; i < n/2-8; i-- {
txPop(t, db, bucket, key, GetTestBytes(i), nil, true)
}
require.NoError(t, db.Close())
removeDir(opts.Dir)
}
}