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 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176
use crate::process::traversal::step::has::IntoHasStep; use crate::process::traversal::step::loops::LoopsStep; use crate::process::traversal::step::not::IntoNotStep; use crate::process::traversal::step::or::IntoOrStep; use crate::process::traversal::step::select::IntoSelectStep; use crate::process::traversal::step::where_step::IntoWhereStep; use crate::process::traversal::TraversalBuilder; use crate::structure::{GIDs, IntoPredicate, Labels}; use crate::GValue; pub struct AnonymousTraversalSource { traversal: TraversalBuilder, } impl AnonymousTraversalSource { pub fn new() -> AnonymousTraversalSource { AnonymousTraversalSource { traversal: TraversalBuilder::default(), } } pub fn in_v(&self) -> TraversalBuilder { self.traversal.clone().in_v() } pub fn aggregate<A>(&self, alias: A) -> TraversalBuilder where A: Into<String>, { self.traversal.clone().aggregate(alias) } pub fn add_v<A>(&self, label: A) -> TraversalBuilder where A: Into<Labels>, { self.traversal.clone().add_v(label) } pub fn property<A>(&self, key: &str, value: A) -> TraversalBuilder where A: Into<GValue>, { self.traversal.clone().property(key, value) } pub fn v<T>(&self, ids: T) -> TraversalBuilder where T: Into<GIDs>, { self.traversal.clone().v(ids) } pub fn add_e<A>(&self, label: A) -> TraversalBuilder where A: Into<String>, { self.traversal.clone().add_e(label) } pub fn count(&self) -> TraversalBuilder { self.traversal.clone().count() } pub fn out<L>(&self, labels: L) -> TraversalBuilder where L: Into<Labels>, { self.traversal.clone().out(labels) } pub fn out_e<L>(&self, labels: L) -> TraversalBuilder where L: Into<Labels>, { self.traversal.clone().out_e(labels) } pub fn values<L>(&self, labels: L) -> TraversalBuilder where L: Into<Labels>, { self.traversal.clone().values(labels) } pub fn has_label<L>(&self, labels: L) -> TraversalBuilder where L: Into<Labels>, { self.traversal.clone().has_label(labels) } pub fn as_<A>(&self, alias: A) -> TraversalBuilder where A: Into<String>, { self.traversal.clone().as_(alias) } pub fn has<A>(&self, step: A) -> TraversalBuilder where A: IntoHasStep, { self.traversal.clone().has(step) } pub fn has_many<A>(&self, steps: Vec<A>) -> TraversalBuilder where A: IntoHasStep, { self.traversal.clone().has_many(steps) } pub fn not<A>(&self, step: A) -> TraversalBuilder where A: IntoNotStep, { self.traversal.clone().not(step) } pub fn loops<A>(&self, step: A) -> TraversalBuilder where A: Into<LoopsStep>, { self.traversal.clone().loops(step) } pub fn select<A>(&self, step: A) -> TraversalBuilder where A: IntoSelectStep, { self.traversal.clone().select(step) } pub fn fold(&self) -> TraversalBuilder { self.traversal.clone().fold() } pub fn unfold(&self) -> TraversalBuilder { self.traversal.clone().unfold() } pub fn out_v(&self) -> TraversalBuilder { self.traversal.clone().out_v() } pub fn is<A>(&self, val: A) -> TraversalBuilder where A: IntoPredicate, { self.traversal.clone().is(val) } pub fn or<A>(&self, step: A) -> TraversalBuilder where A: IntoOrStep, { self.traversal.clone().or(step) } pub fn where_<A>(&self, step: A) -> TraversalBuilder where A: IntoWhereStep, { self.traversal.clone().where_(step) } pub fn cap(&self, step: &'static str) -> TraversalBuilder { self.traversal.clone().cap(step) } } impl Default for AnonymousTraversalSource { fn default() -> Self { Self::new() } }