graphdblite 0.1.2

Embedded graph database with Cypher support. SQLite-grade simplicity, graph-native performance.
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

use std::collections::HashMap;

use graphdblite::{Database, NodeId, Value};

fn props(pairs: &[(&str, Value)]) -> HashMap<String, Value> {
    pairs
        .iter()
        .map(|(k, v)| (k.to_string(), v.clone()))
        .collect()
}

#[test]
fn create_and_get_node() {
    let mut db = Database::open_memory().unwrap();
    let tx = db.write_tx().unwrap();
    let id = tx
        .create_node("Person", props(&[("name", Value::String("Alice".into()))]))
        .unwrap();
    let node = tx.get_node(id).unwrap();
    assert_eq!(node.labels, vec!["Person".to_string()]);
    assert_eq!(
        node.properties.get("name"),
        Some(&Value::String("Alice".into()))
    );
    tx.commit().unwrap();
}

#[test]
fn node_ids_are_sequential() {
    let mut db = Database::open_memory().unwrap();
    let tx = db.write_tx().unwrap();
    let id1 = tx.create_node("A", HashMap::new()).unwrap();
    let id2 = tx.create_node("B", HashMap::new()).unwrap();
    let id3 = tx.create_node("C", HashMap::new()).unwrap();
    assert_eq!(id1, NodeId(1));
    assert_eq!(id2, NodeId(2));
    assert_eq!(id3, NodeId(3));
    tx.commit().unwrap();
}

#[test]
fn get_nonexistent_node() {
    let mut db = Database::open_memory().unwrap();
    let tx = db.read_tx().unwrap();
    let result = tx.get_node(NodeId(999));
    assert!(result.is_err());
    tx.commit().unwrap();
}

#[test]
fn delete_node() {
    let mut db = Database::open_memory().unwrap();
    let tx = db.write_tx().unwrap();
    let id = tx.create_node("Person", HashMap::new()).unwrap();
    assert!(tx.node_exists(id).unwrap());
    tx.delete_node(id).unwrap();
    assert!(!tx.node_exists(id).unwrap());
    tx.commit().unwrap();
}

#[test]
fn set_and_remove_property() {
    let mut db = Database::open_memory().unwrap();
    let tx = db.write_tx().unwrap();
    let id = tx.create_node("Person", HashMap::new()).unwrap();

    tx.set_node_property(id, "age", Value::I64(30)).unwrap();
    let node = tx.get_node(id).unwrap();
    assert_eq!(node.properties.get("age"), Some(&Value::I64(30)));

    tx.remove_node_property(id, "age").unwrap();
    let node = tx.get_node(id).unwrap();
    assert!(!node.properties.contains_key("age"));

    tx.commit().unwrap();
}

#[test]
fn find_nodes_by_label() {
    let mut db = Database::open_memory().unwrap();
    let tx = db.write_tx().unwrap();
    tx.create_node("Person", props(&[("name", Value::String("Alice".into()))]))
        .unwrap();
    tx.create_node("Person", props(&[("name", Value::String("Bob".into()))]))
        .unwrap();
    tx.create_node("Company", props(&[("name", Value::String("Acme".into()))]))
        .unwrap();

    let people = tx.find_nodes_by_label("Person").unwrap();
    assert_eq!(people.len(), 2);

    let companies = tx.find_nodes_by_label("Company").unwrap();
    assert_eq!(companies.len(), 1);

    tx.commit().unwrap();
}