wedb_embed 0.1.0

Embedded Kvrocks-compatible storage engine for WeDb
Documentation
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
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
use aok::Void;
use tempfile::tempdir;
use wedb_embed::WeDb;
use wedb_embed::key_composer::KeyComposer;
use wedb_embed::list::{ListMeta, PosSpec};

#[ctor::ctor(unsafe)]
fn _log_init() {
    log_init::init();
}

#[test]
fn test_list_metadata_and_indexing() -> Void {
    let meta = ListMeta::new(1700000000000, 100);
    assert_eq!(meta.head, ListMeta::INITIAL_INDEX);
    assert_eq!(meta.tail, ListMeta::INITIAL_INDEX);
    assert_eq!(meta.size(), 0);

    // 标准 42 字节编解码
    let enc = meta.encode();
    assert_eq!(enc.len(), ListMeta::ENCODED_SIZE);
    let dec = ListMeta::decode(&enc).expect("decode failed");
    assert_eq!(dec.head, ListMeta::INITIAL_INDEX);
    assert_eq!(dec.tail, ListMeta::INITIAL_INDEX);

    // Kvrocks 紧凑 41 字节编解码
    let kv_enc = meta.encode_kvrocks();
    assert_eq!(kv_enc.len(), ListMeta::KVROCKS_ENCODED_SIZE);
    let kv_dec = ListMeta::decode(&kv_enc).expect("decode kvrocks failed");
    assert_eq!(kv_dec.head, ListMeta::INITIAL_INDEX);
    assert_eq!(kv_dec.tail, ListMeta::INITIAL_INDEX);

    Ok(())
}

#[test]
fn test_list_push_and_pop() -> Void {
    let dir = tempdir()?;
    let db = WeDb::open(dir.path())?;

    assert_eq!(db.rpush("lkey", &["a", "b", "c"])?, 3);
    assert_eq!(db.lpush("lkey", &["z"])?, 4);
    assert_eq!(db.llen("lkey")?, 4);

    // LPUSHX / RPUSHX
    assert_eq!(db.lpushx("lkey", &["first"])?, 5);
    assert_eq!(db.rpushx("lkey", &["last"])?, 6);
    assert_eq!(db.lpushx("nonexistent", &["val"])?, 0);
    assert_eq!(db.rpushx("nonexistent", &["val"])?, 0);

    let range = db.lrange("lkey", 0, -1)?;
    assert_eq!(
        range,
        vec![
            b"first".to_vec(),
            b"z".to_vec(),
            b"a".to_vec(),
            b"b".to_vec(),
            b"c".to_vec(),
            b"last".to_vec(),
        ]
    );

    assert_eq!(db.lpop("lkey", 1)?, vec![b"first".to_vec()]);
    assert_eq!(db.rpop("lkey", 1)?, vec![b"last".to_vec()]);
    assert_eq!(db.llen("lkey")?, 4);

    assert_eq!(
        db.lpop("lkey", 5)?,
        vec![b"z".to_vec(), b"a".to_vec(), b"b".to_vec(), b"c".to_vec()]
    );
    assert_eq!(db.llen("lkey")?, 0);
    assert_eq!(db.lpop("lkey", 1)?, Vec::<Vec<u8>>::new());

    Ok(())
}

#[test]
fn test_list_index_and_set() -> Void {
    let dir = tempdir()?;
    let db = WeDb::open(dir.path())?;

    db.rpush("list_idx", &["v0", "v1", "v2", "v3"])?;

    assert_eq!(db.lindex("list_idx", 0)?, Some(b"v0".to_vec()));
    assert_eq!(db.lindex("list_idx", 2)?, Some(b"v2".to_vec()));
    assert_eq!(db.lindex("list_idx", -1)?, Some(b"v3".to_vec()));
    assert_eq!(db.lindex("list_idx", -4)?, Some(b"v0".to_vec()));
    assert_eq!(db.lindex("list_idx", -5)?, None);
    assert_eq!(db.lindex("list_idx", 100)?, None);

    db.lset("list_idx", 1, "v1_updated")?;
    assert_eq!(db.lindex("list_idx", 1)?, Some(b"v1_updated".to_vec()));

    db.lset("list_idx", -1, "v3_updated")?;
    assert_eq!(db.lindex("list_idx", 3)?, Some(b"v3_updated".to_vec()));

    assert!(db.lset("list_idx", 100, "out_of_range").is_err());
    assert!(db.lset("list_idx", -10, "out_of_range").is_err());
    assert!(db.lset("nonexistent_list", 0, "val").is_err());

    Ok(())
}

#[test]
fn test_list_lrange_edge_cases() -> Void {
    let dir = tempdir()?;
    let db = WeDb::open(dir.path())?;

    db.rpush("lrkey", &["a", "b", "c", "d"])?; // len = 4

    // 各种边界与越界组合
    assert_eq!(
        db.lrange("lrkey", 0, 3)?,
        vec![b"a".to_vec(), b"b".to_vec(), b"c".to_vec(), b"d".to_vec()]
    );
    assert_eq!(
        db.lrange("lrkey", 0, 100)?,
        vec![b"a".to_vec(), b"b".to_vec(), b"c".to_vec(), b"d".to_vec()]
    );
    assert_eq!(
        db.lrange("lrkey", -100, 100)?,
        vec![b"a".to_vec(), b"b".to_vec(), b"c".to_vec(), b"d".to_vec()]
    );
    assert_eq!(
        db.lrange("lrkey", -100, 1)?,
        vec![b"a".to_vec(), b"b".to_vec()]
    );
    assert_eq!(
        db.lrange("lrkey", -2, -1)?,
        vec![b"c".to_vec(), b"d".to_vec()]
    );

    // 空集边界情况
    assert_eq!(db.lrange("lrkey", 0, -10)?, Vec::<Vec<u8>>::new());
    assert_eq!(db.lrange("lrkey", -10, -5)?, Vec::<Vec<u8>>::new());
    assert_eq!(db.lrange("lrkey", 5, 10)?, Vec::<Vec<u8>>::new());
    assert_eq!(db.lrange("lrkey", 3, 1)?, Vec::<Vec<u8>>::new());
    assert_eq!(db.lrange("lrkey", -1, -2)?, Vec::<Vec<u8>>::new());
    assert_eq!(
        db.lrange("nonexistent_lrkey", 0, -1)?,
        Vec::<Vec<u8>>::new()
    );

    Ok(())
}

#[test]
fn test_list_insert_and_rem_and_pos() -> Void {
    let dir = tempdir()?;
    let db = WeDb::open(dir.path())?;

    db.rpush("lops", &["hello", "foo", "bar", "foo", "world"])?;

    // LINSERT BEFORE / AFTER
    assert_eq!(db.linsert("lops", true, "bar", "before_bar")?, 6);
    assert_eq!(db.linsert("lops", false, "bar", "after_bar")?, 7);
    assert_eq!(db.linsert("lops", true, "nonexistent", "val")?, -1);
    assert_eq!(db.linsert("nonexistent_key", true, "bar", "val")?, 0);

    // LPOS
    let pos_first = db.lpos("lops", "foo", PosSpec::default())?;
    assert_eq!(pos_first, vec![1]);

    let pos_rev = db.lpos("lops", "foo", PosSpec::new().with_rank(-1))?;
    assert_eq!(pos_rev, vec![5]);

    let pos_all = db.lpos("lops", "foo", PosSpec::new().with_rank(1).with_count(10))?;
    assert_eq!(pos_all, vec![1, 5]);

    let pos_limit = db.lpos(
        "lops",
        "foo",
        PosSpec::new().with_rank(1).with_count(10).with_max_len(3),
    )?;
    assert_eq!(pos_limit, vec![1]);

    assert!(db.lpos("lops", "foo", PosSpec::new().with_rank(0)).is_err());

    // LREM
    assert_eq!(db.lrem("lops", 1, "foo")?, 1);
    assert_eq!(db.lrem("lops", -1, "foo")?, 1);
    assert_eq!(db.lrem("lops", 0, "bar")?, 1);
    assert_eq!(db.llen("lops")?, 4);

    // LREM 删除全部
    db.rpush("del_all", &["x", "x", "x"])?;
    assert_eq!(db.lrem("del_all", 0, "x")?, 3);
    assert_eq!(db.llen("del_all")?, 0);

    Ok(())
}

#[test]
fn test_list_lmove_and_ltrim() -> Void {
    let dir = tempdir()?;
    let db = WeDb::open(dir.path())?;

    db.rpush("src_list", &["1", "2", "3"])?;

    // 单列表轮转 (RPOPLPUSH)
    let rot = db.lmove("src_list", "src_list", false, true)?;
    assert_eq!(rot, Some(b"3".to_vec()));
    let range = db.lrange("src_list", 0, -1)?;
    assert_eq!(range, vec![b"3".to_vec(), b"1".to_vec(), b"2".to_vec()]);

    // RPOPLPUSH 别名指令
    let rpl = db.rpoplpush("src_list", "src_list")?;
    assert_eq!(rpl, Some(b"2".to_vec()));
    assert_eq!(
        db.lrange("src_list", 0, -1)?,
        vec![b"2".to_vec(), b"3".to_vec(), b"1".to_vec()]
    );

    // 双列表迁移
    let moved = db.lmove("src_list", "dst_list", true, false)?;
    assert_eq!(moved, Some(b"2".to_vec()));
    assert_eq!(db.llen("src_list")?, 2);
    assert_eq!(db.llen("dst_list")?, 1);

    // LTRIM
    db.ltrim("src_list", 0, 0)?;
    assert_eq!(db.llen("src_list")?, 1);
    assert_eq!(db.lindex("src_list", 0)?, Some(b"3".to_vec()));

    // LTRIM 清空
    db.ltrim("src_list", 5, 2)?;
    assert_eq!(db.llen("src_list")?, 0);

    Ok(())
}

#[test]
fn test_list_expiration_behavior() -> Void {
    let dir = tempdir()?;
    let db = WeDb::open(dir.path())?;

    db.rpush("exp_list", &["e1", "e2", "e3"])?;
    assert_eq!(db.llen("exp_list")?, 3);

    // 手动写入已过期的元数据
    let kc = KeyComposer::new("default");
    let meta_k = kc.list_meta("exp_list");
    let mut exp_meta = ListMeta::new(1000, 1); // 过去的过期时间
    exp_meta.base.size = 3;
    db.meta_ks.insert(meta_k.as_bytes(), exp_meta.encode())?;

    // 所有只读指令应视作不存在
    assert_eq!(db.llen("exp_list")?, 0);
    assert_eq!(db.lrange("exp_list", 0, -1)?, Vec::<Vec<u8>>::new());
    assert_eq!(db.lindex("exp_list", 0)?, None);
    assert_eq!(db.lpop("exp_list", 1)?, Vec::<Vec<u8>>::new());
    assert_eq!(db.rpop("exp_list", 1)?, Vec::<Vec<u8>>::new());
    assert_eq!(
        db.lpos("exp_list", "e1", PosSpec::default())?,
        Vec::<i64>::new()
    );
    assert_eq!(db.linsert("exp_list", true, "e1", "x")?, 0);
    assert_eq!(db.lrem("exp_list", 0, "e1")?, 0);
    assert_eq!(db.lpushx("exp_list", &["x"])?, 0);
    assert_eq!(db.rpushx("exp_list", &["x"])?, 0);
    assert!(db.lset("exp_list", 0, "x").is_err());
    assert_eq!(db.lmove("exp_list", "other", true, false)?, None);

    // 重新 LPUSH 应清理旧键并创建新列表
    assert_eq!(db.lpush("exp_list", &["fresh"])?, 1);
    assert_eq!(db.lrange("exp_list", 0, -1)?, vec![b"fresh".to_vec()]);

    Ok(())
}

#[test]
fn test_list_linsert_extremities() -> Void {
    let dir = tempdir()?;
    let db = WeDb::open(dir.path())?;

    db.rpush("ins_list", &["head", "mid", "tail"])?;

    // 在 head 之前插入
    assert_eq!(db.linsert("ins_list", true, "head", "new_head")?, 4);
    assert_eq!(db.lindex("ins_list", 0)?, Some(b"new_head".to_vec()));

    // 在 tail 之后插入
    assert_eq!(db.linsert("ins_list", false, "tail", "new_tail")?, 5);
    assert_eq!(db.lindex("ins_list", -1)?, Some(b"new_tail".to_vec()));

    assert_eq!(
        db.lrange("ins_list", 0, -1)?,
        vec![
            b"new_head".to_vec(),
            b"head".to_vec(),
            b"mid".to_vec(),
            b"tail".to_vec(),
            b"new_tail".to_vec(),
        ]
    );

    Ok(())
}

#[test]
fn test_list_lmove_expired_dst() -> Void {
    let dir = tempdir()?;
    let db = WeDb::open(dir.path())?;

    db.rpush("src", &["item1", "item2"])?;
    db.rpush("dst_exp", &["stale1", "stale2"])?;

    // 设置 dst_exp 过期
    let kc = KeyComposer::new("default");
    let meta_k = kc.list_meta("dst_exp");
    let mut exp_meta = ListMeta::new(1000, 1);
    exp_meta.base.size = 2;
    db.meta_ks.insert(meta_k.as_bytes(), exp_meta.encode())?;

    // LMOVE 到已过期的 dst
    let res = db.lmove("src", "dst_exp", true, false)?;
    assert_eq!(res, Some(b"item1".to_vec()));
    assert_eq!(db.llen("src")?, 1);
    assert_eq!(db.llen("dst_exp")?, 1);
    assert_eq!(db.lrange("dst_exp", 0, -1)?, vec![b"item1".to_vec()]);

    Ok(())
}

#[test]
fn test_list_ttl_and_persist() -> Void {
    let dir = tempdir()?;
    let db = WeDb::open(dir.path())?;

    db.rpush("ttl_list", &["v1", "v2", "v3"])?;
    assert_eq!(db.lttl("ttl_list")?, -1);
    assert_eq!(db.lttl("nonexistent_list")?, -2);

    // 设置过期秒数
    assert!(db.lexpire("ttl_list", 300)?);
    let ttl = db.lttl("ttl_list")?;
    assert!(ttl > 0 && ttl <= 300_000);

    // 移除过期时间
    assert!(db.lpersist("ttl_list")?);
    assert_eq!(db.lttl("ttl_list")?, -1);
    assert!(!db.lpersist("ttl_list")?); // 已经是持久键返回 false

    // 设置绝对毫秒时间戳
    let future_ms = (ts_::sec() + 600) * 1000;
    assert!(db.lexpireat("ttl_list", future_ms)?);
    let ttl2 = db.lttl("ttl_list")?;
    assert!(ttl2 > 0);

    assert!(!db.lexpire("nonexistent_list", 100)?);
    assert!(!db.lexpireat("nonexistent_list", future_ms)?);
    assert!(!db.lpersist("nonexistent_list")?);

    Ok(())
}

#[test]
fn test_list_kvrocks_comprehensive_cases() -> Void {
    let dir = tempdir()?;
    let db = WeDb::open(dir.path())?;

    // 1. LPOS 复杂组合
    db.rpush(
        "lpos_keys",
        &["a", "b", "c", "d", "b", "e", "b", "f", "b", "g"],
    )?; // 'b' at indices 1, 4, 6, 8
    assert_eq!(db.llen("lpos_keys")?, 10);

    // rank = 1
    assert_eq!(db.lpos("lpos_keys", "b", PosSpec::default())?, vec![1]);
    // rank = 2
    assert_eq!(
        db.lpos("lpos_keys", "b", PosSpec::new().with_rank(2))?,
        vec![4]
    );
    // rank = -1 (倒数第 1 个)
    assert_eq!(
        db.lpos("lpos_keys", "b", PosSpec::new().with_rank(-1))?,
        vec![8]
    );
    // rank = -2 (倒数第 2 个)
    assert_eq!(
        db.lpos("lpos_keys", "b", PosSpec::new().with_rank(-2))?,
        vec![6]
    );
    // count = 0 (返回全部)
    assert_eq!(
        db.lpos("lpos_keys", "b", PosSpec::new().with_count(0))?,
        vec![1, 4, 6, 8]
    );
    // count = 2
    assert_eq!(
        db.lpos("lpos_keys", "b", PosSpec::new().with_count(2))?,
        vec![1, 4]
    );
    // rank = -1, count = 2
    assert_eq!(
        db.lpos("lpos_keys", "b", PosSpec::new().with_rank(-1).with_count(2))?,
        vec![8, 6]
    );
    // max_len 限制扫描范围
    assert_eq!(
        db.lpos("lpos_keys", "b", PosSpec::new().with_max_len(3))?,
        vec![1]
    );
    assert_eq!(
        db.lpos("lpos_keys", "b", PosSpec::new().with_max_len(1))?,
        Vec::<i64>::new()
    );

    // 2. LREM 大量元素两端位移测试
    db.rpush("lrem_test", &["x", "1", "2", "x", "3", "4", "x"])?;
    // 从左侧删除 1 个 x
    assert_eq!(db.lrem("lrem_test", 1, "x")?, 1);
    assert_eq!(
        db.lrange("lrem_test", 0, -1)?,
        vec![
            b"1".to_vec(),
            b"2".to_vec(),
            b"x".to_vec(),
            b"3".to_vec(),
            b"4".to_vec(),
            b"x".to_vec()
        ]
    );
    // 从右侧删除 1 个 x
    assert_eq!(db.lrem("lrem_test", -1, "x")?, 1);
    assert_eq!(
        db.lrange("lrem_test", 0, -1)?,
        vec![
            b"1".to_vec(),
            b"2".to_vec(),
            b"x".to_vec(),
            b"3".to_vec(),
            b"4".to_vec()
        ]
    );
    // 删除剩余所有 x
    assert_eq!(db.lrem("lrem_test", 0, "x")?, 1);
    assert_eq!(
        db.lrange("lrem_test", 0, -1)?,
        vec![b"1".to_vec(), b"2".to_vec(), b"3".to_vec(), b"4".to_vec()]
    );

    // 3. LTRIM 极端索引
    db.ltrim("lrem_test", -3, -2)?; // 保留 [2, 3]
    assert_eq!(
        db.lrange("lrem_test", 0, -1)?,
        vec![b"2".to_vec(), b"3".to_vec()]
    );
    assert_eq!(db.llen("lrem_test")?, 2);

    Ok(())
}