@Override public LogicalNode visitLimit(LogicalPlanner.PlanContext ctx, Stack<Expr> stack, Limit expr) throws TajoException { stack.push(expr); LogicalNode child = visit(ctx, stack, expr.getChild()); stack.pop(); LimitNode limitNode = ctx.getPlan().createNode(LimitNode.class); limitNode.setInSchema(child.getOutSchema()); limitNode.setOutSchema(child.getOutSchema()); return limitNode; }
public LogicalNode visitLimit(Context context, LogicalPlan plan, LogicalPlan.QueryBlock block, LimitNode node, Stack<LogicalNode> stack) throws TajoException { LogicalNode child = super.visitLimit(context, plan, block, node, stack); node.setInSchema(child.getOutSchema()); node.setOutSchema(child.getOutSchema()); return node; }
@Override public LogicalNode visitLimit(LogicalPlanner.PlanContext ctx, Stack<Expr> stack, Limit expr) throws TajoException { stack.push(expr); LogicalNode child = visit(ctx, stack, expr.getChild()); stack.pop(); LimitNode limitNode = ctx.getPlan().createNode(LimitNode.class); limitNode.setInSchema(child.getOutSchema()); limitNode.setOutSchema(child.getOutSchema()); return limitNode; }
public LogicalNode visitLimit(Context context, LogicalPlan plan, LogicalPlan.QueryBlock block, LimitNode node, Stack<LogicalNode> stack) throws TajoException { LogicalNode child = super.visitLimit(context, plan, block, node, stack); node.setInSchema(child.getOutSchema()); node.setOutSchema(child.getOutSchema()); return node; }
private static LimitNode convertLimit(Map<Integer, LogicalNode> nodeMap, PlanProto.LogicalNode protoNode) { PlanProto.LimitNode limitProto = protoNode.getLimit(); LimitNode limitNode = new LimitNode(protoNode.getNodeId()); limitNode.setChild(nodeMap.get(limitProto.getChildSeq())); limitNode.setInSchema(convertSchema(protoNode.getInSchema())); limitNode.setOutSchema(convertSchema(protoNode.getOutSchema())); limitNode.setFetchFirst(limitProto.getFetchFirstNum()); return limitNode; }
private static LimitNode convertLimit(Map<Integer, LogicalNode> nodeMap, PlanProto.LogicalNode protoNode) { PlanProto.LimitNode limitProto = protoNode.getLimit(); LimitNode limitNode = new LimitNode(protoNode.getNodeId()); limitNode.setChild(nodeMap.get(limitProto.getChildSeq())); limitNode.setInSchema(convertSchema(protoNode.getInSchema())); limitNode.setOutSchema(convertSchema(protoNode.getOutSchema())); limitNode.setFetchFirst(limitProto.getFetchFirstNum()); return limitNode; }
@Override public LogicalNode visitLimit(ProcessorContext ctx, Stack<Expr> stack, Limit expr) throws TajoException { super.visitLimit(ctx, stack, expr); LimitNode node = getNodeFromExpr(ctx.planContext.getPlan(), expr); LogicalNode child = getNonRelationListExpr(ctx.planContext.getPlan(), expr.getChild()); node.setInSchema(child.getOutSchema()); node.setOutSchema(node.getInSchema()); return node; }
@Override public LogicalNode visitLimit(ProcessorContext ctx, Stack<Expr> stack, Limit expr) throws TajoException { super.visitLimit(ctx, stack, expr); LimitNode node = getNodeFromExpr(ctx.planContext.getPlan(), expr); LogicalNode child = getNonRelationListExpr(ctx.planContext.getPlan(), expr.getChild()); node.setInSchema(child.getOutSchema()); node.setOutSchema(node.getInSchema()); return node; }
LimitNode limitNode = (LimitNode) child; limitNode.setInSchema(windowAggNode.getOutSchema()); limitNode.setOutSchema(windowAggNode.getOutSchema()); return null; } else if (child.getType() == NodeType.SORT) {
LimitNode limitNode = (LimitNode) child; limitNode.setInSchema(windowAggNode.getOutSchema()); limitNode.setOutSchema(windowAggNode.getOutSchema()); return null; } else if (child.getType() == NodeType.SORT) {
limitNode.setChild(child); limitNode.setInSchema(child.getOutSchema()); limitNode.setOutSchema(child.getOutSchema());
limitNode.setChild(child); limitNode.setInSchema(child.getOutSchema()); limitNode.setOutSchema(child.getOutSchema());