minigraf 1.2.1

Zero-config, single-file, embedded graph database with bi-temporal Datalog queries
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

//! Integration tests for magic sets rewriting (#289).
//!
//! Asserts result *correctness* only — magic sets must never change query results.

use minigraf::{Minigraf, QueryResult, Value};
use uuid::Uuid;

fn open_db() -> Minigraf {
    Minigraf::in_memory().expect("open db")
}

fn exec(db: &Minigraf, cmd: &str) -> QueryResult {
    db.execute(cmd)
        .unwrap_or_else(|e| panic!("execution error: {}", e))
}

fn extract_refs(result: QueryResult) -> Vec<Uuid> {
    match result {
        QueryResult::QueryResults { results, .. } => results
            .into_iter()
            .map(|row| match &row[0] {
                Value::Ref(uuid) => *uuid,
                _ => panic!("Expected Ref in result row"),
            })
            .collect(),
        _ => panic!("Expected QueryResults"),
    }
}

/// Transitive closure with bound start: only reachable nodes returned.
#[test]
fn test_bound_start_transitive_closure() {
    let db = open_db();

    let a = Uuid::new_v4();
    let b = Uuid::new_v4();
    let c = Uuid::new_v4();
    let d = Uuid::new_v4();

    exec(
        &db,
        &format!(
            r#"(transact [[#uuid "{}" :edge #uuid "{}"]
                           [#uuid "{}" :edge #uuid "{}"]
                           [#uuid "{}" :edge #uuid "{}"]])"#,
            a, b, b, c, c, d
        ),
    );
    exec(&db, r#"(rule [(reach ?x ?y) [?x :edge ?y]])"#);
    exec(&db, r#"(rule [(reach ?x ?z) (reach ?x ?y) [?y :edge ?z]])"#);

    let result = exec(
        &db,
        &format!(r#"(query [:find ?y :where (reach #uuid "{}" ?y)])"#, a),
    );
    let targets = extract_refs(result);

    assert!(targets.contains(&b), "should reach b");
    assert!(targets.contains(&c), "should reach c");
    assert!(targets.contains(&d), "should reach d");
    assert!(!targets.contains(&a), "should not reach a (no self-loop)");
}

/// All-free transitive closure: magic sets skipped, full result returned correctly.
#[test]
fn test_all_free_transitive_closure() {
    let db = open_db();

    let a = Uuid::new_v4();
    let b = Uuid::new_v4();
    let c = Uuid::new_v4();

    exec(
        &db,
        &format!(
            r#"(transact [[#uuid "{}" :edge #uuid "{}"]
                           [#uuid "{}" :edge #uuid "{}"]])"#,
            a, b, b, c
        ),
    );
    exec(&db, r#"(rule [(reach ?x ?y) [?x :edge ?y]])"#);
    exec(&db, r#"(rule [(reach ?x ?z) (reach ?x ?y) [?y :edge ?z]])"#);

    let result = exec(&db, r#"(query [:find ?x ?y :where (reach ?x ?y)])"#);
    match result {
        QueryResult::QueryResults { results, .. } => {
            // Should have: (a,b), (b,c), (a,c)
            assert_eq!(results.len(), 3, "expected 3 pairs in full closure");

            let pairs: Vec<(Uuid, Uuid)> = results
                .into_iter()
                .map(|row| {
                    let from = match &row[0] {
                        Value::Ref(u) => *u,
                        _ => panic!("Expected Ref for ?x"),
                    };
                    let to = match &row[1] {
                        Value::Ref(u) => *u,
                        _ => panic!("Expected Ref for ?y"),
                    };
                    (from, to)
                })
                .collect();

            assert!(pairs.contains(&(a, b)), "a->b expected");
            assert!(pairs.contains(&(b, c)), "b->c expected");
            assert!(pairs.contains(&(a, c)), "a->c expected (transitive)");
        }
        _ => panic!("Expected QueryResults"),
    }
}

/// Bound result is a subset of all-free result — no extra nodes returned.
#[test]
fn test_bound_result_subset_of_all_free() {
    let db = open_db();

    let x = Uuid::new_v4();
    let y = Uuid::new_v4();
    let z = Uuid::new_v4();
    let p = Uuid::new_v4();
    let q = Uuid::new_v4();

    exec(
        &db,
        &format!(
            r#"(transact [[#uuid "{}" :link #uuid "{}"]
                           [#uuid "{}" :link #uuid "{}"]
                           [#uuid "{}" :link #uuid "{}"]])"#,
            x, y, y, z, p, q
        ),
    );
    exec(&db, r#"(rule [(conn ?a ?b) [?a :link ?b]])"#);
    exec(&db, r#"(rule [(conn ?a ?c) (conn ?a ?b) [?b :link ?c]])"#);

    let bound_result = exec(
        &db,
        &format!(r#"(query [:find ?b :where (conn #uuid "{}" ?b)])"#, x),
    );
    let bound_targets = extract_refs(bound_result);

    assert!(bound_targets.contains(&y), "y is reachable from x");
    assert!(bound_targets.contains(&z), "z is reachable from x");
    assert!(!bound_targets.contains(&q), "q is unreachable from x");

    let all_free_result = exec(&db, r#"(query [:find ?a ?b :where (conn ?a ?b)])"#);
    match all_free_result {
        QueryResult::QueryResults { results, .. } => {
            let all_targets: Vec<Uuid> = results
                .into_iter()
                .map(|row| match &row[1] {
                    Value::Ref(u) => *u,
                    _ => panic!("Expected Ref"),
                })
                .collect();
            assert!(
                all_targets.contains(&q),
                "q is reachable from p in full closure"
            );
        }
        _ => panic!("Expected QueryResults"),
    }
}

/// Multi-hop: 4 levels of recursion with a bound start.
#[test]
fn test_multi_hop_recursion_with_bound_start() {
    let db = open_db();

    let nodes: Vec<Uuid> = (0..5).map(|_| Uuid::new_v4()).collect();

    let mut transact = String::from("(transact [");
    for i in 0..4 {
        transact.push_str(&format!(
            r#"[#uuid "{}" :hop #uuid "{}"]"#,
            nodes[i],
            nodes[i + 1]
        ));
    }
    transact.push_str("])");
    exec(&db, &transact);

    exec(&db, r#"(rule [(path ?x ?y) [?x :hop ?y]])"#);
    exec(&db, r#"(rule [(path ?x ?z) (path ?x ?y) [?y :hop ?z]])"#);

    let result = exec(
        &db,
        &format!(
            r#"(query [:find ?y :where (path #uuid "{}" ?y)])"#,
            nodes[0]
        ),
    );
    let targets = extract_refs(result);

    assert!(targets.contains(&nodes[1]), "should reach node 1");
    assert!(targets.contains(&nodes[2]), "should reach node 2");
    assert!(targets.contains(&nodes[3]), "should reach node 3");
    assert!(targets.contains(&nodes[4]), "should reach node 4");
    assert!(
        !targets.contains(&nodes[0]),
        "should not reach node 0 (no self-loop)"
    );
}

/// Mutual recursion: even/odd distance from a seeded node.
#[test]
fn test_mutual_recursion_even_odd_distance() {
    let db = open_db();

    // Chain: n0 → n1 → n2 → n3 → n4; mark n0 as the even-distance seed
    let nodes: Vec<Uuid> = (0..5).map(|_| Uuid::new_v4()).collect();

    let mut transact = format!(r#"(transact [[#uuid "{}" :is-start true]"#, nodes[0]);
    for i in 0..4 {
        transact.push_str(&format!(
            r#" [#uuid "{}" :next #uuid "{}"]"#,
            nodes[i],
            nodes[i + 1]
        ));
    }
    transact.push_str("])");
    exec(&db, &transact);

    exec(&db, r#"(rule [(even-d ?x) [?x :is-start true]])"#);
    exec(&db, r#"(rule [(even-d ?y) (odd-d ?x) [?x :next ?y]])"#);
    exec(&db, r#"(rule [(odd-d ?y) (even-d ?x) [?x :next ?y]])"#);

    let evens = extract_refs(exec(&db, r#"(query [:find ?x :where (even-d ?x)])"#));
    let odds = extract_refs(exec(&db, r#"(query [:find ?x :where (odd-d ?x)])"#));

    assert!(evens.contains(&nodes[0]), "n0 should be even-distance");
    assert!(evens.contains(&nodes[2]), "n2 should be even-distance");
    assert!(evens.contains(&nodes[4]), "n4 should be even-distance");
    assert!(!evens.contains(&nodes[1]), "n1 should not be even-distance");

    assert!(odds.contains(&nodes[1]), "n1 should be odd-distance");
    assert!(odds.contains(&nodes[3]), "n3 should be odd-distance");
    assert!(!odds.contains(&nodes[0]), "n0 should not be odd-distance");
    assert!(!odds.contains(&nodes[2]), "n2 should not be odd-distance");
    assert!(!odds.contains(&nodes[4]), "n4 should not be odd-distance");
}

/// #298 — value-position keyword binding: (reports-to ?emp :alice) must return
/// employees whose manager is :alice. Previously returned empty due to broken
/// fb seed encoding.
#[test]
fn test_value_position_keyword_binding() {
    let db = open_db();
    let bob = Uuid::new_v4();
    let carol = Uuid::new_v4();

    exec(
        &db,
        &format!(
            r#"(transact [[#uuid "{}" :employee/manager :alice]
                           [#uuid "{}" :employee/manager :alice]])"#,
            bob, carol
        ),
    );
    exec(
        &db,
        r#"(rule [(reports-to ?emp ?mgr) [?emp :employee/manager ?mgr]])"#,
    );

    let result = exec(
        &db,
        r#"(query [:find ?emp :where (reports-to ?emp :alice)])"#,
    );
    let targets = extract_refs(result);

    assert_eq!(targets.len(), 2, "expected 2 employees reporting to alice");
    assert!(targets.contains(&bob), "bob should report to alice");
    assert!(targets.contains(&carol), "carol should report to alice");
}

/// #297 — recursive rule with intermediate variable and entity-position keyword:
/// (reach :a ?y) must return the values reachable from :a via :edge.
/// Previously failed with "Unbound variable in rule head: ?mid".
#[test]
fn test_recursive_intermediate_variable_with_keyword_entity() {
    let db = open_db();

    exec(&db, r#"(transact [[:a :edge :b] [:b :edge :c]])"#);
    exec(&db, r#"(rule [(reach ?x ?y) [?x :edge ?y]])"#);
    exec(
        &db,
        r#"(rule [(reach ?x ?y) [?x :edge ?mid] (reach ?mid ?y)])"#,
    );

    let result = exec(&db, r#"(query [:find ?y :where (reach :a ?y)])"#);

    match result {
        minigraf::QueryResult::QueryResults { results, .. } => {
            let values: Vec<minigraf::Value> =
                results.into_iter().map(|row| row[0].clone()).collect();
            assert_eq!(values.len(), 2, "expected 2 results");
            assert!(
                values.contains(&minigraf::Value::Keyword(":b".to_string())),
                "expected :b in results"
            );
            assert!(
                values.contains(&minigraf::Value::Keyword(":c".to_string())),
                "expected :c in results"
            );
        }
        _ => panic!("expected QueryResults"),
    }
}