for (int counter = 0; counter < RESOLVE_MODES.length; counter++) { if (resolvemode.equals(RESOLVE_MODES[counter])) { found = true; break; } }
for (int i = 0; i < VALID_ACTIONS.length; i++) { if (action.equals(VALID_ACTIONS[i])) { valid = true; break; } }
Clone fragments detected by clone detection tool
File path: /apache-ant-1.7.0/src/org/apache/tools/ant/taskdefs/optional/perforce/P4Resolve.java File path: /apache-ant-1.7.0/src/org/apache/tools/ant/taskdefs/optional/j2ee/JonasHotDeploymentTool.java
Method name: void setResolvemode(String) Method name: boolean isActionValid()
Number of AST nodes: 4 Number of AST nodes: 4
1
for (int counter = 0; counter < RESOLVE_MODES.length; counter++) {
1
for (int i = 0; i < VALID_ACTIONS.length; i++) {
2
            if (resolvemode.equals(RESOLVE_MODES[counter])) {
2
            if (action.equals(VALID_ACTIONS[i])) {
3
                found = true;
3
                valid = true;
4
                break;
4
                break;
5
            }
5
            }
6
        }
6
        }
Summary
Number of common nesting structure subtrees1
Number of refactorable cases1
Number of non-refactorable cases0
Time elapsed for finding largest common nesting structure subtrees (ms)0.3
Clones locationClones are in different classes
Number of node comparisons10
  1. {Refactorable}
    Mapping Summary
    Number of mapped statements4
    Number of unmapped statements in the first code fragment0
    Number of unmapped statements in the second code fragment0
    Time elapsed for statement mapping (ms)0.5
    Clone typeType 2
    Mapped Statements
    ID Statement ID Statement
    2
    for (int counter = 0; counter < RESOLVE_MODES.length; counter++)
    2
    for (int counter = 0; counter < RESOLVE_MODES.length; counter++)
    3
    for (int i = 0; i < VALID_ACTIONS.length; i++)
    Differences
    Expression1Expression2Difference
    counteriVARIABLE_NAME_MISMATCH
    counteriVARIABLE_NAME_MISMATCH
    RESOLVE_MODESVALID_ACTIONSVARIABLE_NAME_MISMATCH
    counteriVARIABLE_NAME_MISMATCH
    3
    for (int i = 0; i < VALID_ACTIONS.length; i++)
    3
    if (resolvemode.equals(RESOLVE_MODES[counter]))
    3
    if (resolvemode.equals(RESOLVE_MODES[counter]))
    4
    if (action.equals(VALID_ACTIONS[i]))
    Differences
    Expression1Expression2Difference
    RESOLVE_MODESVALID_ACTIONSVARIABLE_NAME_MISMATCH
    counteriVARIABLE_NAME_MISMATCH
    resolvemodeactionVARIABLE_NAME_MISMATCH
    4
    if (action.equals(VALID_ACTIONS[i]))
    4
    found = true;
    4
    found = true;
    5
    valid = true;
    Differences
    Expression1Expression2Difference
    foundvalidVARIABLE_NAME_MISMATCH
    5
    valid = true;
    5
    break;
    6
    break;
    Precondition Violations (0)
    Row Violation