(
input: &LogicalPlan,
unnest_placeholder_columns: &mut IndexMap<Column, Option<Vec<ColumnUnnestList>>>,
inner_projection_exprs: &mut Vec<Expr>,
original_exprs: &[Expr],
)
| 352 | } |
| 353 | |
| 354 | pub(crate) fn rewrite_recursive_unnests_bottom_up( |
| 355 | input: &LogicalPlan, |
| 356 | unnest_placeholder_columns: &mut IndexMap<Column, Option<Vec<ColumnUnnestList>>>, |
| 357 | inner_projection_exprs: &mut Vec<Expr>, |
| 358 | original_exprs: &[Expr], |
| 359 | ) -> Result<Vec<Expr>> { |
| 360 | Ok(original_exprs |
| 361 | .iter() |
| 362 | .map(|expr| { |
| 363 | rewrite_recursive_unnest_bottom_up( |
| 364 | input, |
| 365 | unnest_placeholder_columns, |
| 366 | inner_projection_exprs, |
| 367 | expr, |
| 368 | ) |
| 369 | }) |
| 370 | .collect::<Result<Vec<_>>>()? |
| 371 | .into_iter() |
| 372 | .flatten() |
| 373 | .collect::<Vec<_>>()) |
| 374 | } |
| 375 | |
| 376 | pub const UNNEST_PLACEHOLDER: &str = "__unnest_placeholder"; |
| 377 |
no test coverage detected
searching dependent graphs…