Examples of org.apache.pig.impl.plan.DependencyOrderWalker

org.apache.pig.impl.plan.DependencyOrderWalker
DependencyOrderWalker traverses the graph in such a way that no node is visited before all the nodes it depends on have been visited. Beyond this, it does not guarantee any particular order. So, you have a graph with node 1 2 3 4, and edges 1->3, 2->3, and 3->4, this walker guarnatees that 1 and 2 will be visited before 3 and 3 before 4, but it does not guarantee whether 1 or 2 will be visited first.

            for(LogicalPlan lp: mapJoinPlans.get(op)) {
                if (null != lp) {
                    // TODO FIX - How do we know this should be a
                    // DependencyOrderWalker?  We should be replicating the
                    // walker the current visitor is using.
                    PlanWalker w = new DependencyOrderWalker(lp);
                    pushWalker(w);
                    w.walk(this);
                    popWalker();
                }
            }
        }
    }

View Full Code Here

            for(LogicalPlan lp: mapGByPlans.get(op)) {
                if (null != lp) {
                    // TODO FIX - How do we know this should be a
                    // DependencyOrderWalker?  We should be replicating the
                    // walker the current visitor is using.
                    PlanWalker w = new DependencyOrderWalker(lp);
                    pushWalker(w);
                    for(LogicalOperator logicalOp: lp.getRoots()) {
                        logicalOp.visit(this);
                    }
                    popWalker();

View Full Code Here

     * @throws VisitorException
     */
    protected void visit(LOForEach g) throws VisitorException {
        // Visit each of generates projection elements.
        for(LogicalPlan lp: g.getForEachPlans()) {
            PlanWalker w = new DependencyOrderWalker(lp);
            pushWalker(w);
            for(LogicalOperator logicalOp: lp.getRoots()) {
                logicalOp.visit(this);
            }
            popWalker();

View Full Code Here

     * @throws VisitorException
     */
    protected void visit(LOSort s) throws VisitorException {
        // Visit the sort function
        for(LogicalPlan lp: s.getSortColPlans()) {
            PlanWalker w = new DependencyOrderWalker(lp);
            pushWalker(w);
            for(LogicalOperator logicalOp: lp.getRoots()) {
                logicalOp.visit(this);
            }
            popWalker();

View Full Code Here

     *            the logical filter operator that has to be visited
     * @throws VisitorException
     */
    protected void visit(LOFilter filter) throws VisitorException {
        // Visit the condition for the filter followed by the input
        PlanWalker w = new DependencyOrderWalker(filter.getComparisonPlan());
        pushWalker(w);
        for(LogicalOperator logicalOp: filter.getComparisonPlan().getRoots()) {
            logicalOp.visit(this);
        }
        popWalker();

View Full Code Here

    }


    protected void visit(LOSplitOutput sop) throws VisitorException {
        LogicalPlan lp = sop.getConditionPlan();
        if (null != lp) {
            PlanWalker w = new DependencyOrderWalker(lp);
            pushWalker(w);
            for(LogicalOperator logicalOp: lp.getRoots()) {
                logicalOp.visit(this);
            }
            popWalker();

View Full Code Here

            for(LogicalPlan lp: mapJoinPlans.get(op)) {
                if (null != lp) {
                    // TODO FIX - How do we know this should be a
                    // DependencyOrderWalker?  We should be replicating the
                    // walker the current visitor is using.
                    PlanWalker w = new DependencyOrderWalker(lp);
                    pushWalker(w);
                    w.walk(this);
                    popWalker();
                }
            }
        }
    }

View Full Code Here

            for(LogicalPlan lp: mapGByPlans.get(op)) {
                if (null != lp) {
                    // TODO FIX - How do we know this should be a
                    // DependencyOrderWalker?  We should be replicating the
                    // walker the current visitor is using.
                    PlanWalker w = new DependencyOrderWalker(lp);
                    pushWalker(w);
                    w.walk(this);
                    popWalker();
                }
            }
        }
    }

View Full Code Here

            for(LogicalPlan lp: mapJoinPlans.get(op)) {
                if (null != lp) {
                    // TODO FIX - How do we know this should be a
                    // DependencyOrderWalker?  We should be replicating the
                    // walker the current visitor is using.
                    PlanWalker w = new DependencyOrderWalker(lp);
                    pushWalker(w);
                    w.walk(this);
                    popWalker();
                }
            }
        }
    }

View Full Code Here

     * @throws VisitorException
     */
    protected void visit(LOForEach forEach) throws VisitorException {
        // Visit each of generates projection elements.
        for(LogicalPlan lp: forEach.getForEachPlans()) {
            PlanWalker w = new DependencyOrderWalker(lp);
            pushWalker(w);
            w.walk(this);
            popWalker();
        }
    }

View Full Code Here

0 1 2

TOP

Related Classes of org.apache.pig.impl.plan.DependencyOrderWalker

org.apache.pig.backend.hadoop.executionengine.physicalLayer.POPrinter

org.apache.pig.impl.logicalLayer.LOVisitor

org.apache.pig.test.utils.dotGraph.DotGraphVisitor

All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.