mirror of
https://github.com/ClickHouse/ClickHouse.git
synced 2024-12-12 17:32:32 +00:00
58 lines
1.7 KiB
C++
58 lines
1.7 KiB
C++
#include <Analyzer/InterpolateNode.h>
|
|
|
|
#include <Common/SipHash.h>
|
|
|
|
#include <IO/WriteBufferFromString.h>
|
|
#include <IO/Operators.h>
|
|
|
|
#include <Parsers/ASTInterpolateElement.h>
|
|
|
|
namespace DB
|
|
{
|
|
|
|
InterpolateNode::InterpolateNode(QueryTreeNodePtr expression_, QueryTreeNodePtr interpolate_expression_)
|
|
: IQueryTreeNode(children_size)
|
|
{
|
|
children[expression_child_index] = std::move(expression_);
|
|
children[interpolate_expression_child_index] = std::move(interpolate_expression_);
|
|
}
|
|
|
|
void InterpolateNode::dumpTreeImpl(WriteBuffer & buffer, FormatState & format_state, size_t indent) const
|
|
{
|
|
buffer << std::string(indent, ' ') << "INTERPOLATE id: " << format_state.getNodeId(this);
|
|
|
|
buffer << '\n' << std::string(indent + 2, ' ') << "EXPRESSION\n";
|
|
getExpression()->dumpTreeImpl(buffer, format_state, indent + 4);
|
|
|
|
buffer << '\n' << std::string(indent + 2, ' ') << "INTERPOLATE_EXPRESSION\n";
|
|
getInterpolateExpression()->dumpTreeImpl(buffer, format_state, indent + 4);
|
|
}
|
|
|
|
bool InterpolateNode::isEqualImpl(const IQueryTreeNode &) const
|
|
{
|
|
/// No state in interpolate node
|
|
return true;
|
|
}
|
|
|
|
void InterpolateNode::updateTreeHashImpl(HashState &) const
|
|
{
|
|
/// No state in interpolate node
|
|
}
|
|
|
|
QueryTreeNodePtr InterpolateNode::cloneImpl() const
|
|
{
|
|
return std::make_shared<InterpolateNode>(nullptr /*expression*/, nullptr /*interpolate_expression*/);
|
|
}
|
|
|
|
ASTPtr InterpolateNode::toASTImpl() const
|
|
{
|
|
auto result = std::make_shared<ASTInterpolateElement>();
|
|
result->column = getExpression()->toAST()->getColumnName();
|
|
result->children.push_back(getInterpolateExpression()->toAST());
|
|
result->expr = result->children.back();
|
|
|
|
return result;
|
|
}
|
|
|
|
}
|