use super::{object_name, plan_query, Plan};
pub(super) fn parse_ctes(with: Option<&sqlparser::ast::With>) -> Result<Vec<(String, Plan)>, String> {
let Some(with) = with else { return Ok(Vec::new()) };
if with.recursive {
return Err("WITH RECURSIVE is not supported — a streaming CTE has no fixpoint".into());
}
let mut bound: Vec<(String, Plan)> = Vec::new();
for cte in &with.cte_tables {
let name = object_name(&cte.alias.name.value);
let plan = bind_ctes(plan_query(&cte.query)?, &bound);
bound.push((name, plan));
}
Ok(bound)
}
pub(super) fn bind_ctes(plan: Plan, ctes: &[(String, Plan)]) -> Plan {
if ctes.is_empty() {
return plan;
}
let boxed = |p: Box<Plan>| Box::new(bind_ctes(*p, ctes));
match plan {
Plan::Source(name) => match ctes.iter().find(|(n, _)| *n == name) {
Some((_, cte)) => Plan::Named {
name,
input: Box::new(cte.clone()),
},
None => Plan::Source(name),
},
Plan::Named { name, input } => Plan::Named {
name,
input: boxed(input),
},
Plan::Join {
left,
right,
join_key,
kind,
right_rename,
} => Plan::Join {
left: boxed(left),
right: boxed(right),
join_key,
kind,
right_rename,
},
Plan::Filter { input, predicate } => Plan::Filter {
input: boxed(input),
predicate,
},
Plan::Project { input, star, items } => Plan::Project {
input: boxed(input),
star,
items,
},
Plan::Aggregate {
input,
time_column,
window,
group_by,
pre,
aggs,
post,
having,
trigger,
} => Plan::Aggregate {
input: boxed(input),
time_column,
window,
group_by,
having,
pre,
aggs,
post,
trigger,
},
Plan::TopN {
input,
group_by,
order_by,
tie_by,
descending,
n,
} => Plan::TopN {
input: boxed(input),
group_by,
order_by,
tie_by,
descending,
n,
},
Plan::Sink { input, name } => Plan::Sink {
input: boxed(input),
name,
},
}
}