| 43 | } |
| 44 | |
| 45 | void SortNode::dumpTreeImpl(WriteBuffer & buffer, FormatState & format_state, size_t indent) const |
| 46 | { |
| 47 | buffer << std::string(indent, ' ') << "SORT id: " << format_state.getNodeId(this); |
| 48 | |
| 49 | buffer << ", sort_direction: " << toString(sort_direction); |
| 50 | if (nulls_sort_direction) |
| 51 | buffer << ", nulls_sort_direction: " << toString(*nulls_sort_direction); |
| 52 | |
| 53 | if (collator) |
| 54 | buffer << ", collator: " << collator->getLocale(); |
| 55 | |
| 56 | buffer << ", with_fill: " << with_fill; |
| 57 | |
| 58 | buffer << '\n' << std::string(indent + 2, ' ') << "EXPRESSION"; |
| 59 | if (!column_name.empty()) |
| 60 | buffer << " " << column_name; |
| 61 | buffer << "\n"; |
| 62 | getExpression()->dumpTreeImpl(buffer, format_state, indent + 4); |
| 63 | |
| 64 | if (hasFillFrom()) |
| 65 | { |
| 66 | buffer << '\n' << std::string(indent + 2, ' ') << "FILL FROM\n"; |
| 67 | getFillFrom()->dumpTreeImpl(buffer, format_state, indent + 4); |
| 68 | } |
| 69 | |
| 70 | if (hasFillTo()) |
| 71 | { |
| 72 | buffer << '\n' << std::string(indent + 2, ' ') << "FILL TO\n"; |
| 73 | getFillTo()->dumpTreeImpl(buffer, format_state, indent + 4); |
| 74 | } |
| 75 | |
| 76 | if (hasFillStep()) |
| 77 | { |
| 78 | buffer << '\n' << std::string(indent + 2, ' ') << "FILL STEP\n"; |
| 79 | getFillStep()->dumpTreeImpl(buffer, format_state, indent + 4); |
| 80 | } |
| 81 | |
| 82 | if (hasFillStaleness()) |
| 83 | { |
| 84 | buffer << '\n' << std::string(indent + 2, ' ') << "FILL STALENESS\n"; |
| 85 | getFillStaleness()->dumpTreeImpl(buffer, format_state, indent + 4); |
| 86 | } |
| 87 | } |
| 88 | |
| 89 | bool SortNode::isEqualImpl(const IQueryTreeNode & rhs, CompareOptions) const |
| 90 | { |
nothing calls this directly
no test coverage detected