sinter-store 0.42.0

Embedded persistent graph store (redb), queryable without loading the world
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

//! R8 scale exercise: 500k-node synthetic graph. Slow — ignored in the PR
//! gate, run nightly in release mode:
//! `cargo test --release -p sinter-store --test scale -- --ignored`

use std::time::{Duration, Instant};

use sinter_core::{Confidence, Edge, Evidence, Graph, Node, NodeId, Relation, Span, SymbolKind};
use sinter_store::{EdgeFilter, Store};

#[test]
#[ignore = "500k-node exercise; nightly release-mode gate"]
fn synthetic_500k_nodes_within_budgets() {
    let n = 500_000usize;
    let dir = tempfile::tempdir().unwrap();
    let path = dir.path().join("g.redb");
    // This is an ignored release/nightly gate, so enforce the product
    // budgets directly instead of weakening them with a host multiplier.
    let cold_budget = Duration::from_millis(100);
    let warm_budget = Duration::from_millis(50);
    let traversal_budget = Duration::from_millis(100);

    let mut g = Graph::new();
    for i in 0..n {
        g.add_node(Node {
            id: NodeId::new(format!("f{}.rs#n{i}@0", i % 5000)),
            kind: SymbolKind::Function,
            name: format!("n{i}"),
            file: format!("f{}.rs", i % 5000),
            span: Span { start: 0, end: 50 },
            signature: format!("fn n{i}()"),
            doc: None,
        })
        .unwrap();
    }
    for i in 0..n {
        for k in 1..=3u64 {
            g.add_edge(Edge {
                src: NodeId::new(format!("f{}.rs#n{i}@0", i % 5000)),
                dst: NodeId::new(format!(
                    "f{}.rs#n{}@0",
                    ((i as u64 * 31 + k * 977) as usize % n) % 5000,
                    (i as u64 * 31 + k * 977) as usize % n
                )),
                relation: Relation::Calls,
                evidence: Evidence::Scope,
                confidence: Confidence::Inferred,
                site: None,
            })
            .unwrap();
        }
    }

    let store = Store::create(&path).unwrap();
    store.write_graph(&g).unwrap();
    drop(store);

    // Cold open + point query.
    let cold = Instant::now();
    let store = Store::open(&path).unwrap();
    let target = NodeId::new("f345.rs#n345@0");
    assert!(store.node(&target).unwrap().is_some());
    assert_eq!(store.out_edges(&target).unwrap().len(), 3);
    let cold_elapsed = cold.elapsed();
    assert!(
        cold_elapsed < cold_budget,
        "cold query {cold_elapsed:?}, budget {cold_budget:?} at 500k nodes"
    );

    // Warm queries across the graph.
    let warm = Instant::now();
    for i in (0..n).step_by(50_000) {
        let id = NodeId::new(format!("f{}.rs#n{i}@0", i % 5000));
        store.node(&id).unwrap().expect("node present");
        store.out_edges(&id).unwrap();
        store.in_edges(&id).unwrap();
    }
    let per_query = warm.elapsed() / 10;
    assert!(
        per_query < warm_budget,
        "warm query {per_query:?} avg, budget {warm_budget:?}"
    );

    // Real query verbs traverse, rather than issuing isolated point reads.
    // Depth four visits up to 120 outgoing nodes in this 3-way graph.
    let traversal = Instant::now();
    let reached = store
        .dependencies(&target, &EdgeFilter::default(), 4)
        .unwrap();
    let traversal_elapsed = traversal.elapsed();
    assert!(!reached.is_empty());
    assert!(
        traversal_elapsed < traversal_budget,
        "depth-4 traversal {traversal_elapsed:?}, budget {traversal_budget:?} at 500k nodes"
    );
}