thevar1able/ClickHouse
1
0
Fork 0
mirror of https://github.com/ClickHouse/ClickHouse.git synced 2024-11-27 10:02:01 +00:00
Code Issues Packages Projects Releases Wiki Activity

dbms: Server: feature development [#METR-14875]

Browse Source
This commit is contained in:
Alexey Arno 2015-02-18 15:11:16 +03:00
parent f6745b2972
commit 2920b7dbe5
1 changed files with 26 additions and 26 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

52
dbms/src/Interpreters/LogicalExpressionsOptimizer.cpp
View File

@ -47,7 +47,7 @@ void LogicalExpressionsOptimizer::optimizeDisjunctiveEqualityChains()
for (const auto & chain : disjunctive_equalities_map) for (const auto & chain : disjunctive_equalities_map)
{ {
const Equalities & equalities = chain.second; const auto & equalities = chain.second;
if (!mustTransform(equalities)) if (!mustTransform(equalities))
continue; continue;
@ -62,8 +62,8 @@ void LogicalExpressionsOptimizer::optimizeDisjunctiveEqualityChains()
void LogicalExpressionsOptimizer::collectDisjunctiveEqualityChains() void LogicalExpressionsOptimizer::collectDisjunctiveEqualityChains()
{ {
using Edge = std::pair<ASTPtr, ASTPtr>; using Edge = std::pair<ASTPtr, ASTPtr>;
std::deque<Edge> to_visit; std::deque<Edge> to_visit;
to_visit.push_back(Edge(ASTPtr(), root)); to_visit.push_back(Edge(ASTPtr(), root));
while (!to_visit.empty()) while (!to_visit.empty())
@ -76,28 +76,28 @@ void LogicalExpressionsOptimizer::collectDisjunctiveEqualityChains()
bool found = false; bool found = false;
ASTFunction * function = typeid_cast<ASTFunction *>(&*to_node); auto function = typeid_cast<ASTFunction *>(&*to_node);
if ((function != nullptr) && (function->name == "or") && (function->children.size() == 1)) if ((function != nullptr) && (function->name == "or") && (function->children.size() == 1))
{ {
if (!from_node.isNull()) if (!from_node.isNull())
parent_map[function].push_back(from_node.get()); parent_map[function].push_back(from_node.get());
ASTExpressionList * expression_list = typeid_cast<ASTExpressionList *>(&*(function->children[0])); auto expression_list = typeid_cast<ASTExpressionList *>(&*(function->children[0]));
if (expression_list != nullptr) if (expression_list != nullptr)
{ {
/// Цепочка элементов выражения OR. /// Цепочка элементов выражения OR.
for (auto child : expression_list->children) for (auto child : expression_list->children)
{ {
ASTFunction * equals = typeid_cast<ASTFunction *>(&*child); auto equals = typeid_cast<ASTFunction *>(&*child);
if ((equals != nullptr) && (equals->name == "equals") && (equals->children.size() == 1)) if ((equals != nullptr) && (equals->name == "equals") && (equals->children.size() == 1))
{ {
ASTExpressionList * equals_expression_list = typeid_cast<ASTExpressionList *>(&*(equals->children[0])); auto equals_expression_list = typeid_cast<ASTExpressionList *>(&*(equals->children[0]));
if ((equals_expression_list != nullptr) && (equals_expression_list->children.size() == 2)) if ((equals_expression_list != nullptr) && (equals_expression_list->children.size() == 2))
{ {
// Равенство c = xk // Равенство c = xk
auto expr_lhs = queryToString(equals_expression_list->children[0]); auto expr_lhs = queryToString(equals_expression_list->children[0]);
ASTLiteral * literal = typeid_cast<ASTLiteral *>(&*(equals_expression_list->children[1])); auto literal = typeid_cast<ASTLiteral *>(&*(equals_expression_list->children[1]));
if (literal != nullptr) if (literal != nullptr)
{ {
LogicalOrWithLeftHandSide logical_or_with_lhs(function, expr_lhs); LogicalOrWithLeftHandSide logical_or_with_lhs(function, expr_lhs);
@ -116,9 +116,9 @@ void LogicalExpressionsOptimizer::collectDisjunctiveEqualityChains()
to_visit.push_back(Edge(to_node, child)); to_visit.push_back(Edge(to_node, child));
} }
for (auto & e : disjunctive_equalities_map) for (auto & chain : disjunctive_equalities_map)
{ {
Equalities & equalities = e.second; auto & equalities = chain.second;
std::sort(equalities.begin(), equalities.end()); std::sort(equalities.begin(), equalities.end());
} }
} }
@ -176,36 +176,36 @@ LogicalExpressionsOptimizer::ASTFunctionPtr LogicalExpressionsOptimizer::createI
void LogicalExpressionsOptimizer::putInExpression(const DisjunctiveEqualityChain & chain, ASTFunctionPtr in_expression) void LogicalExpressionsOptimizer::putInExpression(const DisjunctiveEqualityChain & chain, ASTFunctionPtr in_expression)
{ {
const LogicalOrWithLeftHandSide & logical_or_with_lhs = chain.first; const auto & logical_or_with_lhs = chain.first;
const Equalities & equalities = chain.second; const auto & equalities = chain.second;
ASTFunction * or_function = logical_or_with_lhs.or_function; auto or_function = logical_or_with_lhs.or_function;
ASTExpressionList * expression_list = static_cast<ASTExpressionList *>(&*(or_function->children[0])); auto expression_list = static_cast<ASTExpressionList *>(&*(or_function->children[0]));
auto & children = expression_list->children; auto & children = expression_list->children;
children.push_back(in_expression); children.push_back(in_expression);
auto it = std::remove_if(children.begin(), children.end(), [&](const ASTPtr & node) auto it = std::remove_if(children.begin(), children.end(), [&](const ASTPtr & node)
{ {
return std::binary_search(equalities.begin(), equalities.end(), node.get()); return std::binary_search(equalities.begin(), equalities.end(), node.get());
}); });
children.erase(it, children.end()); children.erase(it, children.end());
} }
void LogicalExpressionsOptimizer::fixBrokenOrExpressions() void LogicalExpressionsOptimizer::fixBrokenOrExpressions()
{ {
for (const auto & e : disjunctive_equalities_map) for (const auto & chain : disjunctive_equalities_map)
{ {
const LogicalOrWithLeftHandSide & logical_or_with_lhs = e.first; const auto & logical_or_with_lhs = chain.first;
const Equalities & equalities = e.second; const auto & equalities = chain.second;
ASTFunction * or_function = logical_or_with_lhs.or_function; auto or_function = logical_or_with_lhs.or_function;
ASTExpressionList * expression_list = static_cast<ASTExpressionList *>(&*(or_function->children[0])); auto expression_list = static_cast<ASTExpressionList *>(&*(or_function->children[0]));
auto & children = expression_list->children; auto & children = expression_list->children;
if (children.size() == 1) if (children.size() == 1)
{ {
IASTs & parents = parent_map[or_function]; auto & parents = parent_map[or_function];
for (auto & parent : parents) for (auto & parent : parents)
{ {
parent->children.push_back(children[0]); parent->children.push_back(children[0]);