Examples of org.apache.pig.newplan.DependencyOrderWalker

org.apache.pig.newplan.DependencyOrderWalker
A walker to walk graphs in dependency order. It is guaranteed that a node will not be visited until all of its predecessors have been visited. This is equivalent to doing a topilogical sort on the graph and then visiting the nodes in order.

        plan.connect(joe, bob);
        plan.connect(bob, jill);
        plan.connect(jane, jill);
        
        SillyVisitor v =
            new SillyVisitor(plan, new DependencyOrderWalker(plan));
        
        v.visit();
        
        String s = v.getVisitPattern();

View Full Code Here

        plan.connect(joe, bob);
        plan.connect(bob, jill);
        plan.connect(bob, jane);
        
        SillyVisitor v =
            new SillyVisitor(plan, new DependencyOrderWalker(plan));
        
        v.visit();
        
        String s = v.getVisitPattern();

View Full Code Here

 */
public class OptimizeLimitPlanPrinter extends LogicalRelationalNodesVisitor {
    private StringBuilder sb = null ;
    
    public OptimizeLimitPlanPrinter(LogicalPlan plan) throws FrontendException {
        super( plan, new DependencyOrderWalker( plan ) );
        sb = new StringBuilder() ;
    }

View Full Code Here


class MyLogicalExpressionVisitor extends LogicalExpressionVisitor {
    private StringBuilder sb = null ;
    
    public MyLogicalExpressionVisitor(LogicalExpressionPlan plan) throws FrontendException {
        super( plan, new DependencyOrderWalker( plan ) );
        sb = new StringBuilder() ;
    }

View Full Code Here

import org.apache.pig.impl.util.Utils;


public class LogToPhyTranslationVisitor extends LogicalRelationalNodesVisitor {
    
    public LogToPhyTranslationVisitor(OperatorPlan plan) throws FrontendException {
        super(plan, new DependencyOrderWalker(plan));
        currentPlan = new PhysicalPlan();
        logToPhyMap = new HashMap<Operator, PhysicalOperator>();
        currentPlans = new Stack<PhysicalPlan>();
    }

View Full Code Here

    }
    
    public static class SortInfoSetter extends LogicalRelationalNodesVisitor {


        public SortInfoSetter(OperatorPlan plan) throws FrontendException {
            super(plan, new DependencyOrderWalker(plan));
        }

View Full Code Here

        static class MapExprMarker extends LogicalExpressionVisitor {


            Map<Long,Set<String>> inputUids = null;
            
            protected MapExprMarker(OperatorPlan p) throws FrontendException {
                super(p, new DependencyOrderWalker(p));
                inputUids = new HashMap<Long,Set<String>>();
            }

View Full Code Here

        
        static class FullMapExpCollector extends LogicalExpressionVisitor {
            Set<Long> fullMapUids = new HashSet<Long>();
            protected FullMapExpCollector(OperatorPlan plan, Set<Long> fullMapUids)
                    throws FrontendException {
                super(plan, new DependencyOrderWalker(plan));
                this.fullMapUids = fullMapUids;
            }

View Full Code Here

                    }
                }
                
                // visit expression associated with currOp. If it refers to any other operator
                // that operator is also going to be enqueued.
                currOp.accept( new AllExpressionVisitor( plan, new DependencyOrderWalker( plan ) ) {
                        @Override
                        protected LogicalExpressionVisitor getVisitor(LogicalExpressionPlan exprPlan)
                        throws FrontendException {
                            return new LogicalExpressionVisitor( exprPlan, new DependencyOrderWalker( exprPlan ) ) {
                                @Override
                                public void visit(ScalarExpression expr) throws FrontendException {
                                    Operator refOp = expr.getImplicitReferencedOperator();
                                    if( !queue.contains( refOp ) )
                                        queue.add( refOp );

View Full Code Here

    }


    private void verify(String query) throws RecognitionException, ParsingFailureException, IOException {
        LogicalPlan plan = validate( query );
        System.out.println( "Plan after setter: " + plan.toString() );
        new AllExpressionVisitor( plan, new DependencyOrderWalker( plan ) ) {
            @Override
            protected LogicalExpressionVisitor getVisitor(LogicalExpressionPlan exprPlan) throws FrontendException {
                return new LogicalExpressionVisitor( exprPlan, new DependencyOrderWalker( exprPlan ) ) {
                    @Override
                    public void visit(ProjectExpression expr) throws FrontendException {
                        Assert.assertTrue( null == expr.getColAlias() );
                        Assert.assertTrue( expr.getColNum() >= -1 );
                    }

View Full Code Here

0 1 2 3 4 5 6 7 8 9

TOP

Related Classes of org.apache.pig.newplan.DependencyOrderWalker

org.apache.pig.backend.hadoop.executionengine.HExecutionEngine$SortInfoSetter

org.apache.pig.newplan.logical.expression.ExpToPhyTranslationVisitor

org.apache.pig.newplan.logical.optimizer.DanglingNestedNodeRemover

org.apache.pig.newplan.logical.optimizer.ProjectionPatcher$ProjectionFinder

org.apache.pig.newplan.logical.optimizer.SchemaResetter

org.apache.pig.newplan.logical.optimizer.UidResetter

org.apache.pig.newplan.logical.relational.LogToPhyTranslationVisitor

org.apache.pig.newplan.logical.rules.ConstantCalculator$ConstantCalculatorTransformer$ConstantCalculatorLogicalPlanVisitor

org.apache.pig.newplan.logical.rules.MapKeysPruneHelper$FullMapCollector

org.apache.pig.newplan.logical.rules.MapKeysPruneHelper$FullMapCollector$FullMapExpCollector

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.