graphersal 0.1.1

In-memory graph traversal engine modelled on Apache TinkerPop Gremlin, with a Rhai DSL, optimizer 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

//! `disjunct()`: the distinct elements that are in exactly one of two lists.

use super::list_function::{ListArg, ListFunction, list_function_builders, list_function_step};
use crate::graph::GraphStorage;
use crate::*;

list_function_builders!(
    ListFunction::Disjunct,
    disjunct,
    disjunct_traversal,
    "`disjunct(list)` (TinkerPop `DisjunctStep`): the symmetric difference of the list a \
     traverser holds and `list`, each element at most once: first the incoming elements that are \
     not in `list`, then the elements of `list` that are not in the incoming list \
     (`[\"a\", null, \"b\"]` and `[\"a\", \"c\"]` give `[null, \"b\", \"c\"]`).",
    "let odd = g.v(None).values(\"age\").fold().disjunct(vec![27, 40]).next().unwrap().unwrap();\n\
     assert_eq!(odd, ElementProperty::from(vec![29, 32, 35, 40]));"
);

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

    #[test]
    fn symmetric_difference_with_a_constant() {
        test_dual!(
            graph: GraphSource::tinkerpop_modern(),
            rust: |g| g
                .inject(vec![ElementProperty::Array(vec![
                    ElementProperty::from("a"),
                    ElementProperty::Null,
                    ElementProperty::from("b"),
                ])])
                .disjunct(ElementProperty::Array(vec![
                    ElementProperty::from("a"),
                    ElementProperty::Null,
                    ElementProperty::from("c"),
                    ElementProperty::from("c"),
                ]))
                .to_list(),
            rhai: [r#"g.inject(["a", (), "b"]).disjunct(["a", (), "c", "c"])"#],
            assert: |res| assert_eq!(res, &[ElementProperty::from(vec!["b", "c"])]),
        );
    }

    #[test]
    fn with_a_traversal_argument() {
        test_dual!(
            graph: GraphSource::tinkerpop_modern(),
            rust: |g| g
                .v(None)
                .values("age")
                .fold()
                .disjunct_traversal(__::v(None).values("age").fold())
                .to_list(),
            rhai: [
                r#"g.V().values("age").fold().disjunct(__.V().values("age").fold())"#,
                r#"g.v().values("age").fold().disjunct(__.v().values("age").fold())"#,
            ],
            assert: |res| assert_eq!(res, &[ElementProperty::Array(vec![])]),
        );
    }
}