1use super::*;
2use crate::storage::query::sql_lowering::{filter_to_expr, projection_to_select_item};
3
4pub struct TableQueryBuilder {
5 query: TableQuery,
6}
7
8impl TableQueryBuilder {
9 pub fn new(table: &str) -> Self {
11 Self {
12 query: TableQuery::new(table),
13 }
14 }
15
16 pub fn alias(mut self, alias: &str) -> Self {
18 self.query.alias = Some(alias.to_string());
19 self
20 }
21
22 pub fn select(mut self, column: &str) -> Self {
24 let field = FieldRef::column(
25 self.query.alias.as_deref().unwrap_or(&self.query.table),
26 column,
27 );
28 self.query.select_items.push(SelectItem::Expr {
29 expr: Expr::col(field.clone()),
30 alias: None,
31 });
32 self.query.columns.push(Projection::from_field(field));
33 self
34 }
35
36 pub fn select_all(mut self) -> Self {
38 self.query.select_items = vec![SelectItem::Wildcard];
39 self.query.columns.clear();
40 self
41 }
42
43 pub fn filter(mut self, f: Filter) -> Self {
45 let f_expr = filter_to_expr(&f);
46 self.query.where_expr = Some(match self.query.where_expr.take() {
47 Some(existing) => Expr::binop(BinOp::And, existing, f_expr),
48 None => f_expr,
49 });
50 self.query.filter = Some(match self.query.filter.take() {
51 Some(existing) => existing.and(f),
52 None => f,
53 });
54 self
55 }
56
57 pub fn order_by(mut self, clause: OrderByClause) -> Self {
59 self.query.order_by.push(clause);
60 self
61 }
62
63 pub fn limit(mut self, n: u64) -> Self {
65 self.query.limit = Some(n);
66 self
67 }
68
69 pub fn offset(mut self, n: u64) -> Self {
71 self.query.offset = Some(n);
72 self
73 }
74
75 pub fn join_graph(self, pattern: GraphPattern, on: JoinCondition) -> JoinQueryBuilder {
77 JoinQueryBuilder {
78 left: QueryExpr::Table(self.query),
79 right: QueryExpr::Graph(GraphQuery::new(pattern)),
80 on,
81 join_type: JoinType::Inner,
82 filter: None,
83 order_by: Vec::new(),
84 limit: None,
85 offset: None,
86 return_items: Vec::new(),
87 return_: Vec::new(),
88 }
89 }
90
91 pub fn join_table(self, table: &str, on: JoinCondition) -> JoinQueryBuilder {
93 JoinQueryBuilder {
94 left: QueryExpr::Table(self.query),
95 right: QueryExpr::Table(TableQuery::new(table)),
96 on,
97 join_type: JoinType::Inner,
98 filter: None,
99 order_by: Vec::new(),
100 limit: None,
101 offset: None,
102 return_items: Vec::new(),
103 return_: Vec::new(),
104 }
105 }
106
107 pub fn join_vector(self, query: VectorQuery, on: JoinCondition) -> JoinQueryBuilder {
109 JoinQueryBuilder {
110 left: QueryExpr::Table(self.query),
111 right: QueryExpr::Vector(query),
112 on,
113 join_type: JoinType::Inner,
114 filter: None,
115 order_by: Vec::new(),
116 limit: None,
117 offset: None,
118 return_items: Vec::new(),
119 return_: Vec::new(),
120 }
121 }
122
123 pub fn join_path(self, query: PathQuery, on: JoinCondition) -> JoinQueryBuilder {
125 JoinQueryBuilder {
126 left: QueryExpr::Table(self.query),
127 right: QueryExpr::Path(query),
128 on,
129 join_type: JoinType::Inner,
130 filter: None,
131 order_by: Vec::new(),
132 limit: None,
133 offset: None,
134 return_items: Vec::new(),
135 return_: Vec::new(),
136 }
137 }
138
139 pub fn join_hybrid(self, query: HybridQuery, on: JoinCondition) -> JoinQueryBuilder {
141 JoinQueryBuilder {
142 left: QueryExpr::Table(self.query),
143 right: QueryExpr::Hybrid(query),
144 on,
145 join_type: JoinType::Inner,
146 filter: None,
147 order_by: Vec::new(),
148 limit: None,
149 offset: None,
150 return_items: Vec::new(),
151 return_: Vec::new(),
152 }
153 }
154
155 pub fn build(self) -> QueryExpr {
157 QueryExpr::Table(self.query)
158 }
159}
160
161pub struct GraphQueryBuilder {
163 query: GraphQuery,
164}
165
166impl GraphQueryBuilder {
167 pub fn new() -> Self {
169 Self {
170 query: GraphQuery::new(GraphPattern::new()),
171 }
172 }
173
174 pub fn node(mut self, pattern: NodePattern) -> Self {
176 self.query.pattern.nodes.push(pattern);
177 self
178 }
179
180 pub fn edge(mut self, pattern: EdgePattern) -> Self {
182 self.query.pattern.edges.push(pattern);
183 self
184 }
185
186 pub fn filter(mut self, f: Filter) -> Self {
188 self.query.filter = Some(match self.query.filter.take() {
189 Some(existing) => existing.and(f),
190 None => f,
191 });
192 self
193 }
194
195 pub fn alias(mut self, alias: &str) -> Self {
197 self.query.alias = Some(alias.to_string());
198 self
199 }
200
201 pub fn limit(mut self, n: u64) -> Self {
203 self.query.limit = Some(n);
204 self
205 }
206
207 pub fn return_field(mut self, field: FieldRef) -> Self {
209 self.query.return_.push(Projection::from_field(field));
210 self
211 }
212
213 pub fn build(self) -> QueryExpr {
215 QueryExpr::Graph(self.query)
216 }
217}
218
219impl Default for GraphQueryBuilder {
220 fn default() -> Self {
221 Self::new()
222 }
223}
224
225pub struct JoinQueryBuilder {
227 left: QueryExpr,
228 right: QueryExpr,
229 on: JoinCondition,
230 join_type: JoinType,
231 filter: Option<Filter>,
232 order_by: Vec<OrderByClause>,
233 limit: Option<u64>,
234 offset: Option<u64>,
235 return_items: Vec<SelectItem>,
236 return_: Vec<Projection>,
237}
238
239impl JoinQueryBuilder {
240 pub fn join_type(mut self, jt: JoinType) -> Self {
242 self.join_type = jt;
243 self
244 }
245
246 pub fn right_alias(mut self, alias: &str) -> Self {
248 let alias = alias.to_string();
249 match &mut self.right {
250 QueryExpr::Table(table) => table.alias = Some(alias.clone()),
251 QueryExpr::Graph(graph) => graph.alias = Some(alias.clone()),
252 QueryExpr::Path(path) => path.alias = Some(alias.clone()),
253 QueryExpr::Vector(vector) => vector.alias = Some(alias.clone()),
254 QueryExpr::Hybrid(hybrid) => hybrid.alias = Some(alias.clone()),
255 QueryExpr::Join(_)
256 | QueryExpr::Insert(_)
257 | QueryExpr::Update(_)
258 | QueryExpr::Delete(_)
259 | QueryExpr::CreateTable(_)
260 | QueryExpr::CreateCollection(_)
261 | QueryExpr::CreateVector(_)
262 | QueryExpr::DropTable(_)
263 | QueryExpr::DropGraph(_)
264 | QueryExpr::DropVector(_)
265 | QueryExpr::DropDocument(_)
266 | QueryExpr::DropKv(_)
267 | QueryExpr::DropCollection(_)
268 | QueryExpr::Truncate(_)
269 | QueryExpr::AlterTable(_)
270 | QueryExpr::GraphCommand(_)
271 | QueryExpr::SearchCommand(_)
272 | QueryExpr::CreateIndex(_)
273 | QueryExpr::DropIndex(_)
274 | QueryExpr::ProbabilisticCommand(_)
275 | QueryExpr::Ask(_)
276 | QueryExpr::SetConfig { .. }
277 | QueryExpr::ShowConfig { .. }
278 | QueryExpr::SetSecret { .. }
279 | QueryExpr::DeleteSecret { .. }
280 | QueryExpr::ShowSecrets { .. }
281 | QueryExpr::SetTenant(_)
282 | QueryExpr::ShowTenant
283 | QueryExpr::CreateTimeSeries(_)
284 | QueryExpr::CreateMetric(_)
285 | QueryExpr::AlterMetric(_)
286 | QueryExpr::CreateSlo(_)
287 | QueryExpr::DropTimeSeries(_)
288 | QueryExpr::CreateQueue(_)
289 | QueryExpr::AlterQueue(_)
290 | QueryExpr::DropQueue(_)
291 | QueryExpr::QueueSelect(_)
292 | QueryExpr::QueueCommand(_)
293 | QueryExpr::KvCommand(_)
294 | QueryExpr::ConfigCommand(_)
295 | QueryExpr::CreateTree(_)
296 | QueryExpr::DropTree(_)
297 | QueryExpr::TreeCommand(_)
298 | QueryExpr::ExplainAlter(_)
299 | QueryExpr::TransactionControl(_)
300 | QueryExpr::MaintenanceCommand(_)
301 | QueryExpr::CreateSchema(_)
302 | QueryExpr::DropSchema(_)
303 | QueryExpr::CreateSequence(_)
304 | QueryExpr::DropSequence(_)
305 | QueryExpr::CopyFrom(_)
306 | QueryExpr::CreateView(_)
307 | QueryExpr::DropView(_)
308 | QueryExpr::RefreshMaterializedView(_)
309 | QueryExpr::CreatePolicy(_)
310 | QueryExpr::DropPolicy(_)
311 | QueryExpr::CreateServer(_)
312 | QueryExpr::DropServer(_)
313 | QueryExpr::CreateForeignTable(_)
314 | QueryExpr::DropForeignTable(_)
315 | QueryExpr::Grant(_)
316 | QueryExpr::Revoke(_)
317 | QueryExpr::AlterUser(_)
318 | QueryExpr::CreateIamPolicy { .. }
319 | QueryExpr::DropIamPolicy { .. }
320 | QueryExpr::AttachPolicy { .. }
321 | QueryExpr::DetachPolicy { .. }
322 | QueryExpr::ShowPolicies { .. }
323 | QueryExpr::ShowEffectivePermissions { .. }
324 | QueryExpr::RankOf(_)
325 | QueryExpr::ApproxRankOf(_)
326 | QueryExpr::RankRange(_)
327 | QueryExpr::SimulatePolicy { .. }
328 | QueryExpr::LintPolicy { .. }
329 | QueryExpr::MigratePolicyMode { .. }
330 | QueryExpr::CreateMigration(_)
331 | QueryExpr::ApplyMigration(_)
332 | QueryExpr::RollbackMigration(_)
333 | QueryExpr::ExplainMigration(_)
334 | QueryExpr::EventsBackfill(_)
335 | QueryExpr::EventsBackfillStatus { .. } => {}
336 }
337 self
338 }
339
340 pub fn filter(mut self, f: Filter) -> Self {
342 self.filter = Some(match self.filter.take() {
343 Some(existing) => existing.and(f),
344 None => f,
345 });
346 self
347 }
348
349 pub fn order_by(mut self, clause: OrderByClause) -> Self {
351 self.order_by.push(clause);
352 self
353 }
354
355 pub fn limit(mut self, n: u64) -> Self {
357 self.limit = Some(n);
358 self
359 }
360
361 pub fn offset(mut self, n: u64) -> Self {
363 self.offset = Some(n);
364 self
365 }
366
367 pub fn return_field(mut self, field: FieldRef) -> Self {
369 let projection = Projection::from_field(field);
370 if let Some(item) = projection_to_select_item(&projection) {
371 self.return_items.push(item);
372 }
373 self.return_.push(projection);
374 self
375 }
376
377 pub fn select(mut self, column: &str) -> Self {
379 let projection = Projection::from_field(FieldRef::column("", column));
380 if let Some(item) = projection_to_select_item(&projection) {
381 self.return_items.push(item);
382 }
383 self.return_.push(projection);
384 self
385 }
386
387 pub fn build(self) -> QueryExpr {
389 QueryExpr::Join(JoinQuery {
390 left: Box::new(self.left),
391 right: Box::new(self.right),
392 join_type: self.join_type,
393 on: self.on,
394 filter: self.filter,
395 order_by: self.order_by,
396 limit: self.limit,
397 offset: self.offset,
398 return_items: self.return_items,
399 return_: self.return_,
400 })
401 }
402}
403
404pub struct PathQueryBuilder {
406 query: PathQuery,
407}
408
409impl PathQueryBuilder {
410 pub fn new(from: NodeSelector, to: NodeSelector) -> Self {
412 Self {
413 query: PathQuery::new(from, to),
414 }
415 }
416
417 pub fn via_label(mut self, label: impl Into<String>) -> Self {
419 self.query.via.push(label.into());
420 self
421 }
422
423 pub fn max_length(mut self, n: u32) -> Self {
425 self.query.max_length = n;
426 self
427 }
428
429 pub fn filter(mut self, f: Filter) -> Self {
431 self.query.filter = Some(f);
432 self
433 }
434
435 pub fn alias(mut self, alias: &str) -> Self {
437 self.query.alias = Some(alias.to_string());
438 self
439 }
440
441 pub fn build(self) -> QueryExpr {
443 QueryExpr::Path(self.query)
444 }
445}
446
447#[derive(Debug, Clone)]
480pub struct CteDefinition {
481 pub name: String,
483 pub columns: Vec<String>,
485 pub query: Box<QueryExpr>,
487 pub recursive: bool,
489}
490
491impl CteDefinition {
492 pub fn new(name: &str, query: QueryExpr) -> Self {
494 Self {
495 name: name.to_string(),
496 columns: Vec::new(),
497 query: Box::new(query),
498 recursive: false,
499 }
500 }
501
502 pub fn recursive(name: &str, query: QueryExpr) -> Self {
504 Self {
505 name: name.to_string(),
506 columns: Vec::new(),
507 query: Box::new(query),
508 recursive: true,
509 }
510 }
511
512 pub fn with_columns(mut self, columns: Vec<String>) -> Self {
514 self.columns = columns;
515 self
516 }
517}
518
519#[derive(Debug, Clone, Default)]
521pub struct WithClause {
522 pub ctes: Vec<CteDefinition>,
524 pub has_recursive: bool,
526}
527
528impl WithClause {
529 pub fn new() -> Self {
531 Self::default()
532 }
533
534 pub fn add(mut self, cte: CteDefinition) -> Self {
536 if cte.recursive {
537 self.has_recursive = true;
538 }
539 self.ctes.push(cte);
540 self
541 }
542
543 pub fn is_empty(&self) -> bool {
545 self.ctes.is_empty()
546 }
547
548 pub fn get(&self, name: &str) -> Option<&CteDefinition> {
550 self.ctes.iter().find(|c| c.name == name)
551 }
552}
553
554#[derive(Debug, Clone)]
556pub struct QueryWithCte {
557 pub with_clause: Option<WithClause>,
559 pub query: QueryExpr,
561}
562
563impl QueryWithCte {
564 pub fn simple(query: QueryExpr) -> Self {
566 Self {
567 with_clause: None,
568 query,
569 }
570 }
571
572 pub fn with_ctes(with_clause: WithClause, query: QueryExpr) -> Self {
574 Self {
575 with_clause: Some(with_clause),
576 query,
577 }
578 }
579}
580
581pub struct CteQueryBuilder {
583 with_clause: WithClause,
584}
585
586impl CteQueryBuilder {
587 pub fn new() -> Self {
589 Self {
590 with_clause: WithClause::new(),
591 }
592 }
593
594 pub fn cte(mut self, name: &str, query: QueryExpr) -> Self {
596 self.with_clause = self.with_clause.add(CteDefinition::new(name, query));
597 self
598 }
599
600 pub fn recursive_cte(mut self, name: &str, query: QueryExpr) -> Self {
602 self.with_clause = self.with_clause.add(CteDefinition::recursive(name, query));
603 self
604 }
605
606 pub fn cte_with_columns(mut self, name: &str, columns: Vec<String>, query: QueryExpr) -> Self {
608 let cte = CteDefinition::new(name, query).with_columns(columns);
609 self.with_clause = self.with_clause.add(cte);
610 self
611 }
612
613 pub fn build(self, main_query: QueryExpr) -> QueryWithCte {
615 QueryWithCte::with_ctes(self.with_clause, main_query)
616 }
617}
618
619impl Default for CteQueryBuilder {
620 fn default() -> Self {
621 Self::new()
622 }
623}