codegraph 0.2.0

A fast, reliable, and flexible graph database optimized for storing and querying code relationships
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

//! Integration test for MemoryBackend save/load operations.

use codegraph::{CodeGraph, EdgeType, NodeType, PropertyMap};

#[test]
fn test_memory_backend_in_memory_only() {
    let mut graph = CodeGraph::in_memory().unwrap();

    // Add some nodes and edges
    let node1 = graph
        .add_node(NodeType::Function, PropertyMap::new().with("name", "func1"))
        .unwrap();
    let node2 = graph
        .add_node(NodeType::Function, PropertyMap::new().with("name", "func2"))
        .unwrap();
    graph
        .add_edge(node1, node2, EdgeType::Calls, PropertyMap::new())
        .unwrap();

    assert_eq!(graph.node_count(), 2);
    assert_eq!(graph.edge_count(), 1);

    // Memory backend doesn't persist - just verify operations work
    graph.flush().unwrap();
}

#[test]
fn test_memory_backend_clear() {
    let mut graph = CodeGraph::in_memory().unwrap();

    // Add data
    let node1 = graph
        .add_node(NodeType::Function, PropertyMap::new())
        .unwrap();
    let node2 = graph
        .add_node(NodeType::Function, PropertyMap::new())
        .unwrap();
    graph
        .add_edge(node1, node2, EdgeType::Calls, PropertyMap::new())
        .unwrap();

    assert_eq!(graph.node_count(), 2);
    assert_eq!(graph.edge_count(), 1);

    // Clear
    graph.clear().unwrap();

    assert_eq!(graph.node_count(), 0);
    assert_eq!(graph.edge_count(), 0);
}