rocksgraph 0.1.0

A Gremlin-inspired property graph query engine written in Rust, backed by RocksDB
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
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137

// Physical tests: simplePath(), cyclicPath()
use crate::engine::volcano::steps::traits::CoreStep;
use crate::{
    engine::{
        context::NoopCtx,
        traverser::Traverser,
        volcano::steps::{
            simple_cyclic_path::{CyclicPathStep, SimplePathStep},
            traits::{BufferedStep, StepRef},
            vec_source::VecSourceStep,
        },
    },
    types::GValue,
};
use smallvec::smallvec;
use std::rc::Rc;

fn vertex_t(id: i64) -> Rc<Traverser> {
    Traverser::new_rc(GValue::Vertex(id))
}

// Build a traverser with parent chain: [v1] → [v2] → [v3]
fn chain() -> Rc<Traverser> {
    let v1 = vertex_t(1);
    let v2 = Rc::new(Traverser { value: GValue::Vertex(2), parent: Some(Rc::clone(&v1)), labels: None });
    Rc::new(Traverser { value: GValue::Vertex(3), parent: Some(v2), labels: None })
}

#[test]
fn test_simple_path_passes_unique() {
    let src = BufferedStep::new(VecSourceStep::empty());
    src.inner.borrow_mut().core.inject(smallvec![chain()]);
    let mut step = SimplePathStep::default();
    step.add_upper(src.clone() as StepRef);
    let mut ctx = NoopCtx;
    assert!(step.produce(&mut ctx).unwrap().is_some());
}

#[test]
fn test_simple_path_filters_cycle() {
    let v1 = vertex_t(1);
    let v2 = Rc::new(Traverser { value: GValue::Vertex(2), parent: Some(Rc::clone(&v1)), labels: None });
    let cycle = Rc::new(Traverser { value: GValue::Vertex(1), parent: Some(v2), labels: None }); // back to v1
    let src = BufferedStep::new(VecSourceStep::empty());
    src.inner.borrow_mut().core.inject(smallvec![cycle]);
    let mut step = SimplePathStep::default();
    step.add_upper(src.clone() as StepRef);
    let mut ctx = NoopCtx;
    assert!(step.produce(&mut ctx).unwrap().is_none());
}

#[test]
fn test_cyclic_path_keeps_cycle() {
    let v1 = vertex_t(1);
    let v2 = Rc::new(Traverser { value: GValue::Vertex(2), parent: Some(Rc::clone(&v1)), labels: None });
    let cycle = Rc::new(Traverser { value: GValue::Vertex(1), parent: Some(v2), labels: None });
    let src = BufferedStep::new(VecSourceStep::empty());
    src.inner.borrow_mut().core.inject(smallvec![cycle]);
    let mut step = CyclicPathStep::default();
    step.add_upper(src.clone() as StepRef);
    let mut ctx = NoopCtx;
    assert!(step.produce(&mut ctx).unwrap().is_some());
}

#[test]
fn test_cyclic_path_filters_unique() {
    let src = BufferedStep::new(VecSourceStep::empty());
    src.inner.borrow_mut().core.inject(smallvec![chain()]);
    let mut step = CyclicPathStep::default();
    step.add_upper(src.clone() as StepRef);
    let mut ctx = NoopCtx;
    assert!(step.produce(&mut ctx).unwrap().is_none());
}

#[test]
fn test_simple_path_no_upstream() {
    let mut step = SimplePathStep::default();
    let mut ctx = NoopCtx;
    assert!(step.produce(&mut ctx).unwrap().is_none());
}

#[test]
fn test_simple_path_upper() {
    let mut step = SimplePathStep::default();
    assert!(step.upper().is_none());
    let src = BufferedStep::new(VecSourceStep::empty());
    step.add_upper(src.clone() as StepRef);
    assert!(step.upper().is_some());
}

#[test]
fn test_cyclic_path_no_upstream() {
    let mut step = CyclicPathStep::default();
    let mut ctx = NoopCtx;
    assert!(step.produce(&mut ctx).unwrap().is_none());
}

#[test]
fn test_cyclic_path_reset() {
    let src = BufferedStep::new(VecSourceStep::empty());
    src.inner.borrow_mut().core.inject(smallvec![chain()]);
    let mut step = CyclicPathStep::default();
    step.add_upper(src.clone() as StepRef);
    let mut ctx = NoopCtx;
    assert!(step.produce(&mut ctx).unwrap().is_none()); // chain is unique
    step.reset();
    let v1 = vertex_t(1);
    let v2 = Rc::new(Traverser { value: GValue::Vertex(2), parent: Some(Rc::clone(&v1)), labels: None });
    let cycle = Rc::new(Traverser { value: GValue::Vertex(1), parent: Some(v2), labels: None });
    src.inner.borrow_mut().core.inject(smallvec![cycle]);
    assert!(step.produce(&mut ctx).unwrap().is_some()); // cycle after reset
}

#[test]
fn test_cyclic_path_upper() {
    let mut step = CyclicPathStep::default();
    assert!(step.upper().is_none());
    let src = BufferedStep::new(VecSourceStep::empty());
    step.add_upper(src.clone() as StepRef);
    assert!(step.upper().is_some());
}

#[test]
fn test_simple_path_reset() {
    let src = BufferedStep::new(VecSourceStep::empty());
    src.inner.borrow_mut().core.inject(smallvec![chain()]);
    let mut step = SimplePathStep::default();
    step.add_upper(src.clone() as StepRef);
    let mut ctx = NoopCtx;
    assert!(step.produce(&mut ctx).unwrap().is_some());
    step.reset();
    let v1 = vertex_t(1);
    let v2 = Rc::new(Traverser { value: GValue::Vertex(2), parent: Some(Rc::clone(&v1)), labels: None });
    let cycle = Rc::new(Traverser { value: GValue::Vertex(1), parent: Some(v2), labels: None });
    src.inner.borrow_mut().core.inject(smallvec![cycle]);
    assert!(step.produce(&mut ctx).unwrap().is_none());
}