Examples of org.apache.pig.newplan.ReverseDependencyOrderWalker

org.apache.pig.newplan.ReverseDependencyOrderWalker
Visit a plan in the reverse of the dependency order. That is, every node after every node that depends on it is visited. Thus this is equivalent to doing a reverse topilogical sort on the graph and then visiting it in order.

        
        plan.connect(fred, joe);
        plan.connect(joe, bob);
        
        SillyVisitor v =
            new SillyVisitor(plan, new ReverseDependencyOrderWalker(plan));
        
        v.visit();
        
        String s = v.getVisitPattern();

View Full Code Here

        plan.connect(joe, bob);
        plan.connect(bob, jill);
        plan.connect(jane, jill);
        
        SillyVisitor v =
            new SillyVisitor(plan, new ReverseDependencyOrderWalker(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 ReverseDependencyOrderWalker(plan));
        
        v.visit();
        
        String s = v.getVisitPattern();

View Full Code Here

            class TrimVisitor extends AllSameExpressionVisitor {
                LogicalExpressionPlan plan;


                TrimVisitor(LogicalExpressionPlan plan)
                                throws FrontendException {
                    super(plan, new ReverseDependencyOrderWalker(plan));
                    // the plan will be trimmed in-place on the original plan: this is
                    // ok because the ReverseDependencyOrderWalker first build the
                    // traversal ordering from the original plan, then starts the
                    // traversal which does not rely upon the topology of the original plan
                    this.plan = plan;

View Full Code Here

            class TrimVisitor extends AllSameExpressionVisitor {
                LogicalExpressionPlan plan;


                TrimVisitor(LogicalExpressionPlan plan)
                                throws FrontendException {
                    super(plan, new ReverseDependencyOrderWalker(plan));
                    // the plan will be trimmed in-place on the original plan: this is
                    // ok because the ReverseDependencyOrderWalker first build the
                    // traversal ordering from the original plan, then starts the
                    // traversal which does not rely upon the topology of the original plan
                    this.plan = plan;

View Full Code Here


        private Map<Long, FuncSpec> uid2LoadFuncMap;


        public LineageFindExpVisitor(LogicalExpressionPlan plan,
                Map<Long, FuncSpec> uid2LoadFuncMap) throws FrontendException {
            super(plan, new ReverseDependencyOrderWalker(plan));
            this.uid2LoadFuncMap = uid2LoadFuncMap;
        }

View Full Code Here

    // a schema. They may be the uids of lower level fields of complex fields
    // that have their own schema.
    static private class ColumnDependencyVisitor extends LogicalRelationalNodesVisitor {


        public ColumnDependencyVisitor(OperatorPlan plan) throws FrontendException {
            super(plan, new ReverseDependencyOrderWalker(plan));
        }

View Full Code Here

 */
class ConstExpEvaluator extends LogicalExpressionVisitor {
    Deque<ConstantExpression> result;


    ConstExpEvaluator(OperatorPlan plan) throws FrontendException {
        super(plan, new ReverseDependencyOrderWalker(plan));
        result = new LinkedList<ConstantExpression>();
    }

View Full Code Here

            CompilationMessageCollector msgCollector, 
            LogicalRelationalOperator relOp
    )
    throws FrontendException {


        super(expPlan, new ReverseDependencyOrderWalker(expPlan));
        this.msgCollector = msgCollector;
        this.currentRelOp = relOp;
        //reset field schema of all expression operators because
        // it needs to be re-evaluated after correct types are set
        FieldSchemaResetter sr = new FieldSchemaResetter(expPlan);

View Full Code Here

    


    static class FieldSchemaResetter extends AllSameExpressionVisitor {


        protected FieldSchemaResetter(OperatorPlan p) throws FrontendException {
            super(p, new ReverseDependencyOrderWalker(p));
        }

View Full Code Here

0 1 2 3 4 5 6 7 8

TOP

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

org.apache.pig.newplan.logical.optimizer.ExpressionUidResetter

org.apache.pig.newplan.logical.optimizer.FieldSchemaResetter

org.apache.pig.newplan.logical.relational.LOForEach$NestedRelationalOperatorFinder

org.apache.pig.newplan.logical.relational.LOSort$ResetProjectionAttachedRelationalOpVisitor

org.apache.pig.newplan.logical.rules.ColumnPruneHelper$ColumnDependencyVisitor

org.apache.pig.newplan.logical.rules.ColumnPruneVisitor

org.apache.pig.newplan.logical.rules.ConstExpEvaluator

org.apache.pig.newplan.logical.rules.DNFPlanGenerator

org.apache.pig.newplan.logical.rules.LogicalExpressionSimplifier$LogicalExpressionSimplifierTransformer

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

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.