#pragma once #include #include #include #include namespace DB { /// Visits AST tree in depth, call functions for nodes according to Matcher type data. /// You need to define Data, visit() and needChildVisit() in Matcher class. template class InDepthNodeVisitor { public: using Data = typename Matcher::Data; explicit InDepthNodeVisitor(Data & data_, WriteBuffer * ostr_ = nullptr) : data(data_), visit_depth(0), ostr(ostr_) {} void visit(T & ast) { DumpASTNode dump(*ast, ostr, visit_depth, typeid(Matcher).name()); if constexpr (!_top_to_bottom) visitChildren(ast); try { Matcher::visit(ast, data); } catch (Exception & e) { e.addMessage("While processing {}", ast->formatForErrorMessage()); throw; } if constexpr (_top_to_bottom) visitChildren(ast); } private: Data & data; size_t visit_depth; WriteBuffer * ostr; void visitChildren(T & ast) { for (auto & child : ast->children) if (Matcher::needChildVisit(ast, child)) visit(child); } }; template using ConstInDepthNodeVisitor = InDepthNodeVisitor; struct NeedChild { using Condition = bool (*)(const ASTPtr & node, const ASTPtr & child); static bool all(const ASTPtr &, const ASTPtr &) { return true; } static bool none(const ASTPtr &, const ASTPtr &) { return false; } }; /// Simple matcher for one node type. Use need_child function for complex traversal logic. template class OneTypeMatcher { public: using Data = DataImpl; using TypeToVisit = typename Data::TypeToVisit; static bool needChildVisit(const ASTPtr & node, const ASTPtr & child) { return need_child(node, child); } static void visit(T & ast, Data & data) { if (auto * t = typeid_cast(ast.get())) data.visit(*t, ast); } }; template using ConstOneTypeMatcher = OneTypeMatcher; }