Struct TraversalBuilder

Source

pub struct TraversalBuilder { /* private fields */ }

Implementations§

Source §

pub fn property<K, A>(self, key: K, value: A) -> Self
where K: Into<GValue>, A: Into<GValue>,

Source

pub fn property_many<A>(self, values: Vec<(String, A)>) -> Self
where A: Into<GValue>,

Source

pub fn property_with_cardinality<A>( self, cardinality: Cardinality, key: &str, value: A, ) -> Self
where A: Into<GValue>,

Source

pub fn has<A>(self, step: A) -> Self
where A: Into<HasStep>,

Source

pub fn side_effect<A>(self, step: A) -> Self
where A: IntoSideEffectStep,

Source

pub fn with_side_effect<A>(self, step: (&'static str, A)) -> Self
where A: Into<GValue> + FromGValue,

Source

pub fn has_many<A>(self, steps: Vec<A>) -> Self
where A: Into<HasStep>,

Source

pub fn has_not<A>(self, key: A) -> Self
where A: Into<String>,

Source

pub fn as_<A>(self, alias: A) -> Self
where A: Into<String>,

Source

pub fn add_e<A>(self, label: A) -> Self
where A: Into<Labels>,

Source

pub fn out<A>(self, labels: A) -> Self
where A: Into<Labels>,

Source

pub fn out_e<A>(self, labels: A) -> Self
where A: Into<Labels>,

Source

pub fn out_v(self) -> Self

Source

pub fn in_<A>(self, labels: A) -> Self
where A: Into<Labels>,

Source

pub fn in_e<A>(self, labels: A) -> Self
where A: Into<Labels>,

Source

pub fn in_v(self) -> Self

Source

pub fn both<A>(self, labels: A) -> Self
where A: Into<Labels>,

Source

pub fn both_e<A>(self, labels: A) -> Self
where A: Into<Labels>,

Source

pub fn other(self) -> Self

Source

pub fn other_v(self) -> Self

Source

pub fn label(self) -> Self

Source

pub fn from<A>(self, step: A) -> Self
where A: Into<FromStep>,

Source

pub fn to<A>(self, step: A) -> Self
where A: Into<ToStep>,

Source

pub fn properties<L>(self, labels: L) -> Self
where L: Into<Labels>,

Source

pub fn property_map<L>(self, labels: L) -> Self
where L: Into<Labels>,

Source

pub fn values<L>(self, labels: L) -> Self
where L: Into<Labels>,

Source

pub fn value_map<L>(self, labels: L) -> Self
where L: Into<Labels>,

Source

pub fn element_map<L>(self, labels: L) -> Self
where L: Into<Labels>,

Source

pub fn count(self) -> Self

Examples found in repository ?

examples/traversal_complex.rs (line 51)

7fn main() -> Result<(), Box<dyn std::error::Error>> {
8    let client = GremlinClient::connect("localhost")?;
9
10    let g = traversal().with_remote(client);
11
12    create_graph(&g)?;
13
14    let result = g
15        .v(())
16        .has_label("complex_vertex")
17        .has(("name", "test1"))
18        .out("complex_label")
19        .out("complex_label")
20        .value_map(())
21        .next()?
22        .expect("no vertices found");
23
24    println!(
25        "Found vertex with name {:?}",
26        result["name"].get::<List>().unwrap()[0]
27    );
28
29    let results = g
30        .v(())
31        .has_label("complex_vertex")
32        .has(("number", P::gt(3)))
33        .to_list()?;
34
35    println!(
36        "Found {} vertices with number greater than 3",
37        results.len()
38    );
39
40    let results = g
41        .v(())
42        .has_label("complex_vertex")
43        .has(("number", P::within((3, 6))))
44        .to_list()?;
45
46    println!("Found {} vertices with number 3 or 6", results.len());
47
48    let results = g
49        .v(())
50        .has_label("complex_vertex")
51        .where_(__.out("complex_label").count().is(P::gte(1)))
52        .to_list()?;
53
54    println!(
55        "Found {} vertices with 1 or more connected edges with label complex_label",
56        results.len()
57    );
58
59    Ok(())
60}

Source

pub fn group_count(self, key: Option<String>) -> Self

Source

pub fn group(self, key: Option<String>) -> Self

Source

pub fn by<A>(self, step: A) -> Self
where A: Into<ByStep>,

Source

pub fn select<A>(self, step: A) -> Self
where A: Into<SelectStep>,

Source

pub fn fold(self) -> Self

Source

pub fn unfold(self) -> Self

Source

pub fn path(self) -> Self

Source

pub fn limit<A>(self, limit: A) -> Self
where A: Into<LimitStep>,

Source

pub fn dedup<A>(self, limit: A) -> Self
where A: Into<DedupStep>,

Source

pub fn sum<A>(self, scope: A) -> Self
where A: Into<Scope>,

Source

pub fn max<A>(self, scope: A) -> Self
where A: Into<Scope>,

Source

pub fn mean<A>(self, scope: A) -> Self
where A: Into<Scope>,

Source

pub fn min<A>(self, scope: A) -> Self
where A: Into<Scope>,

Source

pub fn is<A>(self, val: A) -> Self
where A: IntoPredicate,

Examples found in repository ?

examples/traversal_complex.rs (line 51)

7fn main() -> Result<(), Box<dyn std::error::Error>> {
8    let client = GremlinClient::connect("localhost")?;
9
10    let g = traversal().with_remote(client);
11
12    create_graph(&g)?;
13
14    let result = g
15        .v(())
16        .has_label("complex_vertex")
17        .has(("name", "test1"))
18        .out("complex_label")
19        .out("complex_label")
20        .value_map(())
21        .next()?
22        .expect("no vertices found");
23
24    println!(
25        "Found vertex with name {:?}",
26        result["name"].get::<List>().unwrap()[0]
27    );
28
29    let results = g
30        .v(())
31        .has_label("complex_vertex")
32        .has(("number", P::gt(3)))
33        .to_list()?;
34
35    println!(
36        "Found {} vertices with number greater than 3",
37        results.len()
38    );
39
40    let results = g
41        .v(())
42        .has_label("complex_vertex")
43        .has(("number", P::within((3, 6))))
44        .to_list()?;
45
46    println!("Found {} vertices with number 3 or 6", results.len());
47
48    let results = g
49        .v(())
50        .has_label("complex_vertex")
51        .where_(__.out("complex_label").count().is(P::gte(1)))
52        .to_list()?;
53
54    println!(
55        "Found {} vertices with 1 or more connected edges with label complex_label",
56        results.len()
57    );
58
59    Ok(())
60}