use super::*;
use crate::storage::query::sql_lowering::{filter_to_expr, projection_to_select_item};
pub struct TableQueryBuilder {
query: TableQuery,
}
impl TableQueryBuilder {
pub fn new(table: &str) -> Self {
Self {
query: TableQuery::new(table),
}
}
pub fn alias(mut self, alias: &str) -> Self {
self.query.alias = Some(alias.to_string());
self
}
pub fn select(mut self, column: &str) -> Self {
let field = FieldRef::column(
self.query.alias.as_deref().unwrap_or(&self.query.table),
column,
);
self.query.select_items.push(SelectItem::Expr {
expr: Expr::col(field.clone()),
alias: None,
});
self.query.columns.push(Projection::from_field(field));
self
}
pub fn select_all(mut self) -> Self {
self.query.select_items = vec![SelectItem::Wildcard];
self.query.columns.clear();
self
}
pub fn filter(mut self, f: Filter) -> Self {
let f_expr = filter_to_expr(&f);
self.query.where_expr = Some(match self.query.where_expr.take() {
Some(existing) => Expr::binop(BinOp::And, existing, f_expr),
None => f_expr,
});
self.query.filter = Some(match self.query.filter.take() {
Some(existing) => existing.and(f),
None => f,
});
self
}
pub fn order_by(mut self, clause: OrderByClause) -> Self {
self.query.order_by.push(clause);
self
}
pub fn limit(mut self, n: u64) -> Self {
self.query.limit = Some(n);
self
}
pub fn offset(mut self, n: u64) -> Self {
self.query.offset = Some(n);
self
}
pub fn join_graph(self, pattern: GraphPattern, on: JoinCondition) -> JoinQueryBuilder {
JoinQueryBuilder {
left: QueryExpr::Table(self.query),
right: QueryExpr::Graph(GraphQuery::new(pattern)),
on,
join_type: JoinType::Inner,
filter: None,
order_by: Vec::new(),
limit: None,
offset: None,
return_items: Vec::new(),
return_: Vec::new(),
}
}
pub fn join_table(self, table: &str, on: JoinCondition) -> JoinQueryBuilder {
JoinQueryBuilder {
left: QueryExpr::Table(self.query),
right: QueryExpr::Table(TableQuery::new(table)),
on,
join_type: JoinType::Inner,
filter: None,
order_by: Vec::new(),
limit: None,
offset: None,
return_items: Vec::new(),
return_: Vec::new(),
}
}
pub fn join_vector(self, query: VectorQuery, on: JoinCondition) -> JoinQueryBuilder {
JoinQueryBuilder {
left: QueryExpr::Table(self.query),
right: QueryExpr::Vector(query),
on,
join_type: JoinType::Inner,
filter: None,
order_by: Vec::new(),
limit: None,
offset: None,
return_items: Vec::new(),
return_: Vec::new(),
}
}
pub fn join_path(self, query: PathQuery, on: JoinCondition) -> JoinQueryBuilder {
JoinQueryBuilder {
left: QueryExpr::Table(self.query),
right: QueryExpr::Path(query),
on,
join_type: JoinType::Inner,
filter: None,
order_by: Vec::new(),
limit: None,
offset: None,
return_items: Vec::new(),
return_: Vec::new(),
}
}
pub fn join_hybrid(self, query: HybridQuery, on: JoinCondition) -> JoinQueryBuilder {
JoinQueryBuilder {
left: QueryExpr::Table(self.query),
right: QueryExpr::Hybrid(query),
on,
join_type: JoinType::Inner,
filter: None,
order_by: Vec::new(),
limit: None,
offset: None,
return_items: Vec::new(),
return_: Vec::new(),
}
}
pub fn build(self) -> QueryExpr {
QueryExpr::Table(self.query)
}
}
pub struct GraphQueryBuilder {
query: GraphQuery,
}
impl GraphQueryBuilder {
pub fn new() -> Self {
Self {
query: GraphQuery::new(GraphPattern::new()),
}
}
pub fn node(mut self, pattern: NodePattern) -> Self {
self.query.pattern.nodes.push(pattern);
self
}
pub fn edge(mut self, pattern: EdgePattern) -> Self {
self.query.pattern.edges.push(pattern);
self
}
pub fn filter(mut self, f: Filter) -> Self {
self.query.filter = Some(match self.query.filter.take() {
Some(existing) => existing.and(f),
None => f,
});
self
}
pub fn alias(mut self, alias: &str) -> Self {
self.query.alias = Some(alias.to_string());
self
}
pub fn return_field(mut self, field: FieldRef) -> Self {
self.query.return_.push(Projection::from_field(field));
self
}
pub fn build(self) -> QueryExpr {
QueryExpr::Graph(self.query)
}
}
impl Default for GraphQueryBuilder {
fn default() -> Self {
Self::new()
}
}
pub struct JoinQueryBuilder {
left: QueryExpr,
right: QueryExpr,
on: JoinCondition,
join_type: JoinType,
filter: Option<Filter>,
order_by: Vec<OrderByClause>,
limit: Option<u64>,
offset: Option<u64>,
return_items: Vec<SelectItem>,
return_: Vec<Projection>,
}
impl JoinQueryBuilder {
pub fn join_type(mut self, jt: JoinType) -> Self {
self.join_type = jt;
self
}
pub fn right_alias(mut self, alias: &str) -> Self {
let alias = alias.to_string();
match &mut self.right {
QueryExpr::Table(table) => table.alias = Some(alias.clone()),
QueryExpr::Graph(graph) => graph.alias = Some(alias.clone()),
QueryExpr::Path(path) => path.alias = Some(alias.clone()),
QueryExpr::Vector(vector) => vector.alias = Some(alias.clone()),
QueryExpr::Hybrid(hybrid) => hybrid.alias = Some(alias.clone()),
QueryExpr::Join(_)
| QueryExpr::Insert(_)
| QueryExpr::Update(_)
| QueryExpr::Delete(_)
| QueryExpr::CreateTable(_)
| QueryExpr::DropTable(_)
| QueryExpr::DropGraph(_)
| QueryExpr::DropVector(_)
| QueryExpr::DropDocument(_)
| QueryExpr::DropKv(_)
| QueryExpr::DropCollection(_)
| QueryExpr::Truncate(_)
| QueryExpr::AlterTable(_)
| QueryExpr::GraphCommand(_)
| QueryExpr::SearchCommand(_)
| QueryExpr::CreateIndex(_)
| QueryExpr::DropIndex(_)
| QueryExpr::ProbabilisticCommand(_)
| QueryExpr::Ask(_)
| QueryExpr::SetConfig { .. }
| QueryExpr::ShowConfig { .. }
| QueryExpr::SetSecret { .. }
| QueryExpr::DeleteSecret { .. }
| QueryExpr::ShowSecrets { .. }
| QueryExpr::SetTenant(_)
| QueryExpr::ShowTenant
| QueryExpr::CreateTimeSeries(_)
| QueryExpr::DropTimeSeries(_)
| QueryExpr::CreateQueue(_)
| QueryExpr::AlterQueue(_)
| QueryExpr::DropQueue(_)
| QueryExpr::QueueSelect(_)
| QueryExpr::QueueCommand(_)
| QueryExpr::KvCommand(_)
| QueryExpr::ConfigCommand(_)
| QueryExpr::CreateTree(_)
| QueryExpr::DropTree(_)
| QueryExpr::TreeCommand(_)
| QueryExpr::ExplainAlter(_)
| QueryExpr::TransactionControl(_)
| QueryExpr::MaintenanceCommand(_)
| QueryExpr::CreateSchema(_)
| QueryExpr::DropSchema(_)
| QueryExpr::CreateSequence(_)
| QueryExpr::DropSequence(_)
| QueryExpr::CopyFrom(_)
| QueryExpr::CreateView(_)
| QueryExpr::DropView(_)
| QueryExpr::RefreshMaterializedView(_)
| QueryExpr::CreatePolicy(_)
| QueryExpr::DropPolicy(_)
| QueryExpr::CreateServer(_)
| QueryExpr::DropServer(_)
| QueryExpr::CreateForeignTable(_)
| QueryExpr::DropForeignTable(_)
| QueryExpr::Grant(_)
| QueryExpr::Revoke(_)
| QueryExpr::AlterUser(_)
| QueryExpr::CreateIamPolicy { .. }
| QueryExpr::DropIamPolicy { .. }
| QueryExpr::AttachPolicy { .. }
| QueryExpr::DetachPolicy { .. }
| QueryExpr::ShowPolicies { .. }
| QueryExpr::ShowEffectivePermissions { .. }
| QueryExpr::SimulatePolicy { .. }
| QueryExpr::CreateMigration(_)
| QueryExpr::ApplyMigration(_)
| QueryExpr::RollbackMigration(_)
| QueryExpr::ExplainMigration(_)
| QueryExpr::EventsBackfill(_)
| QueryExpr::EventsBackfillStatus { .. } => {}
}
self
}
pub fn filter(mut self, f: Filter) -> Self {
self.filter = Some(match self.filter.take() {
Some(existing) => existing.and(f),
None => f,
});
self
}
pub fn order_by(mut self, clause: OrderByClause) -> Self {
self.order_by.push(clause);
self
}
pub fn limit(mut self, n: u64) -> Self {
self.limit = Some(n);
self
}
pub fn offset(mut self, n: u64) -> Self {
self.offset = Some(n);
self
}
pub fn return_field(mut self, field: FieldRef) -> Self {
let projection = Projection::from_field(field);
if let Some(item) = projection_to_select_item(&projection) {
self.return_items.push(item);
}
self.return_.push(projection);
self
}
pub fn select(mut self, column: &str) -> Self {
let projection = Projection::from_field(FieldRef::column("", column));
if let Some(item) = projection_to_select_item(&projection) {
self.return_items.push(item);
}
self.return_.push(projection);
self
}
pub fn build(self) -> QueryExpr {
QueryExpr::Join(JoinQuery {
left: Box::new(self.left),
right: Box::new(self.right),
join_type: self.join_type,
on: self.on,
filter: self.filter,
order_by: self.order_by,
limit: self.limit,
offset: self.offset,
return_items: self.return_items,
return_: self.return_,
})
}
}
pub struct PathQueryBuilder {
query: PathQuery,
}
impl PathQueryBuilder {
pub fn new(from: NodeSelector, to: NodeSelector) -> Self {
Self {
query: PathQuery::new(from, to),
}
}
pub fn via_label(mut self, label: impl Into<String>) -> Self {
self.query.via.push(label.into());
self
}
pub fn max_length(mut self, n: u32) -> Self {
self.query.max_length = n;
self
}
pub fn filter(mut self, f: Filter) -> Self {
self.query.filter = Some(f);
self
}
pub fn alias(mut self, alias: &str) -> Self {
self.query.alias = Some(alias.to_string());
self
}
pub fn build(self) -> QueryExpr {
QueryExpr::Path(self.query)
}
}
#[derive(Debug, Clone)]
pub struct CteDefinition {
pub name: String,
pub columns: Vec<String>,
pub query: Box<QueryExpr>,
pub recursive: bool,
}
impl CteDefinition {
pub fn new(name: &str, query: QueryExpr) -> Self {
Self {
name: name.to_string(),
columns: Vec::new(),
query: Box::new(query),
recursive: false,
}
}
pub fn recursive(name: &str, query: QueryExpr) -> Self {
Self {
name: name.to_string(),
columns: Vec::new(),
query: Box::new(query),
recursive: true,
}
}
pub fn with_columns(mut self, columns: Vec<String>) -> Self {
self.columns = columns;
self
}
}
#[derive(Debug, Clone, Default)]
pub struct WithClause {
pub ctes: Vec<CteDefinition>,
pub has_recursive: bool,
}
impl WithClause {
pub fn new() -> Self {
Self::default()
}
pub fn add(mut self, cte: CteDefinition) -> Self {
if cte.recursive {
self.has_recursive = true;
}
self.ctes.push(cte);
self
}
pub fn is_empty(&self) -> bool {
self.ctes.is_empty()
}
pub fn get(&self, name: &str) -> Option<&CteDefinition> {
self.ctes.iter().find(|c| c.name == name)
}
}
#[derive(Debug, Clone)]
pub struct QueryWithCte {
pub with_clause: Option<WithClause>,
pub query: QueryExpr,
}
impl QueryWithCte {
pub fn simple(query: QueryExpr) -> Self {
Self {
with_clause: None,
query,
}
}
pub fn with_ctes(with_clause: WithClause, query: QueryExpr) -> Self {
Self {
with_clause: Some(with_clause),
query,
}
}
}
pub struct CteQueryBuilder {
with_clause: WithClause,
}
impl CteQueryBuilder {
pub fn new() -> Self {
Self {
with_clause: WithClause::new(),
}
}
pub fn cte(mut self, name: &str, query: QueryExpr) -> Self {
self.with_clause = self.with_clause.add(CteDefinition::new(name, query));
self
}
pub fn recursive_cte(mut self, name: &str, query: QueryExpr) -> Self {
self.with_clause = self.with_clause.add(CteDefinition::recursive(name, query));
self
}
pub fn cte_with_columns(mut self, name: &str, columns: Vec<String>, query: QueryExpr) -> Self {
let cte = CteDefinition::new(name, query).with_columns(columns);
self.with_clause = self.with_clause.add(cte);
self
}
pub fn build(self, main_query: QueryExpr) -> QueryWithCte {
QueryWithCte::with_ctes(self.with_clause, main_query)
}
}
impl Default for CteQueryBuilder {
fn default() -> Self {
Self::new()
}
}