2022-07-14 11:20:16 +00:00
|
|
|
#include <Analyzer/QueryTreeBuilder.h>
|
|
|
|
|
|
|
|
#include <Common/FieldVisitorToString.h>
|
|
|
|
|
|
|
|
#include <DataTypes/IDataType.h>
|
|
|
|
#include <DataTypes/DataTypeTuple.h>
|
|
|
|
#include <DataTypes/DataTypesNumber.h>
|
|
|
|
#include <Parsers/ParserSelectQuery.h>
|
|
|
|
#include <Parsers/ParserSelectWithUnionQuery.h>
|
|
|
|
#include <Parsers/ASTSelectWithUnionQuery.h>
|
2022-08-23 09:50:02 +00:00
|
|
|
#include <Parsers/ASTSelectIntersectExceptQuery.h>
|
2022-07-14 11:20:16 +00:00
|
|
|
#include <Parsers/ASTExpressionList.h>
|
|
|
|
#include <Parsers/ASTSelectQuery.h>
|
|
|
|
#include <Parsers/ASTTablesInSelectQuery.h>
|
|
|
|
#include <Parsers/ASTIdentifier.h>
|
|
|
|
#include <Parsers/ASTAsterisk.h>
|
|
|
|
#include <Parsers/ASTQualifiedAsterisk.h>
|
|
|
|
#include <Parsers/ASTColumnsMatcher.h>
|
|
|
|
#include <Parsers/ASTLiteral.h>
|
|
|
|
#include <Parsers/ASTFunction.h>
|
|
|
|
#include <Parsers/ASTSubquery.h>
|
|
|
|
#include <Parsers/ASTWithElement.h>
|
|
|
|
#include <Parsers/ASTColumnsTransformers.h>
|
2022-08-26 13:06:14 +00:00
|
|
|
#include <Parsers/ASTOrderByElement.h>
|
2022-09-03 16:20:09 +00:00
|
|
|
#include <Parsers/ASTInterpolateElement.h>
|
2022-09-04 15:20:59 +00:00
|
|
|
#include <Parsers/ASTSampleRatio.h>
|
2022-07-14 11:20:16 +00:00
|
|
|
|
|
|
|
#include <Analyzer/IdentifierNode.h>
|
|
|
|
#include <Analyzer/MatcherNode.h>
|
|
|
|
#include <Analyzer/ColumnTransformers.h>
|
|
|
|
#include <Analyzer/ConstantNode.h>
|
|
|
|
#include <Analyzer/ColumnNode.h>
|
|
|
|
#include <Analyzer/FunctionNode.h>
|
|
|
|
#include <Analyzer/LambdaNode.h>
|
2022-08-26 13:06:14 +00:00
|
|
|
#include <Analyzer/SortColumnNode.h>
|
2022-09-03 16:20:09 +00:00
|
|
|
#include <Analyzer/InterpolateColumnNode.h>
|
2022-07-14 11:20:16 +00:00
|
|
|
#include <Analyzer/TableNode.h>
|
2022-07-20 15:25:24 +00:00
|
|
|
#include <Analyzer/TableFunctionNode.h>
|
2022-07-14 11:20:16 +00:00
|
|
|
#include <Analyzer/QueryNode.h>
|
2022-08-15 16:34:10 +00:00
|
|
|
#include <Analyzer/ArrayJoinNode.h>
|
|
|
|
#include <Analyzer/JoinNode.h>
|
2022-08-23 09:50:02 +00:00
|
|
|
#include <Analyzer/UnionNode.h>
|
2022-07-14 11:20:16 +00:00
|
|
|
#include <Analyzer/InDepthQueryTreeVisitor.h>
|
|
|
|
|
|
|
|
#include <Databases/IDatabase.h>
|
|
|
|
|
|
|
|
#include <Interpreters/StorageID.h>
|
|
|
|
#include <Interpreters/Context.h>
|
|
|
|
#include <Functions/FunctionFactory.h>
|
|
|
|
|
|
|
|
|
|
|
|
namespace DB
|
|
|
|
{
|
|
|
|
|
|
|
|
namespace ErrorCodes
|
|
|
|
{
|
|
|
|
extern const int UNSUPPORTED_METHOD;
|
|
|
|
extern const int LOGICAL_ERROR;
|
|
|
|
}
|
|
|
|
|
2022-08-23 09:50:02 +00:00
|
|
|
namespace
|
|
|
|
{
|
|
|
|
|
2022-07-14 11:20:16 +00:00
|
|
|
class QueryTreeBuilder : public WithContext
|
|
|
|
{
|
|
|
|
public:
|
|
|
|
QueryTreeBuilder(ASTPtr query_, ContextPtr context_);
|
|
|
|
|
|
|
|
QueryTreeNodePtr getQueryTreeNode()
|
|
|
|
{
|
|
|
|
return query_tree_node;
|
|
|
|
}
|
|
|
|
|
|
|
|
private:
|
2022-08-23 09:50:02 +00:00
|
|
|
QueryTreeNodePtr buildSelectOrUnionExpression(const ASTPtr & select_or_union_query, bool is_subquery, const std::string & cte_name) const;
|
|
|
|
|
|
|
|
QueryTreeNodePtr buildSelectWithUnionExpression(const ASTPtr & select_with_union_query, bool is_subquery, const std::string & cte_name) const;
|
|
|
|
|
|
|
|
QueryTreeNodePtr buildSelectIntersectExceptQuery(const ASTPtr & select_intersect_except_query, bool is_subquery, const std::string & cte_name) const;
|
2022-07-14 11:20:16 +00:00
|
|
|
|
2022-08-23 09:50:02 +00:00
|
|
|
QueryTreeNodePtr buildSelectExpression(const ASTPtr & select_query, bool is_subquery, const std::string & cte_name) const;
|
2022-07-14 11:20:16 +00:00
|
|
|
|
2022-08-26 13:06:14 +00:00
|
|
|
QueryTreeNodePtr buildSortColumnList(const ASTPtr & order_by_expression_list) const;
|
|
|
|
|
2022-09-03 16:20:09 +00:00
|
|
|
QueryTreeNodePtr buildInterpolateColumnList(const ASTPtr & interpolate_expression_list) const;
|
|
|
|
|
2022-08-23 09:50:02 +00:00
|
|
|
QueryTreeNodePtr buildExpressionList(const ASTPtr & expression_list) const;
|
2022-07-14 11:20:16 +00:00
|
|
|
|
2022-08-23 09:50:02 +00:00
|
|
|
QueryTreeNodePtr buildExpression(const ASTPtr & expression) const;
|
2022-07-14 11:20:16 +00:00
|
|
|
|
2022-08-23 09:50:02 +00:00
|
|
|
QueryTreeNodePtr buildJoinTree(const ASTPtr & tables_in_select_query) const;
|
2022-07-14 11:20:16 +00:00
|
|
|
|
2022-08-23 09:50:02 +00:00
|
|
|
ColumnTransformersNodes buildColumnTransformers(const ASTPtr & matcher_expression, size_t start_child_index) const;
|
2022-07-14 11:20:16 +00:00
|
|
|
|
|
|
|
ASTPtr query;
|
|
|
|
QueryTreeNodePtr query_tree_node;
|
|
|
|
|
|
|
|
};
|
|
|
|
|
|
|
|
QueryTreeBuilder::QueryTreeBuilder(ASTPtr query_, ContextPtr context_)
|
|
|
|
: WithContext(context_)
|
|
|
|
, query(query_->clone())
|
|
|
|
{
|
2022-08-23 09:50:02 +00:00
|
|
|
if (query->as<ASTSelectWithUnionQuery>() ||
|
|
|
|
query->as<ASTSelectIntersectExceptQuery>() ||
|
|
|
|
query->as<ASTSelectQuery>())
|
|
|
|
query_tree_node = buildSelectOrUnionExpression(query, false /*is_subquery*/, {} /*cte_name*/);
|
2022-07-14 11:20:16 +00:00
|
|
|
else if (query->as<ASTExpressionList>())
|
2022-08-23 09:50:02 +00:00
|
|
|
query_tree_node = buildExpressionList(query);
|
2022-07-14 11:20:16 +00:00
|
|
|
else
|
2022-08-23 09:50:02 +00:00
|
|
|
query_tree_node = buildExpression(query);
|
2022-07-14 11:20:16 +00:00
|
|
|
}
|
|
|
|
|
2022-08-23 09:50:02 +00:00
|
|
|
QueryTreeNodePtr QueryTreeBuilder::buildSelectOrUnionExpression(const ASTPtr & select_or_union_query, bool is_subquery, const std::string & cte_name) const
|
|
|
|
{
|
|
|
|
QueryTreeNodePtr query_node;
|
|
|
|
|
|
|
|
if (select_or_union_query->as<ASTSelectWithUnionQuery>())
|
|
|
|
query_node = buildSelectWithUnionExpression(select_or_union_query, is_subquery /*is_subquery*/, cte_name /*cte_name*/);
|
|
|
|
else if (select_or_union_query->as<ASTSelectIntersectExceptQuery>())
|
|
|
|
query_node = buildSelectIntersectExceptQuery(select_or_union_query, is_subquery /*is_subquery*/, cte_name /*cte_name*/);
|
|
|
|
else if (select_or_union_query->as<ASTSelectQuery>())
|
|
|
|
query_node = buildSelectExpression(select_or_union_query, is_subquery /*is_subquery*/, cte_name /*cte_name*/);
|
|
|
|
else
|
2022-08-25 18:35:16 +00:00
|
|
|
throw Exception(ErrorCodes::UNSUPPORTED_METHOD, "SELECT or UNION query {} is not supported", select_or_union_query->formatForErrorMessage());
|
2022-08-23 09:50:02 +00:00
|
|
|
|
|
|
|
return query_node;
|
|
|
|
}
|
|
|
|
|
|
|
|
QueryTreeNodePtr QueryTreeBuilder::buildSelectWithUnionExpression(const ASTPtr & select_with_union_query, bool is_subquery, const std::string & cte_name) const
|
2022-07-14 11:20:16 +00:00
|
|
|
{
|
|
|
|
auto & select_with_union_query_typed = select_with_union_query->as<ASTSelectWithUnionQuery &>();
|
|
|
|
auto & select_lists = select_with_union_query_typed.list_of_selects->as<ASTExpressionList &>();
|
|
|
|
|
|
|
|
if (select_lists.children.size() == 1)
|
2022-08-23 09:50:02 +00:00
|
|
|
return buildSelectOrUnionExpression(select_lists.children[0], is_subquery, cte_name);
|
|
|
|
|
|
|
|
auto union_node = std::make_shared<UnionNode>();
|
|
|
|
union_node->setIsSubquery(is_subquery);
|
|
|
|
union_node->setCTEName(cte_name);
|
|
|
|
union_node->setUnionMode(select_with_union_query_typed.union_mode);
|
|
|
|
union_node->setUnionModes(select_with_union_query_typed.list_of_modes);
|
|
|
|
union_node->setOriginalAST(select_with_union_query);
|
|
|
|
|
|
|
|
size_t select_lists_children_size = select_lists.children.size();
|
|
|
|
|
|
|
|
for (size_t i = 0; i < select_lists_children_size; ++i)
|
2022-07-14 11:20:16 +00:00
|
|
|
{
|
2022-08-23 09:50:02 +00:00
|
|
|
auto & select_list_node = select_lists.children[i];
|
|
|
|
QueryTreeNodePtr query_node = buildSelectOrUnionExpression(select_list_node, false /*is_subquery*/, {} /*cte_name*/);
|
|
|
|
union_node->getQueries().getNodes().push_back(std::move(query_node));
|
2022-07-14 11:20:16 +00:00
|
|
|
}
|
|
|
|
|
2022-08-23 09:50:02 +00:00
|
|
|
return union_node;
|
|
|
|
}
|
|
|
|
|
|
|
|
QueryTreeNodePtr QueryTreeBuilder::buildSelectIntersectExceptQuery(const ASTPtr & select_intersect_except_query, bool is_subquery, const std::string & cte_name) const
|
|
|
|
{
|
|
|
|
auto & select_intersect_except_query_typed = select_intersect_except_query->as<ASTSelectIntersectExceptQuery &>();
|
|
|
|
auto select_lists = select_intersect_except_query_typed.getListOfSelects();
|
|
|
|
|
|
|
|
if (select_lists.size() == 1)
|
|
|
|
return buildSelectExpression(select_lists[0], is_subquery, cte_name);
|
|
|
|
|
|
|
|
auto union_node = std::make_shared<UnionNode>();
|
|
|
|
union_node->setIsSubquery(is_subquery);
|
|
|
|
union_node->setCTEName(cte_name);
|
2022-07-14 11:20:16 +00:00
|
|
|
|
2022-08-23 09:50:02 +00:00
|
|
|
if (select_intersect_except_query_typed.final_operator == ASTSelectIntersectExceptQuery::Operator::INTERSECT)
|
|
|
|
union_node->setUnionMode(SelectUnionMode::INTERSECT);
|
|
|
|
else if (select_intersect_except_query_typed.final_operator == ASTSelectIntersectExceptQuery::Operator::EXCEPT)
|
|
|
|
union_node->setUnionMode(SelectUnionMode::EXCEPT);
|
|
|
|
else
|
|
|
|
throw Exception(ErrorCodes::LOGICAL_ERROR, "UNION type is not initialized");
|
|
|
|
|
|
|
|
union_node->setUnionModes(SelectUnionModes(select_lists.size() - 1, union_node->getUnionMode()));
|
|
|
|
union_node->setOriginalAST(select_intersect_except_query);
|
2022-07-14 11:20:16 +00:00
|
|
|
|
2022-08-23 09:50:02 +00:00
|
|
|
size_t select_lists_size = select_lists.size();
|
2022-07-14 11:20:16 +00:00
|
|
|
|
2022-08-23 09:50:02 +00:00
|
|
|
for (size_t i = 0; i < select_lists_size; ++i)
|
|
|
|
{
|
|
|
|
auto & select_list_node = select_lists[i];
|
|
|
|
QueryTreeNodePtr query_node = buildSelectOrUnionExpression(select_list_node, false /*is_subquery*/, {} /*cte_name*/);
|
|
|
|
union_node->getQueries().getNodes().push_back(std::move(query_node));
|
2022-07-14 11:20:16 +00:00
|
|
|
}
|
2022-08-23 09:50:02 +00:00
|
|
|
|
|
|
|
return union_node;
|
2022-07-14 11:20:16 +00:00
|
|
|
}
|
|
|
|
|
2022-08-23 09:50:02 +00:00
|
|
|
QueryTreeNodePtr QueryTreeBuilder::buildSelectExpression(const ASTPtr & select_query, bool is_subquery, const std::string & cte_name) const
|
2022-07-14 11:20:16 +00:00
|
|
|
{
|
|
|
|
const auto & select_query_typed = select_query->as<ASTSelectQuery &>();
|
|
|
|
auto current_query_tree = std::make_shared<QueryNode>();
|
2022-07-18 17:20:28 +00:00
|
|
|
|
|
|
|
current_query_tree->setIsSubquery(is_subquery);
|
|
|
|
current_query_tree->setIsCTE(!cte_name.empty());
|
|
|
|
current_query_tree->setCTEName(cte_name);
|
2022-08-25 18:35:16 +00:00
|
|
|
current_query_tree->setIsDistinct(select_query_typed.distinct);
|
2022-08-26 16:23:26 +00:00
|
|
|
current_query_tree->setIsLimitWithTies(select_query_typed.limit_with_ties);
|
2022-09-02 14:36:35 +00:00
|
|
|
current_query_tree->setIsGroupByWithTotals(select_query_typed.group_by_with_totals);
|
|
|
|
current_query_tree->setIsGroupByWithCube(select_query_typed.group_by_with_cube);
|
|
|
|
current_query_tree->setIsGroupByWithRollup(select_query_typed.group_by_with_rollup);
|
|
|
|
current_query_tree->setIsGroupByWithGroupingSets(select_query_typed.group_by_with_grouping_sets);
|
2022-07-14 11:20:16 +00:00
|
|
|
current_query_tree->setOriginalAST(select_query);
|
|
|
|
|
2022-09-04 15:20:59 +00:00
|
|
|
current_query_tree->getJoinTree() = buildJoinTree(select_query_typed.tables());
|
|
|
|
|
2022-07-14 11:20:16 +00:00
|
|
|
auto select_with_list = select_query_typed.with();
|
|
|
|
if (select_with_list)
|
2022-08-25 14:19:35 +00:00
|
|
|
current_query_tree->getWithNode() = buildExpressionList(select_with_list);
|
2022-07-14 11:20:16 +00:00
|
|
|
|
|
|
|
auto select_expression_list = select_query_typed.select();
|
|
|
|
if (select_expression_list)
|
2022-08-25 14:19:35 +00:00
|
|
|
current_query_tree->getProjectionNode() = buildExpressionList(select_expression_list);
|
2022-07-14 11:20:16 +00:00
|
|
|
|
|
|
|
auto prewhere_expression = select_query_typed.prewhere();
|
|
|
|
if (prewhere_expression)
|
2022-08-23 09:50:02 +00:00
|
|
|
current_query_tree->getPrewhere() = buildExpression(prewhere_expression);
|
2022-07-14 11:20:16 +00:00
|
|
|
|
|
|
|
auto where_expression = select_query_typed.where();
|
|
|
|
if (where_expression)
|
2022-08-23 09:50:02 +00:00
|
|
|
current_query_tree->getWhere() = buildExpression(where_expression);
|
2022-07-14 11:20:16 +00:00
|
|
|
|
2022-08-25 14:19:35 +00:00
|
|
|
auto group_by_list = select_query_typed.groupBy();
|
|
|
|
if (group_by_list)
|
2022-09-02 15:41:19 +00:00
|
|
|
{
|
|
|
|
auto & group_by_children = group_by_list->children;
|
|
|
|
|
|
|
|
if (current_query_tree->isGroupByWithGroupingSets())
|
|
|
|
{
|
|
|
|
auto grouping_sets_list_node = std::make_shared<ListNode>();
|
|
|
|
|
|
|
|
for (auto & grouping_sets_keys : group_by_children)
|
|
|
|
{
|
|
|
|
auto grouping_sets_keys_list_node = buildExpressionList(grouping_sets_keys);
|
|
|
|
current_query_tree->getGroupBy().getNodes().emplace_back(std::move(grouping_sets_keys_list_node));
|
|
|
|
}
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
current_query_tree->getGroupByNode() = buildExpressionList(group_by_list);
|
|
|
|
}
|
|
|
|
}
|
2022-08-25 14:19:35 +00:00
|
|
|
|
2022-09-02 10:30:12 +00:00
|
|
|
auto having_expression = select_query_typed.having();
|
|
|
|
if (having_expression)
|
|
|
|
current_query_tree->getHaving() = buildExpression(having_expression);
|
|
|
|
|
2022-08-26 13:06:14 +00:00
|
|
|
auto select_order_by_list = select_query_typed.orderBy();
|
|
|
|
if (select_order_by_list)
|
|
|
|
current_query_tree->getOrderByNode() = buildSortColumnList(select_order_by_list);
|
|
|
|
|
2022-09-03 16:20:09 +00:00
|
|
|
auto interpolate_list = select_query_typed.interpolate();
|
|
|
|
if (interpolate_list)
|
|
|
|
current_query_tree->getInterpolate() = buildInterpolateColumnList(interpolate_list);
|
|
|
|
|
2022-09-03 17:21:17 +00:00
|
|
|
auto select_limit_by_limit = select_query_typed.limitByLength();
|
|
|
|
if (select_limit_by_limit)
|
|
|
|
current_query_tree->getLimitByLimit() = buildExpression(select_limit_by_limit);
|
|
|
|
|
|
|
|
auto select_limit_by_offset = select_query_typed.limitOffset();
|
|
|
|
if (select_limit_by_offset)
|
|
|
|
current_query_tree->getLimitByOffset() = buildExpression(select_limit_by_offset);
|
|
|
|
|
|
|
|
auto select_limit_by = select_query_typed.limitBy();
|
|
|
|
if (select_limit_by)
|
|
|
|
current_query_tree->getLimitByNode() = buildExpressionList(select_limit_by);
|
|
|
|
|
2022-08-26 16:23:26 +00:00
|
|
|
auto select_limit = select_query_typed.limitLength();
|
|
|
|
if (select_limit)
|
|
|
|
current_query_tree->getLimit() = buildExpression(select_limit);
|
|
|
|
|
|
|
|
auto select_offset = select_query_typed.limitOffset();
|
|
|
|
if (select_offset)
|
|
|
|
current_query_tree->getOffset() = buildExpression(select_offset);
|
|
|
|
|
2022-07-14 11:20:16 +00:00
|
|
|
return current_query_tree;
|
|
|
|
}
|
|
|
|
|
2022-08-26 13:06:14 +00:00
|
|
|
QueryTreeNodePtr QueryTreeBuilder::buildSortColumnList(const ASTPtr & order_by_expression_list) const
|
|
|
|
{
|
|
|
|
auto list_node = std::make_shared<ListNode>();
|
|
|
|
|
|
|
|
auto & expression_list_typed = order_by_expression_list->as<ASTExpressionList &>();
|
|
|
|
list_node->getNodes().reserve(expression_list_typed.children.size());
|
|
|
|
|
|
|
|
for (auto & expression : expression_list_typed.children)
|
|
|
|
{
|
|
|
|
const auto & order_by_element = expression->as<const ASTOrderByElement &>();
|
|
|
|
|
|
|
|
auto sort_direction = order_by_element.direction == 1 ? SortDirection::ASCENDING : SortDirection::DESCENDING;
|
|
|
|
std::optional<SortDirection> nulls_sort_direction;
|
|
|
|
if (order_by_element.nulls_direction_was_explicitly_specified)
|
|
|
|
nulls_sort_direction = order_by_element.nulls_direction == 1 ? SortDirection::ASCENDING : SortDirection::DESCENDING;
|
|
|
|
|
|
|
|
std::shared_ptr<Collator> collator;
|
|
|
|
if (order_by_element.collation)
|
|
|
|
collator = std::make_shared<Collator>(order_by_element.collation->as<ASTLiteral &>().value.get<String>());
|
|
|
|
|
|
|
|
const auto & sort_expression_ast = order_by_element.children.at(0);
|
|
|
|
auto sort_expression = buildExpression(sort_expression_ast);
|
2022-09-03 17:34:52 +00:00
|
|
|
auto sort_column_node = std::make_shared<SortColumnNode>(std::move(sort_expression),
|
|
|
|
sort_direction,
|
|
|
|
nulls_sort_direction,
|
|
|
|
std::move(collator),
|
|
|
|
order_by_element.with_fill);
|
2022-08-26 13:06:14 +00:00
|
|
|
|
|
|
|
if (order_by_element.fill_from)
|
|
|
|
sort_column_node->getFillFrom() = buildExpression(order_by_element.fill_from);
|
|
|
|
if (order_by_element.fill_to)
|
|
|
|
sort_column_node->getFillTo() = buildExpression(order_by_element.fill_to);
|
|
|
|
if (order_by_element.fill_step)
|
|
|
|
sort_column_node->getFillStep() = buildExpression(order_by_element.fill_step);
|
|
|
|
|
|
|
|
list_node->getNodes().push_back(std::move(sort_column_node));
|
|
|
|
}
|
|
|
|
|
|
|
|
return list_node;
|
|
|
|
}
|
|
|
|
|
2022-09-03 16:20:09 +00:00
|
|
|
QueryTreeNodePtr QueryTreeBuilder::buildInterpolateColumnList(const ASTPtr & interpolate_expression_list) const
|
|
|
|
{
|
|
|
|
auto list_node = std::make_shared<ListNode>();
|
|
|
|
|
|
|
|
auto & expression_list_typed = interpolate_expression_list->as<ASTExpressionList &>();
|
|
|
|
list_node->getNodes().reserve(expression_list_typed.children.size());
|
|
|
|
|
|
|
|
for (auto & expression : expression_list_typed.children)
|
|
|
|
{
|
|
|
|
const auto & interpolate_element = expression->as<const ASTInterpolateElement &>();
|
|
|
|
auto expression_to_interpolate = std::make_shared<IdentifierNode>(Identifier(interpolate_element.column));
|
|
|
|
auto interpolate_expression = buildExpression(interpolate_element.expr);
|
|
|
|
auto interpolate_column_node = std::make_shared<InterpolateColumnNode>(std::move(expression_to_interpolate), std::move(interpolate_expression));
|
|
|
|
|
|
|
|
list_node->getNodes().push_back(std::move(interpolate_column_node));
|
|
|
|
}
|
|
|
|
|
|
|
|
return list_node;
|
|
|
|
}
|
|
|
|
|
2022-08-23 09:50:02 +00:00
|
|
|
QueryTreeNodePtr QueryTreeBuilder::buildExpressionList(const ASTPtr & expression_list) const
|
2022-07-14 11:20:16 +00:00
|
|
|
{
|
|
|
|
auto list_node = std::make_shared<ListNode>();
|
|
|
|
|
|
|
|
auto & expression_list_typed = expression_list->as<ASTExpressionList &>();
|
|
|
|
list_node->getNodes().reserve(expression_list_typed.children.size());
|
|
|
|
|
|
|
|
for (auto & expression : expression_list_typed.children)
|
|
|
|
{
|
2022-08-23 09:50:02 +00:00
|
|
|
auto expression_node = buildExpression(expression);
|
2022-07-14 11:20:16 +00:00
|
|
|
list_node->getNodes().push_back(std::move(expression_node));
|
|
|
|
}
|
|
|
|
|
|
|
|
return list_node;
|
|
|
|
}
|
|
|
|
|
2022-08-23 09:50:02 +00:00
|
|
|
QueryTreeNodePtr QueryTreeBuilder::buildExpression(const ASTPtr & expression) const
|
2022-07-14 11:20:16 +00:00
|
|
|
{
|
|
|
|
QueryTreeNodePtr result;
|
|
|
|
|
|
|
|
if (const auto * ast_identifier = expression->as<ASTIdentifier>())
|
|
|
|
{
|
|
|
|
/// TODO: Identifier as query parameter
|
|
|
|
auto identifier = Identifier(ast_identifier->name_parts);
|
|
|
|
result = std::make_shared<IdentifierNode>(std::move(identifier));
|
|
|
|
}
|
|
|
|
else if (const auto * asterisk = expression->as<ASTAsterisk>())
|
|
|
|
{
|
2022-08-23 09:50:02 +00:00
|
|
|
auto column_transformers = buildColumnTransformers(expression, 0 /*start_child_index*/);
|
2022-07-14 11:20:16 +00:00
|
|
|
result = std::make_shared<MatcherNode>(column_transformers);
|
|
|
|
}
|
|
|
|
else if (const auto * qualified_asterisk = expression->as<ASTQualifiedAsterisk>())
|
|
|
|
{
|
|
|
|
/// TODO: Identifier with UUID
|
|
|
|
/// TODO: Currently during query analysis stage we support qualified matchers with any identifier length
|
|
|
|
/// but ASTTableIdentifier can contain only 2 parts.
|
|
|
|
|
|
|
|
auto & qualified_identifier = qualified_asterisk->children.at(0)->as<ASTTableIdentifier &>();
|
2022-08-23 09:50:02 +00:00
|
|
|
auto column_transformers = buildColumnTransformers(expression, 1 /*start_child_index*/);
|
2022-07-14 11:20:16 +00:00
|
|
|
result = std::make_shared<MatcherNode>(Identifier(qualified_identifier.name_parts), column_transformers);
|
|
|
|
}
|
|
|
|
else if (const auto * ast_literal = expression->as<ASTLiteral>())
|
|
|
|
{
|
|
|
|
result = std::make_shared<ConstantNode>(ast_literal->value);
|
|
|
|
}
|
|
|
|
else if (const auto * function = expression->as<ASTFunction>())
|
|
|
|
{
|
|
|
|
if (function->is_lambda_function)
|
|
|
|
{
|
|
|
|
const auto & lambda_arguments_and_expression = function->arguments->as<ASTExpressionList &>().children;
|
|
|
|
auto & lambda_arguments_tuple = lambda_arguments_and_expression.at(0)->as<ASTFunction &>();
|
|
|
|
|
|
|
|
auto lambda_arguments_nodes = std::make_shared<ListNode>();
|
|
|
|
Names lambda_arguments;
|
|
|
|
NameSet lambda_arguments_set;
|
|
|
|
|
|
|
|
if (lambda_arguments_tuple.arguments)
|
|
|
|
{
|
|
|
|
const auto & lambda_arguments_list = lambda_arguments_tuple.arguments->as<ASTExpressionList>()->children;
|
|
|
|
for (const auto & lambda_argument : lambda_arguments_list)
|
|
|
|
{
|
|
|
|
const auto * lambda_argument_identifier = lambda_argument->as<ASTIdentifier>();
|
|
|
|
|
|
|
|
if (!lambda_argument_identifier)
|
|
|
|
throw Exception(ErrorCodes::LOGICAL_ERROR,
|
|
|
|
"Lambda {} argument is not identifier",
|
|
|
|
function->formatForErrorMessage());
|
|
|
|
|
|
|
|
if (lambda_argument_identifier->name_parts.size() > 1)
|
|
|
|
throw Exception(ErrorCodes::LOGICAL_ERROR,
|
|
|
|
"Lambda {} argument identifier must contain only argument name. Actual {}",
|
|
|
|
function->formatForErrorMessage(),
|
|
|
|
lambda_argument_identifier->full_name);
|
|
|
|
|
|
|
|
const auto & argument_name = lambda_argument_identifier->name_parts[0];
|
|
|
|
auto [_, inserted] = lambda_arguments_set.insert(argument_name);
|
|
|
|
if (!inserted)
|
|
|
|
throw Exception(ErrorCodes::LOGICAL_ERROR,
|
|
|
|
"Lambda {} multiple arguments with same name {}",
|
|
|
|
function->formatForErrorMessage(),
|
|
|
|
argument_name);
|
|
|
|
|
|
|
|
lambda_arguments.push_back(argument_name);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
const auto & lambda_expression = lambda_arguments_and_expression.at(1);
|
2022-08-23 09:50:02 +00:00
|
|
|
auto lambda_expression_node = buildExpression(lambda_expression);
|
2022-07-14 11:20:16 +00:00
|
|
|
|
|
|
|
result = std::make_shared<LambdaNode>(std::move(lambda_arguments), std::move(lambda_expression_node));
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
auto function_node = std::make_shared<FunctionNode>(function->name);
|
|
|
|
|
|
|
|
if (function->parameters)
|
|
|
|
{
|
|
|
|
const auto & function_parameters_list = function->parameters->as<ASTExpressionList>()->children;
|
|
|
|
for (const auto & argument : function_parameters_list)
|
2022-08-23 09:50:02 +00:00
|
|
|
function_node->getParameters().getNodes().push_back(buildExpression(argument));
|
2022-07-14 11:20:16 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
if (function->arguments)
|
|
|
|
{
|
|
|
|
const auto & function_arguments_list = function->arguments->as<ASTExpressionList>()->children;
|
|
|
|
for (const auto & argument : function_arguments_list)
|
2022-08-23 09:50:02 +00:00
|
|
|
function_node->getArguments().getNodes().push_back(buildExpression(argument));
|
2022-07-14 11:20:16 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
result = function_node;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
else if (const auto * subquery = expression->as<ASTSubquery>())
|
|
|
|
{
|
|
|
|
auto subquery_query = subquery->children[0];
|
2022-08-23 09:50:02 +00:00
|
|
|
auto query_node = buildSelectWithUnionExpression(subquery_query, true /*is_subquery*/, {} /*cte_name*/);
|
2022-07-18 17:20:28 +00:00
|
|
|
|
|
|
|
result = query_node;
|
|
|
|
}
|
|
|
|
else if (const auto * with_element = expression->as<ASTWithElement>())
|
|
|
|
{
|
|
|
|
auto with_element_subquery = with_element->subquery->as<ASTSubquery &>().children.at(0);
|
2022-08-23 09:50:02 +00:00
|
|
|
auto query_node = buildSelectWithUnionExpression(with_element_subquery, true /*is_subquery*/, with_element->name /*cte_name*/);
|
2022-07-18 17:20:28 +00:00
|
|
|
|
2022-07-14 11:20:16 +00:00
|
|
|
result = query_node;
|
|
|
|
}
|
|
|
|
else if (const auto * columns_regexp_matcher = expression->as<ASTColumnsRegexpMatcher>())
|
|
|
|
{
|
2022-08-23 09:50:02 +00:00
|
|
|
auto column_transformers = buildColumnTransformers(expression, 0 /*start_child_index*/);
|
2022-07-14 11:20:16 +00:00
|
|
|
result = std::make_shared<MatcherNode>(columns_regexp_matcher->getMatcher(), std::move(column_transformers));
|
|
|
|
}
|
|
|
|
else if (const auto * columns_list_matcher = expression->as<ASTColumnsListMatcher>())
|
|
|
|
{
|
|
|
|
Identifiers column_list_identifiers;
|
|
|
|
column_list_identifiers.reserve(columns_list_matcher->column_list->children.size());
|
|
|
|
|
|
|
|
for (auto & column_list_child : columns_list_matcher->column_list->children)
|
|
|
|
{
|
|
|
|
auto & column_list_identifier = column_list_child->as<ASTIdentifier &>();
|
|
|
|
column_list_identifiers.emplace_back(Identifier{column_list_identifier.name_parts});
|
|
|
|
}
|
|
|
|
|
2022-08-23 09:50:02 +00:00
|
|
|
auto column_transformers = buildColumnTransformers(expression, 0 /*start_child_index*/);
|
2022-07-14 11:20:16 +00:00
|
|
|
result = std::make_shared<MatcherNode>(std::move(column_list_identifiers), std::move(column_transformers));
|
|
|
|
}
|
|
|
|
else if (const auto * qualified_columns_regexp_matcher = expression->as<ASTQualifiedColumnsRegexpMatcher>())
|
|
|
|
{
|
|
|
|
auto & qualified_identifier = qualified_columns_regexp_matcher->children.at(0)->as<ASTTableIdentifier &>();
|
2022-08-23 09:50:02 +00:00
|
|
|
auto column_transformers = buildColumnTransformers(expression, 1 /*start_child_index*/);
|
2022-07-14 11:20:16 +00:00
|
|
|
result = std::make_shared<MatcherNode>(Identifier(qualified_identifier.name_parts), qualified_columns_regexp_matcher->getMatcher(), std::move(column_transformers));
|
|
|
|
}
|
|
|
|
else if (const auto * qualified_columns_list_matcher = expression->as<ASTQualifiedColumnsListMatcher>())
|
|
|
|
{
|
|
|
|
auto & qualified_identifier = qualified_columns_list_matcher->children.at(0)->as<ASTTableIdentifier &>();
|
|
|
|
|
|
|
|
Identifiers column_list_identifiers;
|
|
|
|
column_list_identifiers.reserve(qualified_columns_list_matcher->column_list->children.size());
|
|
|
|
|
|
|
|
for (auto & column_list_child : qualified_columns_list_matcher->column_list->children)
|
|
|
|
{
|
|
|
|
auto & column_list_identifier = column_list_child->as<ASTIdentifier &>();
|
|
|
|
column_list_identifiers.emplace_back(Identifier{column_list_identifier.name_parts});
|
|
|
|
}
|
|
|
|
|
2022-08-23 09:50:02 +00:00
|
|
|
auto column_transformers = buildColumnTransformers(expression, 1 /*start_child_index*/);
|
2022-07-14 11:20:16 +00:00
|
|
|
result = std::make_shared<MatcherNode>(Identifier(qualified_identifier.name_parts), column_list_identifiers, std::move(column_transformers));
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
2022-08-25 18:35:16 +00:00
|
|
|
throw Exception(ErrorCodes::UNSUPPORTED_METHOD,
|
|
|
|
"Invalid expression. Expected identifier, literal, matcher, function, subquery. Actual {}",
|
|
|
|
expression->formatForErrorMessage());
|
2022-07-14 11:20:16 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
result->setAlias(expression->tryGetAlias());
|
|
|
|
result->setOriginalAST(expression);
|
|
|
|
|
|
|
|
return result;
|
|
|
|
}
|
|
|
|
|
2022-08-23 09:50:02 +00:00
|
|
|
QueryTreeNodePtr QueryTreeBuilder::buildJoinTree(const ASTPtr & tables_in_select_query) const
|
2022-07-14 11:20:16 +00:00
|
|
|
{
|
|
|
|
if (!tables_in_select_query)
|
|
|
|
{
|
|
|
|
/** If no table is specified in SELECT query we substitude system.one table.
|
|
|
|
* SELECT * FROM system.one;
|
|
|
|
*/
|
|
|
|
Identifier storage_identifier("system.one");
|
2022-07-18 17:20:28 +00:00
|
|
|
return std::make_shared<IdentifierNode>(storage_identifier);
|
2022-07-14 11:20:16 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
auto & tables = tables_in_select_query->as<ASTTablesInSelectQuery &>();
|
2022-08-15 16:34:10 +00:00
|
|
|
|
|
|
|
QueryTreeNodes table_expressions;
|
2022-07-14 11:20:16 +00:00
|
|
|
|
|
|
|
for (const auto & table_element_untyped : tables.children)
|
|
|
|
{
|
|
|
|
const auto & table_element = table_element_untyped->as<ASTTablesInSelectQueryElement &>();
|
|
|
|
|
|
|
|
if (table_element.table_expression)
|
|
|
|
{
|
2022-07-18 17:20:28 +00:00
|
|
|
auto & table_expression = table_element.table_expression->as<ASTTableExpression &>();
|
2022-09-04 15:20:59 +00:00
|
|
|
std::optional<TableExpressionModifiers> table_expression_modifiers;
|
|
|
|
|
|
|
|
if (table_expression.final || table_expression.sample_size)
|
|
|
|
{
|
|
|
|
bool has_final = table_expression.final;
|
|
|
|
std::optional<TableExpressionModifiers::Rational> sample_size_ratio;
|
|
|
|
std::optional<TableExpressionModifiers::Rational> sample_offset_ratio;
|
|
|
|
|
|
|
|
if (table_expression.sample_size)
|
|
|
|
{
|
|
|
|
auto & ast_sample_size_ratio = table_expression.sample_size->as<ASTSampleRatio &>();
|
|
|
|
sample_size_ratio = ast_sample_size_ratio.ratio;
|
|
|
|
|
|
|
|
if (table_expression.sample_offset)
|
|
|
|
{
|
|
|
|
auto & ast_sample_offset_ratio = table_expression.sample_offset->as<ASTSampleRatio &>();
|
|
|
|
sample_offset_ratio = ast_sample_offset_ratio.ratio;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
table_expression_modifiers = TableExpressionModifiers(has_final, sample_size_ratio, sample_offset_ratio);
|
|
|
|
}
|
2022-07-14 11:20:16 +00:00
|
|
|
|
2022-07-18 17:20:28 +00:00
|
|
|
if (table_expression.database_and_table_name)
|
2022-07-14 11:20:16 +00:00
|
|
|
{
|
2022-07-18 17:20:28 +00:00
|
|
|
auto & table_identifier_typed = table_expression.database_and_table_name->as<ASTTableIdentifier &>();
|
2022-07-14 11:20:16 +00:00
|
|
|
auto storage_identifier = Identifier(table_identifier_typed.name_parts);
|
2022-09-04 15:20:59 +00:00
|
|
|
QueryTreeNodePtr table_identifier_node;
|
2022-07-14 11:20:16 +00:00
|
|
|
|
2022-09-04 15:20:59 +00:00
|
|
|
if (table_expression_modifiers)
|
|
|
|
table_identifier_node = std::make_shared<IdentifierNode>(storage_identifier, *table_expression_modifiers);
|
|
|
|
else
|
|
|
|
table_identifier_node = std::make_shared<IdentifierNode>(storage_identifier);
|
2022-07-14 11:20:16 +00:00
|
|
|
|
2022-09-04 15:20:59 +00:00
|
|
|
table_identifier_node->setAlias(table_identifier_typed.tryGetAlias());
|
|
|
|
table_identifier_node->setOriginalAST(table_element.table_expression);
|
|
|
|
|
|
|
|
table_expressions.push_back(std::move(table_identifier_node));
|
2022-07-14 11:20:16 +00:00
|
|
|
}
|
2022-07-18 17:20:28 +00:00
|
|
|
else if (table_expression.subquery)
|
|
|
|
{
|
|
|
|
auto & subquery_expression = table_expression.subquery->as<ASTSubquery &>();
|
|
|
|
const auto & select_with_union_query = subquery_expression.children[0];
|
2022-07-14 11:20:16 +00:00
|
|
|
|
2022-08-23 09:50:02 +00:00
|
|
|
auto node = buildSelectWithUnionExpression(select_with_union_query, true /*is_subquery*/, {} /*cte_name*/);
|
2022-07-18 17:20:28 +00:00
|
|
|
node->setAlias(subquery_expression.tryGetAlias());
|
|
|
|
node->setOriginalAST(select_with_union_query);
|
|
|
|
|
2022-09-04 15:20:59 +00:00
|
|
|
if (table_expression_modifiers)
|
|
|
|
{
|
|
|
|
if (auto * query_node = node->as<QueryNode>())
|
|
|
|
query_node->setTableExpressionModifiers(*table_expression_modifiers);
|
|
|
|
else if (auto * union_node = node->as<UnionNode>())
|
|
|
|
union_node->setTableExpressionModifiers(*table_expression_modifiers);
|
|
|
|
else
|
|
|
|
throw Exception(ErrorCodes::LOGICAL_ERROR,
|
|
|
|
"Unexpected table expression subquery node. Expected union or query. Actual {}",
|
|
|
|
node->formatASTForErrorMessage());
|
|
|
|
}
|
|
|
|
|
2022-08-15 16:34:10 +00:00
|
|
|
table_expressions.push_back(std::move(node));
|
2022-07-18 17:20:28 +00:00
|
|
|
}
|
2022-07-20 15:25:24 +00:00
|
|
|
else if (table_expression.table_function)
|
2022-07-14 11:20:16 +00:00
|
|
|
{
|
2022-07-20 15:25:24 +00:00
|
|
|
auto & table_function_expression = table_expression.table_function->as<ASTFunction &>();
|
|
|
|
|
|
|
|
auto node = std::make_shared<TableFunctionNode>(table_function_expression.name);
|
|
|
|
|
|
|
|
if (table_function_expression.arguments)
|
|
|
|
{
|
|
|
|
const auto & function_arguments_list = table_function_expression.arguments->as<ASTExpressionList>()->children;
|
|
|
|
for (const auto & argument : function_arguments_list)
|
2022-08-25 18:35:16 +00:00
|
|
|
{
|
|
|
|
if (argument->as<ASTSelectQuery>() || argument->as<ASTSelectWithUnionQuery>() || argument->as<ASTSelectIntersectExceptQuery>())
|
2022-08-26 13:06:14 +00:00
|
|
|
node->getArguments().getNodes().push_back(buildSelectOrUnionExpression(argument, false /*is_subquery*/, {} /*cte_name*/));
|
2022-08-25 18:35:16 +00:00
|
|
|
else
|
|
|
|
node->getArguments().getNodes().push_back(buildExpression(argument));
|
|
|
|
}
|
2022-07-20 15:25:24 +00:00
|
|
|
}
|
|
|
|
|
2022-09-04 15:20:59 +00:00
|
|
|
if (table_expression_modifiers)
|
|
|
|
node->setTableExpressionModifiers(*table_expression_modifiers);
|
2022-07-20 15:25:24 +00:00
|
|
|
node->setAlias(table_function_expression.tryGetAlias());
|
|
|
|
node->setOriginalAST(table_expression.table_function);
|
|
|
|
|
2022-08-15 16:34:10 +00:00
|
|
|
table_expressions.push_back(std::move(node));
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
throw Exception(ErrorCodes::UNSUPPORTED_METHOD, "Unsupported table expression node {}", table_element.table_expression->formatForErrorMessage());
|
2022-07-14 11:20:16 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2022-08-15 16:34:10 +00:00
|
|
|
if (table_element.table_join)
|
|
|
|
{
|
|
|
|
const auto & table_join = table_element.table_join->as<ASTTableJoin &>();
|
2022-07-14 11:20:16 +00:00
|
|
|
|
2022-08-15 16:34:10 +00:00
|
|
|
auto right_table_expression = std::move(table_expressions.back());
|
|
|
|
table_expressions.pop_back();
|
2022-07-14 11:20:16 +00:00
|
|
|
|
2022-08-15 16:34:10 +00:00
|
|
|
auto left_table_expression = std::move(table_expressions.back());
|
|
|
|
table_expressions.pop_back();
|
2022-07-14 11:20:16 +00:00
|
|
|
|
2022-08-15 16:34:10 +00:00
|
|
|
QueryTreeNodePtr join_expression;
|
2022-07-14 11:20:16 +00:00
|
|
|
|
2022-08-15 16:34:10 +00:00
|
|
|
if (table_join.using_expression_list)
|
2022-08-23 09:50:02 +00:00
|
|
|
join_expression = buildExpressionList(table_join.using_expression_list);
|
2022-08-15 16:34:10 +00:00
|
|
|
else if (table_join.on_expression)
|
2022-08-23 09:50:02 +00:00
|
|
|
join_expression = buildExpression(table_join.on_expression);
|
2022-07-14 11:20:16 +00:00
|
|
|
|
2022-08-15 16:34:10 +00:00
|
|
|
auto join_node = std::make_shared<JoinNode>(std::move(left_table_expression),
|
|
|
|
std::move(right_table_expression),
|
|
|
|
std::move(join_expression),
|
|
|
|
table_join.locality,
|
|
|
|
table_join.strictness,
|
|
|
|
table_join.kind);
|
2022-07-14 11:20:16 +00:00
|
|
|
|
2022-08-15 16:34:10 +00:00
|
|
|
/** Original AST is not set because it will contain only join part and does
|
|
|
|
* not include left table expression.
|
|
|
|
*/
|
|
|
|
table_expressions.emplace_back(std::move(join_node));
|
|
|
|
}
|
2022-07-14 11:20:16 +00:00
|
|
|
|
2022-08-15 16:34:10 +00:00
|
|
|
if (table_element.array_join)
|
|
|
|
{
|
|
|
|
auto & array_join_expression = table_element.array_join->as<ASTArrayJoin &>();
|
|
|
|
bool is_left_array_join = array_join_expression.kind == ASTArrayJoin::Kind::Left;
|
2022-07-14 11:20:16 +00:00
|
|
|
|
2022-08-15 16:34:10 +00:00
|
|
|
auto last_table_expression = std::move(table_expressions.back());
|
|
|
|
table_expressions.pop_back();
|
2022-07-14 11:20:16 +00:00
|
|
|
|
2022-08-23 09:50:02 +00:00
|
|
|
auto array_join_expressions_list = buildExpressionList(array_join_expression.expression_list);
|
2022-08-15 16:34:10 +00:00
|
|
|
auto array_join_node = std::make_shared<ArrayJoinNode>(std::move(last_table_expression), std::move(array_join_expressions_list), is_left_array_join);
|
|
|
|
|
2022-08-21 11:46:07 +00:00
|
|
|
/** Original AST is not set because it will contain only array join part and does
|
|
|
|
* not include left table expression.
|
|
|
|
*/
|
2022-08-15 16:34:10 +00:00
|
|
|
table_expressions.push_back(std::move(array_join_node));
|
|
|
|
}
|
2022-07-14 11:20:16 +00:00
|
|
|
}
|
|
|
|
|
2022-08-15 16:34:10 +00:00
|
|
|
if (table_expressions.empty())
|
|
|
|
throw Exception(ErrorCodes::LOGICAL_ERROR, "Query FROM section cannot be empty");
|
|
|
|
|
|
|
|
if (table_expressions.size() > 1)
|
|
|
|
throw Exception(ErrorCodes::LOGICAL_ERROR, "Query FROM section cannot have more than 1 root table expression");
|
2022-07-14 11:20:16 +00:00
|
|
|
|
2022-08-15 16:34:10 +00:00
|
|
|
return table_expressions.back();
|
2022-07-14 11:20:16 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2022-08-23 09:50:02 +00:00
|
|
|
ColumnTransformersNodes QueryTreeBuilder::buildColumnTransformers(const ASTPtr & matcher_expression, size_t start_child_index) const
|
2022-07-14 11:20:16 +00:00
|
|
|
{
|
|
|
|
ColumnTransformersNodes column_transformers;
|
|
|
|
size_t children_size = matcher_expression->children.size();
|
|
|
|
|
|
|
|
for (; start_child_index < children_size; ++start_child_index)
|
|
|
|
{
|
|
|
|
const auto & child = matcher_expression->children[start_child_index];
|
|
|
|
|
|
|
|
if (auto * apply_transformer = child->as<ASTColumnsApplyTransformer>())
|
|
|
|
{
|
|
|
|
if (apply_transformer->lambda)
|
|
|
|
{
|
2022-08-23 09:50:02 +00:00
|
|
|
auto lambda_query_tree_node = buildExpression(apply_transformer->lambda);
|
2022-07-14 11:20:16 +00:00
|
|
|
column_transformers.emplace_back(std::make_shared<ApplyColumnTransformerNode>(std::move(lambda_query_tree_node)));
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
auto function_node = std::make_shared<FunctionNode>(apply_transformer->func_name);
|
|
|
|
if (apply_transformer->parameters)
|
2022-08-23 09:50:02 +00:00
|
|
|
function_node->getParametersNode() = buildExpressionList(apply_transformer->parameters);
|
2022-07-14 11:20:16 +00:00
|
|
|
|
|
|
|
column_transformers.emplace_back(std::make_shared<ApplyColumnTransformerNode>(std::move(function_node)));
|
|
|
|
}
|
|
|
|
}
|
|
|
|
else if (auto * except_transformer = child->as<ASTColumnsExceptTransformer>())
|
|
|
|
{
|
|
|
|
auto matcher = except_transformer->getMatcher();
|
|
|
|
if (matcher)
|
|
|
|
{
|
|
|
|
column_transformers.emplace_back(std::make_shared<ExceptColumnTransformerNode>(std::move(matcher)));
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
Names except_column_names;
|
|
|
|
except_column_names.reserve(except_transformer->children.size());
|
|
|
|
|
|
|
|
for (auto & except_transformer_child : except_transformer->children)
|
|
|
|
except_column_names.push_back(except_transformer_child->as<ASTIdentifier &>().full_name);
|
|
|
|
|
2022-07-14 16:02:47 +00:00
|
|
|
column_transformers.emplace_back(std::make_shared<ExceptColumnTransformerNode>(std::move(except_column_names), except_transformer->is_strict));
|
2022-07-14 11:20:16 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
else if (auto * replace_transformer = child->as<ASTColumnsReplaceTransformer>())
|
|
|
|
{
|
|
|
|
std::vector<ReplaceColumnTransformerNode::Replacement> replacements;
|
|
|
|
replacements.reserve(replace_transformer->children.size());
|
|
|
|
|
|
|
|
for (const auto & replace_transformer_child : replace_transformer->children)
|
|
|
|
{
|
|
|
|
auto & replacement = replace_transformer_child->as<ASTColumnsReplaceTransformer::Replacement &>();
|
2022-08-23 09:50:02 +00:00
|
|
|
replacements.emplace_back(ReplaceColumnTransformerNode::Replacement{replacement.name, buildExpression(replacement.expr)});
|
2022-07-14 11:20:16 +00:00
|
|
|
}
|
|
|
|
|
2022-07-14 16:02:47 +00:00
|
|
|
column_transformers.emplace_back(std::make_shared<ReplaceColumnTransformerNode>(replacements, replace_transformer->is_strict));
|
2022-07-14 11:20:16 +00:00
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
throw Exception(ErrorCodes::UNSUPPORTED_METHOD, "Unsupported column matcher {}", child->formatForErrorMessage());
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return column_transformers;
|
|
|
|
}
|
|
|
|
|
2022-08-23 09:50:02 +00:00
|
|
|
}
|
|
|
|
|
2022-07-14 11:20:16 +00:00
|
|
|
QueryTreeNodePtr buildQueryTree(ASTPtr query, ContextPtr context)
|
|
|
|
{
|
|
|
|
QueryTreeBuilder builder(query, context);
|
|
|
|
return builder.getQueryTreeNode();
|
|
|
|
}
|
|
|
|
|
|
|
|
}
|