Class ExactKeyMatcher

test/org/apache/pig/test/utils/dotGraph/ExactKeyMatcher.java:32–116

This matcher only does exact key matching

 * This matcher only does exact key matching
 */
public class ExactKeyMatcher implements NodeMatcher<Operator,
                                                    OperatorPlan<Operator>> {

    public Map<OperatorKey, OperatorKey> match(OperatorPlan<Operator> plan1,
                                               OperatorPlan<Operator> plan2,
                                               StringBuilder messages) {
        // Find plan1.OperatorSet - plan2.OperatorSet
        int diff1 = diffKeys(plan1, plan2, messages, "plan2") ;

        // Find plan2.OperatorSet - plan1.OperatorSet
        int diff2 = diffKeys(plan2, plan1, messages, "plan1") ;

        // If there is a problem, just finish here
        if ( (diff1 != 0) || (diff2 != 0) ) {
            return null ;
        }

        // if no problem, we just return exact matching
        Iterator<Operator> iter = plan1.getKeys().values().iterator() ;
        Map<OperatorKey, OperatorKey> outputMap
                                = new HashMap<OperatorKey, OperatorKey>() ;
        while(iter.hasNext()) {
            Operator op = iter.next() ;
            outputMap.put(op.getOperatorKey(), op.getOperatorKey()) ;
        }

        return outputMap;
    }

    /***
     * Report plan1.OperatorSet - plan2.OperatorSet
     *
     * @param plan1
     * @param plan2
     * @param messages where the report messages go. null if no messages needed
     * @param plan2Name the name that is used to refer to plan2 in messages
     * @return
     */

    private int diffKeys(OperatorPlan<Operator> plan1,
                         OperatorPlan<Operator> plan2,
                         StringBuilder messages,
                         String plan2Name) {
        int count = 0 ;

        // prepare
        Map<OperatorKey, Operator> keyList = plan1.getKeys() ;
        Iterator<OperatorKey> iter = keyList.keySet().iterator() ;

        // go through the list of vertices of the first plan
        while(iter.hasNext()) {

            OperatorKey key = iter.next() ;

            // if the same key doesn't exist in the second plan
            // we've got a problem
            if (plan2.getOperator(key) == null) {
                Operator op1 = plan1.getOperator(key) ;