uni-db 1.1.0

Embedded graph database with OpenCypher queries, vector search, and columnar storage
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

// SPDX-License-Identifier: Apache-2.0
// Copyright 2024-2026 Dragonscale Team

//! Integration tests for L-12: Locy program persistence across evaluate calls.

use uni_db::Uni;

/// Rules registered via `locy().register()` should be available in
/// subsequent `evaluate()` calls without redeclaring them.
#[tokio::test]
async fn test_locy_register_persists_rules() -> anyhow::Result<()> {
    let db = Uni::in_memory().build().await?;
    db.schema()
        .label("Node")
        .property("name", uni_common::core::schema::DataType::String)
        .property_nullable("val", uni_common::core::schema::DataType::Int64)
        .edge_type("EDGE", &["Node"], &["Node"])
        .done()
        .apply()
        .await?;

    let tx = db.session().tx().await?;
    tx.execute(
        "CREATE (a:Node {name: 'A', val: 1})-[:EDGE]->(b:Node {name: 'B', val: 2})-[:EDGE]->(c:Node {name: 'C', val: 3})",
    )
    .await?;
    tx.commit().await?;
    db.flush().await?;

    // Step 1: Register rules globally (no execution).
    db.rules().register(
        "CREATE RULE reach AS
           MATCH (a:Node)-[:EDGE]->(b:Node)
           YIELD KEY a, KEY b",
    )?;

    // Step 2: Evaluate a QUERY that references the registered rule.
    let result = db.session().locy("QUERY reach WHERE a.name = 'A'").await?;

    // The QUERY should find A→B and A→C (via the registered rule).
    assert!(
        result.derived.contains_key("reach"),
        "Should have 'reach' derived relation"
    );
    let facts = &result.derived["reach"];
    assert!(
        facts.len() >= 2,
        "Should find at least 2 facts (A→B, A→C), got {}",
        facts.len()
    );

    Ok(())
}

/// `locy_clear()` should remove all registered rules.
#[tokio::test]
async fn test_locy_clear_removes_registered_rules() -> anyhow::Result<()> {
    let db = Uni::in_memory().build().await?;
    db.schema()
        .label("Node")
        .property("name", uni_common::core::schema::DataType::String)
        .edge_type("EDGE", &["Node"], &["Node"])
        .done()
        .apply()
        .await?;

    let tx = db.session().tx().await?;
    tx.execute("CREATE (:Node {name: 'A'})-[:EDGE]->(:Node {name: 'B'})")
        .await?;
    tx.commit().await?;
    db.flush().await?;

    // Register a rule globally.
    db.rules().register(
        "CREATE RULE reach AS
           MATCH (a:Node)-[:EDGE]->(b:Node)
           YIELD KEY a, KEY b",
    )?;

    // Clear the global registry.
    db.rules().clear();

    // Evaluating a QUERY that references the cleared rule should fail or
    // return empty results (rule is no longer available).
    let result = db.session().locy("QUERY reach WHERE a.name = 'A'").await;
    // The query should fail because 'reach' is not defined.
    assert!(result.is_err(), "Should fail when querying a cleared rule");

    Ok(())
}