#pragma once #include #include #include #include #include #include #include namespace DB { /** Union node represents union of queries in query tree. * Union node must be initialized with normalized union mode. * * Example: (SELECT id FROM test_table) UNION ALL (SELECT id FROM test_table_2); * Example: (SELECT id FROM test_table) UNION DISTINCT (SELECT id FROM test_table_2); * Example: (SELECT id FROM test_table) EXCEPT ALL (SELECT id FROM test_table_2); * Example: (SELECT id FROM test_table) EXCEPT DISTINCT (SELECT id FROM test_table_2); * Example: (SELECT id FROM test_table) INTERSECT ALL (SELECT id FROM test_table_2); * Example: (SELECT id FROM test_table) INTERSECT DISTINCT (SELECT id FROM test_table_2); * * Union node can be used as CTE. * Example: WITH cte_subquery AS ((SELECT id FROM test_table) UNION ALL (SELECT id FROM test_table_2)) SELECT * FROM cte_subquery; * * Union node can be used as scalar subquery. * Example: SELECT (SELECT 1 UNION DISTINCT SELECT 1); * * During query analysis pass union node queries must be resolved. */ class UnionNode; using UnionNodePtr = std::shared_ptr; class UnionNode final : public IQueryTreeNode { public: /// Construct union node with normalized union mode explicit UnionNode(SelectUnionMode union_mode_); /// Returns true if union node is subquery, false otherwise bool isSubquery() const { return is_subquery; } /// Set union node is subquery value void setIsSubquery(bool is_subquery_value) { is_subquery = is_subquery_value; } /// Returns true if union node is CTE, false otherwise bool isCTE() const { return is_cte; } /// Set union node is CTE void setIsCTE(bool is_cte_value) { is_cte = is_cte_value; } /// Get union node CTE name const std::string & getCTEName() const { return cte_name; } /// Set union node CTE name void setCTEName(std::string cte_name_value) { cte_name = std::move(cte_name_value); } /// Get union mode SelectUnionMode getUnionMode() const { return union_mode; } /// Get union node queries const ListNode & getQueries() const { return children[queries_child_index]->as(); } /// Get union node queries ListNode & getQueries() { return children[queries_child_index]->as(); } /// Get union node queries node const QueryTreeNodePtr & getQueriesNode() const { return children[queries_child_index]; } /// Get union node queries node QueryTreeNodePtr & getQueriesNode() { return children[queries_child_index]; } /// Compute union node projection columns NamesAndTypes computeProjectionColumns() const; QueryTreeNodeType getNodeType() const override { return QueryTreeNodeType::UNION; } void dumpTreeImpl(WriteBuffer & buffer, FormatState & format_state, size_t indent) const override; protected: bool isEqualImpl(const IQueryTreeNode & rhs) const override; void updateTreeHashImpl(HashState &) const override; QueryTreeNodePtr cloneImpl() const override; ASTPtr toASTImpl() const override; private: bool is_subquery = false; bool is_cte = false; std::string cte_name; SelectUnionMode union_mode; static constexpr size_t queries_child_index = 0; static constexpr size_t children_size = queries_child_index + 1; }; }