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
51
52
53
54

//! Unit tests for `PropertyMap` builder pattern and type-safe getters.

use codegraph::PropertyMap;

#[test]
fn test_property_map_builder() {
    let props = PropertyMap::new()
        .with("name", "test")
        .with("count", 42)
        .with("enabled", true)
        .with("score", 3.15);

    assert_eq!(props.get_string("name"), Some("test"));
    assert_eq!(props.get_int("count"), Some(42));
    assert_eq!(props.get_bool("enabled"), Some(true));
    assert_eq!(props.get_float("score"), Some(3.15));
}

#[test]
fn test_property_map_type_safe_getters() {
    let props = PropertyMap::new()
        .with("text", "value")
        .with("number", 123i64);

    // Type-safe getters return None for wrong type
    assert_eq!(props.get_int("text"), None);
    assert_eq!(props.get_string("number"), None);
}

#[test]
fn test_property_map_lists() {
    let props = PropertyMap::new()
        .with("symbols", vec!["foo".to_string(), "bar".to_string()])
        .with("lines", vec![1i64, 2i64, 3i64]);

    assert_eq!(
        props.get_string_list("symbols").map(<[String]>::len),
        Some(2)
    );
    assert_eq!(props.get_int_list("lines"), Some(&[1i64, 2i64, 3i64][..]));
}

#[test]
fn test_property_map_insert_and_remove() {
    let mut props = PropertyMap::new();

    props.insert("key1", "value1");
    assert!(props.contains_key("key1"));
    assert_eq!(props.len(), 1);

    props.remove("key1");
    assert!(!props.contains_key("key1"));
    assert_eq!(props.len(), 0);
}