1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169
// Copyright Syn Developers.
// Copyright Materialize, Inc. and contributors. All rights reserved.
//
// This file is derived from the syn project, available at
// https://github.com/dtolnay/syn. It was incorporated
// directly into Materialize on June 8, 2020.
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License in the LICENSE file at the
// root of this repository, or online at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.
//! Traversal of an immutable AST.
//!
//! Each method of the [`Visit`] trait is a hook that can be overridden to
//! customize the behavior when visiting the corresponding type of node. By
//! default, every method recursively visits the substructure of the input
//! by invoking the right visitor method of each of its fields.
//!
//! ```
//! # use mz_sql_parser::ast::{Expr, Function, FunctionArgs, WindowSpec, Raw, AstInfo};
//! #
//! pub trait Visit<'ast, T: AstInfo> {
//! /* ... */
//!
//! fn visit_function(&mut self, node: &'ast Function<T>) {
//! visit_function(self, node);
//! }
//!
//! /* ... */
//! # fn visit_item_name(&mut self, node: &'ast <T as AstInfo>::ItemName);
//! # fn visit_function_args(&mut self, node: &'ast FunctionArgs<T>);
//! # fn visit_expr(&mut self, node: &'ast Expr<T>);
//! # fn visit_window_spec(&mut self, node: &'ast WindowSpec<T>);
//! }
//!
//! pub fn visit_function<'ast, V, T: AstInfo>(visitor: &mut V, node: &'ast Function<T>)
//! where
//! V: Visit<'ast, T> + ?Sized,
//! {
//! visitor.visit_item_name(&node.name);
//! visitor.visit_function_args(&node.args);
//! if let Some(filter) = &node.filter {
//! visitor.visit_expr(&*filter);
//! }
//! if let Some(over) = &node.over {
//! visitor.visit_window_spec(over);
//! }
//! }
//! ```
//!
//! See also the [`visit_mut`] module for traversing mutable ASTs.
//!
//! # Examples
//!
//! This visitor will count the number of subqueries in a SQL statement.
//!
//! ```
//! use std::error::Error;
//!
//! use mz_sql_parser::ast::{AstInfo, Query, Raw};
//! use mz_sql_parser::ast::visit::{self, Visit};
//!
//! struct SubqueryCounter {
//! count: usize,
//! }
//!
//! impl<'ast> Visit<'ast, Raw> for SubqueryCounter {
//! fn visit_query(&mut self, query: &'ast Query<Raw>) {
//! self.count += 1;
//!
//! // Delegate to the default implementation to visit any nested
//! // subqueries. Placing this call at the end of the method results
//! // in a pre-order traversal. Place it at the beginning for a
//! // post-order traversal instead.
//! visit::visit_query(self, query);
//! }
//! }
//!
//! fn main() -> Result<(), Box<dyn Error>> {
//! let sql = "SELECT (SELECT 1) FROM (SELECT 1) WHERE EXISTS (SELECT (SELECT 1))";
//! let stmts = mz_sql_parser::parser::parse_statements(sql.into())?;
//!
//! let mut counter = SubqueryCounter { count: 0 };
//! for stmt in &stmts {
//! counter.visit_statement(&stmt.ast);
//! }
//! assert_eq!(counter.count, 5);
//! Ok(())
//! }
//! ```
//!
//! The `'ast` lifetime on the input references means that the syntax tree
//! outlives the complete recursive visit call, so the visitor is allowed to
//! hold on to references into the syntax tree.
//!
//! ```
//! use std::error::Error;
//!
//! use mz_sql_parser::ast::{Ident, Raw, AstInfo, RawItemName};
//! use mz_sql_parser::ast::visit::{self, Visit};
//!
//! struct IdentCollector<'ast> {
//! idents: Vec<&'ast Ident>,
//! }
//!
//! impl<'ast> Visit<'ast, Raw> for IdentCollector<'ast> {
//! fn visit_ident(&mut self, node: &'ast Ident) {
//! self.idents.push(node);
//! visit::visit_ident(self, node);
//! }
//! fn visit_item_name(&mut self, name: &'ast <Raw as AstInfo>::ItemName) {
//! match name {
//! RawItemName::Name(n) | RawItemName::Id(_, n, _) => {
//! for node in &n.0 {
//! self.idents.push(node);
//! visit::visit_ident(self, node);
//! }
//! }
//! }
//! }
//! }
//!
//! fn main() -> Result<(), Box<dyn Error>> {
//! let sql = "SELECT a FROM b.c WHERE 1 + d(e)";
//! let stmts = mz_sql_parser::parser::parse_statements(sql.into())?;
//!
//! let mut collector = IdentCollector { idents: vec![] };
//! for stmt in &stmts {
//! collector.visit_statement(&stmt.ast);
//! }
//! assert_eq!(collector.idents, &[
//! &Ident::new_unchecked("a"), &Ident::new_unchecked("b"),
//! &Ident::new_unchecked("c"), &Ident::new_unchecked("d"),
//! &Ident::new_unchecked("e"),
//! ]);
//! Ok(())
//! }
//! ```
//!
//! The [`VisitNode`] trait is implemented for every node in the AST and can be
//! used to write generic functions that apply a `Visit` implementation to any
//! node in the AST.
//!
//! # Implementation notes
//!
//! This module is automatically generated by the crate's build script. Changes
//! to the AST will be automatically propagated to the visitor.
//!
//! This approach to AST visitors is inspired by the [`syn`] crate. These
//! module docs are directly derived from the [`syn::visit`] module docs.
//!
//! [`syn`]: https://docs.rs/syn/1.*/syn/index.html
//! [`syn::visit`]: https://docs.rs/syn/1.*/syn/visit/index.html
#![allow(clippy::all)]
#![allow(unused_variables)]
use crate::ast::*;
include!(concat!(env!("OUT_DIR"), "/visit.rs"));