triviumdb 0.7.0

A high-performance memory-mmap hybrid search engine built for AI, combining dense vector, sparse text, graph relations, and JSON metadata.
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
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
#![allow(non_snake_case)]
//! 数据库高级 API 与 TQL 查询语言集成测试
//!
//! 验证范围:
//! - `database/mod.rs`: NodeView、BFS 邻居发现、close/contains/dim、维度迁移、属性索引
//! - `query/tql_executor.rs`: ORDER BY / LIMIT / OFFSET、聚合、DISTINCT、DML (CREATE/SET/DELETE/DETACH DELETE)
//! - `query/tql_parser.rs`: WHERE 条件组合($gte/$lte/$ne)、RETURN 字段选择、MATCH 标签过滤

use triviumdb::database::Database;

const DIM: usize = 4;

fn tmp_db(name: &str) -> String {
    let dir = std::env::temp_dir().join("triviumdb_test");
    std::fs::create_dir_all(&dir).ok();
    let path = dir
        .join(format!("cov2_{}", name))
        .to_string_lossy()
        .to_string();
    cleanup(&path);
    path
}

fn cleanup(path: &str) {
    for ext in &[
        "",
        ".wal",
        ".vec",
        ".lock",
        ".flush_ok",
        ".tmp",
        ".vec.tmp",
        ".flush_ok.tmp",
    ] {
        std::fs::remove_file(format!("{}{}", path, ext)).ok();
    }
}

// ════════════════════════════════════════════════════════════════
//  database/mod.rs 剩余 API
// ════════════════════════════════════════════════════════════════

/// get() — NodeView API
#[test]
fn COV2_01_get_node_view() {
    let path = tmp_db("get_node");

    let mut db = Database::<f32>::open(&path, DIM).unwrap();
    let id = db
        .insert(&[1.0, 2.0, 3.0, 4.0], serde_json::json!({"name": "Alice"}))
        .unwrap();

    let view = db.get(id).unwrap();
    assert_eq!(view.id, id);
    assert_eq!(view.payload["name"], "Alice");
    assert_eq!(view.vector.len(), 4);

    // 不存在的节点
    assert!(db.get(999).is_none());

    cleanup(&path);
}

/// neighbors() — BFS 邻居发现
#[test]
fn COV2_02_neighbors() {
    let path = tmp_db("neighbors");

    let mut db = Database::<f32>::open(&path, DIM).unwrap();
    let a = db
        .insert(&[1.0, 0.0, 0.0, 0.0], serde_json::json!({}))
        .unwrap();
    let b = db
        .insert(&[0.0, 1.0, 0.0, 0.0], serde_json::json!({}))
        .unwrap();
    let c = db
        .insert(&[0.0, 0.0, 1.0, 0.0], serde_json::json!({}))
        .unwrap();
    let d = db
        .insert(&[0.0, 0.0, 0.0, 1.0], serde_json::json!({}))
        .unwrap();

    db.link(a, b, "knows", 1.0).unwrap();
    db.link(b, c, "knows", 1.0).unwrap();
    db.link(c, d, "knows", 1.0).unwrap();

    // depth=1: 只有直接邻居
    let n1 = db.neighbors(a, 1);
    assert!(n1.contains(&b));
    assert!(!n1.contains(&c));

    // depth=2: 2 跳
    let n2 = db.neighbors(a, 2);
    assert!(n2.contains(&b));
    assert!(n2.contains(&c));
    assert!(!n2.contains(&d));

    // depth=0: 没有邻居
    let n0 = db.neighbors(a, 0);
    assert!(n0.is_empty());

    cleanup(&path);
}

/// close() API
#[test]
fn COV2_03_close() {
    let path = tmp_db("close");

    let mut db = Database::<f32>::open(&path, DIM).unwrap();
    db.insert(&[1.0, 0.0, 0.0, 0.0], serde_json::json!({}))
        .unwrap();
    db.close().unwrap();

    // 重新打开验证
    let db = Database::<f32>::open(&path, DIM).unwrap();
    assert_eq!(db.node_count(), 1);

    cleanup(&path);
}

/// contains() + dim() 覆盖
#[test]
fn COV2_04_contains_and_dim() {
    let path = tmp_db("contains");

    let mut db = Database::<f32>::open(&path, DIM).unwrap();
    let id = db
        .insert(&[1.0, 0.0, 0.0, 0.0], serde_json::json!({}))
        .unwrap();

    assert!(db.contains(id));
    assert!(!db.contains(999));
    assert_eq!(db.dim(), DIM);

    cleanup(&path);
}

/// migrate_to — 维度迁移
#[test]
fn COV2_05_migrate_to() {
    let path = tmp_db("migrate_src");
    let new_path = tmp_db("migrate_dst");

    let mut db = Database::<f32>::open(&path, DIM).unwrap();
    let id1 = db
        .insert(&[1.0, 0.0, 0.0, 0.0], serde_json::json!({"name": "A"}))
        .unwrap();
    let id2 = db
        .insert(&[0.0, 1.0, 0.0, 0.0], serde_json::json!({"name": "B"}))
        .unwrap();
    db.link(id1, id2, "rel", 0.5).unwrap();
    db.flush().unwrap();

    let (new_db, migrated_ids) = db.migrate_to(&new_path, 8).unwrap();
    assert_eq!(new_db.node_count(), 2);
    assert_eq!(migrated_ids.len(), 2);
    assert_eq!(new_db.dim(), 8);

    // 验证 payload 迁移
    let p = new_db.get_payload(id1).unwrap();
    assert_eq!(p["name"], "A");

    cleanup(&path);
    cleanup(&new_path);
}

/// create_index / drop_index 覆盖
#[test]
fn COV2_06_property_index() {
    let path = tmp_db("prop_idx");

    let mut db = Database::<f32>::open(&path, DIM).unwrap();
    db.create_index("name");
    db.create_index("age");

    for i in 0..10u32 {
        db.insert(
            &[i as f32, 0.0, 0.0, 0.0],
            serde_json::json!({"name": format!("user_{}", i), "age": i}),
        )
        .unwrap();
    }

    // TQL 使用索引查询
    let results = db.tql(r#"FIND {name: "user_5"} RETURN *"#).unwrap();
    assert_eq!(results.len(), 1, "索引查询应精确命中 user_5");
    let node = results[0].get("_").expect("FIND RETURN * 应绑定 _");
    assert_eq!(node.payload.get("name"), Some(&serde_json::json!("user_5")));
    assert_eq!(node.payload.get("age"), Some(&serde_json::json!(5)));

    db.drop_index("name");

    cleanup(&path);
}

// ════════════════════════════════════════════════════════════════
//  tql_executor.rs 高级分支覆盖
// ════════════════════════════════════════════════════════════════

fn seed_social_graph(path: &str) -> Database<f32> {
    let mut db = Database::<f32>::open(path, DIM).unwrap();
    // 创建 10 个用户
    for i in 0..10u32 {
        db.insert(
            &[i as f32, (i as f32).sin(), (i as f32).cos(), 1.0],
            serde_json::json!({
                "type": "user",
                "name": format!("user_{}", i),
                "age": 20 + i,
                "score": i as f64 * 1.5
            }),
        )
        .unwrap();
    }

    // 建立关系链: 1→2→3→4→5
    let mut ids = db.all_node_ids();
    ids.sort_unstable();
    for i in 0..ids.len() - 1 {
        db.link(ids[i], ids[i + 1], "knows", 0.9).unwrap();
    }

    // 一些额外边
    if ids.len() >= 6 {
        db.link(ids[0], ids[5], "manages", 0.7).unwrap();
    }

    db
}

/// TQL ORDER BY + LIMIT + SKIP 组合
#[test]
fn COV2_07_tql_order_limit_skip() {
    let path = tmp_db("tql_order");
    let db = seed_social_graph(&path);

    // ORDER BY DESC
    let results = db
        .tql(r#"FIND {type: "user"} RETURN * ORDER BY _.age DESC LIMIT 5"#)
        .unwrap();
    assert!(results.len() <= 5);

    // ORDER BY ASC + SKIP
    let results = db
        .tql(r#"FIND {type: "user"} RETURN * ORDER BY _.age ASC LIMIT 10 OFFSET 3"#)
        .unwrap();
    assert!(results.len() <= 7);

    cleanup(&path);
}

/// TQL 聚合: count, sum
#[test]
fn COV2_08_tql_aggregate() {
    let path = tmp_db("tql_agg");
    let db = seed_social_graph(&path);

    // LIMIT 1 返回单行
    let results = db.tql(r#"FIND {type: "user"} RETURN * LIMIT 1"#).unwrap();
    assert_eq!(results.len(), 1);

    cleanup(&path);
}

/// TQL MATCH 图遍历 + WHERE
#[test]
fn COV2_09_tql_match_where() {
    let path = tmp_db("tql_match");
    let db = seed_social_graph(&path);

    // 基础 MATCH
    let results = db
        .tql(r#"MATCH (a)-[:knows]->(b) WHERE a.age > 25 RETURN b"#)
        .unwrap();
    assert!(
        (3..=4).contains(&results.len()),
        "age > 25 的 knows 查询应命中稳定的高年龄出边集合"
    );
    for row in &results {
        let b = row.get("b").expect("MATCH RETURN b 应绑定 b");
        assert_eq!(b.payload.get("type"), Some(&serde_json::json!("user")));
        let age = b.payload.get("age").and_then(|v| v.as_u64()).unwrap();
        assert!((20..=29).contains(&age), "MATCH 结果必须来自社交图用户节点");
    }
    assert!(
        results.iter().any(|row| row
            .get("b")
            .and_then(|node| node.payload.get("age"))
            .and_then(|v| v.as_u64())
            .is_some_and(|age| age >= 27)),
        "WHERE 过滤后结果中应包含高年龄目标节点"
    );

    cleanup(&path);
}

/// TQL MATCH 带标签过滤
#[test]
fn COV2_10_tql_match_label_filter() {
    let path = tmp_db("tql_label");
    let db = seed_social_graph(&path);

    let results = db.tql(r#"MATCH (a)-[:manages]->(b) RETURN a, b"#).unwrap();
    assert_eq!(results.len(), 1, "manages 边应只有一条");
    let a = results[0].get("a").expect("MATCH manages 应绑定 a");
    let b = results[0].get("b").expect("MATCH manages 应绑定 b");
    assert_eq!(a.payload.get("type"), Some(&serde_json::json!("user")));
    assert_eq!(b.payload.get("type"), Some(&serde_json::json!("user")));
    assert_ne!(a.id, b.id, "manages 边两端不应是同一节点");

    // 不存在的标签
    let results = db
        .tql(r#"MATCH (a)-[:nonexistent]->(b) RETURN a, b"#)
        .unwrap();
    assert!(results.is_empty(), "不存在的边标签应返回空结果");

    cleanup(&path);
}

/// TQL SEARCH VECTOR
#[test]
fn COV2_11_tql_search_vector() {
    let path = tmp_db("tql_search");
    let db = seed_social_graph(&path);

    let results = db
        .tql("SEARCH VECTOR [1.0, 0.0, 0.0, 0.0] TOP 3 RETURN *")
        .unwrap();
    assert!(results.len() <= 3, "SEARCH VECTOR 必须遵守 TOP 3");
    assert_eq!(results.len(), 3, "10 个节点中 TOP 3 应返回 3 条");
    for row in &results {
        let node = row.get("_").expect("SEARCH RETURN * 应绑定 _");
        assert_eq!(node.payload.get("type"), Some(&serde_json::json!("user")));
        assert!(
            node.payload.get("name").is_some(),
            "搜索结果必须来自社交图用户节点"
        );
    }

    cleanup(&path);
}

/// TQL DISTINCT 覆盖
#[test]
fn COV2_12_tql_distinct() {
    let path = tmp_db("tql_distinct");
    let db = seed_social_graph(&path);

    let results = db
        .tql(r#"FIND {type: "user"} RETURN DISTINCT type"#)
        .unwrap();
    assert_eq!(
        results.len(),
        1,
        "DISTINCT type 应按返回字段值去重为唯一用户类型"
    );
    for row in &results {
        assert_eq!(row.len(), 1, "DISTINCT type 每行只应返回一个绑定");
        let node = row.values().next().expect("DISTINCT 字段结果应有绑定值");
        assert_eq!(node.payload.get("type"), Some(&serde_json::json!("user")));
        assert!(
            node.payload.get("name").is_some(),
            "DISTINCT type 结果必须仍来自原始用户节点"
        );
    }

    cleanup(&path);
}

/// tql_mut — CREATE 节点
#[test]
fn COV2_13_tql_mut_create() {
    let path = tmp_db("tql_create");
    let mut db = Database::<f32>::open(&path, DIM).unwrap();

    let result = db
        .tql_mut(r#"CREATE ({name: "NewUser", age: 42})"#)
        .unwrap();
    assert_eq!(result.affected, 1);
    assert_eq!(result.created_ids.len(), 1);

    cleanup(&path);
}

/// tql_mut — SET (更新)
#[test]
fn COV2_14_tql_mut_set() {
    let path = tmp_db("tql_set");
    let mut db = seed_social_graph(&path);

    let result = db
        .tql_mut(r#"MATCH (a {name: "user_0"}) SET a.age == 99"#)
        .unwrap();
    assert!(result.affected >= 1, "SET 应影响至少 1 个节点");

    cleanup(&path);
}

/// tql_mut — DELETE
#[test]
fn COV2_15_tql_mut_delete() {
    let path = tmp_db("tql_delete");
    let mut db = seed_social_graph(&path);

    let before = db.node_count();
    let result = db
        .tql_mut(r#"MATCH (a {name: "user_0"}) DELETE a"#)
        .unwrap();
    assert!(result.affected >= 1);
    assert!(db.node_count() < before);

    cleanup(&path);
}

/// tql_mut — DETACH DELETE (删除节点及边)
#[test]
fn COV2_16_tql_mut_detach_delete() {
    let path = tmp_db("tql_detach");
    let mut db = seed_social_graph(&path);

    let before = db.node_count();
    let result = db
        .tql_mut(r#"MATCH (a {name: "user_5"}) DETACH DELETE a"#)
        .unwrap();
    assert!(result.affected >= 1);
    assert!(db.node_count() < before);

    cleanup(&path);
}

/// tql_mut — 读查询降级
#[test]
fn COV2_17_tql_mut_read_fallback() {
    let path = tmp_db("tql_read_fb");
    let mut db = seed_social_graph(&path);

    // 传入读查询给 tql_mut
    let result = db.tql_mut(r#"FIND {type: "user"} RETURN *"#).unwrap();
    assert_eq!(result.affected, 0, "读查询降级应 affected=0");

    cleanup(&path);
}

/// TQL WHERE 多条件: $and, $or, $exists, $ne
#[test]
fn COV2_18_tql_complex_where() {
    let path = tmp_db("tql_complex");
    let db = seed_social_graph(&path);

    // $gte + $lte 范围查询
    let results = db
        .tql(r#"FIND {age: {$gte: 22, $lte: 26}} RETURN *"#)
        .unwrap();
    for row in &results {
        for node in row.values() {
            if let Some(age) = node.payload.get("age").and_then(|v| v.as_u64()) {
                assert!((22..=26).contains(&age));
            }
        }
    }

    // $ne
    let results = db.tql(r#"FIND {name: {$ne: "user_0"}} RETURN *"#).unwrap();
    for row in &results {
        for node in row.values() {
            if let Some(name) = node.payload.get("name").and_then(|v| v.as_str()) {
                assert_ne!(name, "user_0");
            }
        }
    }

    cleanup(&path);
}

/// TQL RETURN 表达式: 字段选择
#[test]
fn COV2_19_tql_return_fields() {
    let path = tmp_db("tql_fields");
    let db = seed_social_graph(&path);

    let results = db.tql(r#"FIND {type: "user"} RETURN name, age"#).unwrap();
    for row in &results {
        for node in row.values() {
            assert!(node.payload.get("name").is_some(), "应包含 name 字段");
            assert!(node.payload.get("age").is_some(), "应包含 age 字段");
        }
    }

    cleanup(&path);
}

/// insert_with_id — 正常路径
#[test]
fn COV2_20_insert_with_id_happy() {
    let path = tmp_db("insert_id_ok");

    let mut db = Database::<f32>::open(&path, DIM).unwrap();
    db.insert_with_id(
        42,
        &[1.0, 0.0, 0.0, 0.0],
        serde_json::json!({"custom_id": 42}),
    )
    .unwrap();

    assert!(db.contains(42));
    let p = db.get_payload(42).unwrap();
    assert_eq!(p["custom_id"], 42);

    cleanup(&path);
}

/// payload too large on insert_with_id
#[test]
fn COV2_21_insert_with_id_payload_too_large() {
    let path = tmp_db("iid_big");

    let mut db = Database::<f32>::open(&path, DIM).unwrap();
    let big = "x".repeat(9 * 1024 * 1024);
    let result = db.insert_with_id(99, &[1.0, 0.0, 0.0, 0.0], serde_json::json!({"data": big}));
    assert!(result.is_err(), "insert_with_id 超大 payload 应被拒绝");

    cleanup(&path);
}