for (int i = 0; i < oldInputs.size(); i++) { RelNode oldInput = oldInputs.get(i); RelNode input = visit(oldInput, i, p); inputs.add(input);
for (int i = 0; i < oldInputs.size(); i++) { RelNode oldInput = oldInputs.get(i); RelNode input = visit(oldInput, i, p); inputs.add(input);
/** * Recursively builds a tree consisting of the cheapest plan at each node. */ RelNode buildCheapestPlan(VolcanoPlanner planner) { CheapestPlanReplacer replacer = new CheapestPlanReplacer(planner); final RelNode cheapest = replacer.visit(this, -1, null); if (planner.listener != null) { RelOptListener.RelChosenEvent event = new RelOptListener.RelChosenEvent( planner, null); planner.listener.relChosen(event); } return cheapest; }
/** * Recursively builds a tree consisting of the cheapest plan at each node. */ RelNode buildCheapestPlan(VolcanoPlanner planner) { CheapestPlanReplacer replacer = new CheapestPlanReplacer(planner); final RelNode cheapest = replacer.visit(this, -1, null); if (planner.listener != null) { RelOptListener.RelChosenEvent event = new RelOptListener.RelChosenEvent( planner, null); planner.listener.relChosen(event); } return cheapest; }