public RelNode visit(RelNode other) { return visitChildren(other); } }
public RelNode visit(LogicalUnion union) { return visitChildren(union); }
public RelNode visit(LogicalJoin join) { return visitChildren(join); }
public RelNode visit(LogicalJoin join) { return visitChildren(join); }
public RelNode visit(LogicalSort sort) { return visitChildren(sort); }
public RelNode visit(RelNode other) { return visitChildren(other); } }
public RelNode visit(TableFunctionScan scan) { return visitChildren(scan); }
public RelNode visit(LogicalIntersect intersect) { return visitChildren(intersect); }
public RelNode visit(LogicalMinus minus) { return visitChildren(minus); }
public RelNode visit(LogicalExchange exchange) { return visitChildren(exchange); }
public RelNode visit(LogicalCorrelate correlate) { return visitChildren(correlate); }
public RelNode visit(LogicalSort sort) { return visitChildren(sort); }
public RelNode visit(LogicalCorrelate correlate) { return visitChildren(correlate); }
public RelNode visit(LogicalUnion union) { return visitChildren(union); }
public RelNode visit(LogicalIntersect intersect) { return visitChildren(intersect); }
public RelNode visit(TableFunctionScan scan) { return visitChildren(scan); }
public RelNode visit(LogicalMinus minus) { return visitChildren(minus); }
public RelNode visit(LogicalExchange exchange) { return visitChildren(exchange); }