graphersal 0.2.0

In-memory graph database and traversal engine modelled on Apache TinkerPop Gremlin, with vector search for GraphRAG, a Rhai DSL, optimizer, persistence and GraphSON/GraphML I/O
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

use crate::graph::GraphStorage;
use crate::*;

#[derive(Default, Clone)]
struct StepIdentity {}

impl fmt::Display for StepIdentity {
    fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {
        write!(f, "identity()")
    }
}

impl<'g, S: GraphStorage + 'g> GraphTraversalSource<'g, S> {
    /// Passes every traverser through unchanged.
    pub fn identity(self) -> Self {
        self.push_step(GraphStep::Map(
            "identity",
            Box::new(StepIdentity::default()),
        ))
    }
}

impl __ {
    /// Passes every traverser through unchanged. Starts an anonymous traversal (`__.identity()`).
    pub fn identity<'g, S: GraphStorage + 'g>() -> AnonymousTraversal<'g, S> {
        AnonymousTraversal::new().identity()
    }
}

impl<'g, S: GraphStorage + 'g> AnonymousTraversal<'g, S> {
    /// Passes every traverser through unchanged.
    pub fn identity(self) -> Self {
        let step = GraphStep::Map("identity", Box::new(StepIdentity::default()));
        self.push_step(step)
    }
}

impl<'g, S: GraphStorage + 'g> GraphStepMap<'g, S> for StepIdentity {
    #[inline]
    fn process(
        &self,
        _context: &mut TraverserContext<'_, S>,
        source: Traverser<S>,
    ) -> TraverserResult<Traverser<S>> {
        Ok(source)
    }

    fn extends_path(&self) -> bool {
        false
    }

    fn clone_box(&self) -> Box<dyn GraphStepMap<'g, S> + 'g> {
        Box::new(self.clone())
    }
}

#[cfg(test)]
mod tests {
    use super::*;

    #[test]
    fn v_identity() {
        test_dual!(
            graph: GraphSource::tinkerpop_modern(),
            rust: |g| g.v(None).identity().count().to_list(),
            rhai: [
                r#"g.V().identity().count()"#,
                r#"g.v().identity().count()"#,
            ],
            assert: |res| assert_eq!(res[0].as_i64(), Some(6)),
        );
    }

    #[test]
    fn v_identity_values() {
        test_dual!(
            graph: GraphSource::tinkerpop_modern(),
            rust: |g| g.v("1").identity().values("name").to_list(),
            rhai: [
                r#"g.V("1").identity().values("name")"#,
                r#"g.v("1").identity().values("name")"#,
            ],
            assert: |res| assert_eq!(res[0], ElementProperty::String("marko".into())),
        );
    }

    #[test]
    fn e_identity() {
        test_dual!(
            graph: GraphSource::tinkerpop_modern(),
            rust: |g| g.e("1").identity().id().to_list(),
            rhai: [
                r#"g.E("1").identity().id()"#,
                r#"g.e("1").identity().id()"#,
            ],
            assert: |res| assert_eq!(res[0], ElementProperty::String("1".into())),
        );
    }

    #[test]
    fn profile() {
        let graph = GraphSource::tinkerpop_modern();
        let g_lock = graph.read();
        let g = g_lock.traversal();
        let result = g.v("1").identity().profile().unwrap();
        assert!(result.to_string().contains("identity("));
    }
}