Examples of DependencyOrderWalker

org.apache.pig.experimental.plan.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.
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.
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.

Examples of org.apache.pig.newplan.DependencyOrderWalker

 * indexes, using the underlying anonymous expression plan visitor.
 */
public class ColumnAliasConversionVisitor extends AllExpressionVisitor {
  
    public ColumnAliasConversionVisitor(OperatorPlan plan) throws FrontendException {
        super( plan, new DependencyOrderWalker( plan ) );
    }

View Full Code Here

0 1 2 3 4 5

TOP

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.