Function write_quantified_left

src/sql-parser/src/ast/defs/expr.rs:629–642

Write `left` as the LHS of ` ANY/ALL (...)`. The printed ` ` is an ordinary binary infix. It can be any operator the parser accepts here, from `=`/`<` (`Cmp`) all the way down to `*`/`/`/`%` (`MultiplyDivide`), and on reparse it binds into any operator exposed on `left`'s right spine that is strictly looser* than ` ` itself, stealing that suffix into the quantified expression's le

(
    f: &mut AstFormatter<W>,
    expr: &Expr<T>,
    op: &Op,
)

/// `a + (b * ANY (…))`. [`right_edge`] also sees a looser spine hidden under
/// right-transparent prefixes, e.g. the `NOT`'s `IN` in `- NOT a IN (b) = ANY (…)`.
fn write_quantified_left<W: fmt::Write, T: AstInfo>(
    f: &mut AstFormatter<W>,
    expr: &Expr<T>,
    op: &Op,
) {
    let needs_parens = right_edge(expr) < binary_op_precedence(op);
    if needs_parens {
        f.write_str("(");
        f.write_node(expr);
        f.write_str(")");
    } else {
        f.write_node(expr);
    }
}

/// Write `bound` as a `BETWEEN … AND …` bound. The parser parses both bounds with
/// `parse_subexpr(Precedence::Like)` (see `Parser::parse_between`), starting fresh