| 14 | } |
| 15 | |
| 16 | std::shared_ptr<LogicalOperator> TopKOptimizer::visitOperator( |
| 17 | const std::shared_ptr<LogicalOperator>& op) { |
| 18 | // bottom-up traversal |
| 19 | for (auto i = 0u; i < op->getNumChildren(); ++i) { |
| 20 | op->setChild(i, visitOperator(op->getChild(i))); |
| 21 | } |
| 22 | auto result = visitOperatorReplaceSwitch(op); |
| 23 | result->computeFlatSchema(); |
| 24 | return result; |
| 25 | } |
| 26 | |
| 27 | // TODO(Xiyang): we should probably remove the projection between ORDER BY and MULTIPLICITY REDUCER |
| 28 | // We search for pattern |
no test coverage detected