for (int counter = 0; counter < RESOLVE_MODES.length; counter++) { if (resolvemode.equals(RESOLVE_MODES[counter])) { found = true; break; } }
for (int i = 0; i < includePatterns.length; i++) { if (matchPath(includePatterns[i], name, isCaseSensitive())) { return true; } }
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/DirectoryScanner.java
Method name: void setResolvemode(String) Method name: boolean isIncluded(String)
Number of AST nodes: 4 Number of AST nodes: 3
1
for (int counter = 0; counter < RESOLVE_MODES.length; counter++) {
1
for (int i = 0; i < includePatterns.length; i++) {
2
            if (resolvemode.equals(RESOLVE_MODES[counter])) {
2
            if (
3
                found = true;
4
                break
3
matchPath(includePatterns[i], name, isCaseSensitive())) {
5
;
4
                return true;
6
            }
5
            }
7
        }
6
        }
Summary
Number of common nesting structure subtrees1
Number of refactorable cases0
Number of non-refactorable cases1
Time elapsed for finding largest common nesting structure subtrees (ms)0.2
Clones locationClones are in different classes
Number of node comparisons7
  1. {Non-refactorable}
    Mapping Summary
    Number of mapped statements2
    Number of unmapped statements in the first code fragment2
    Number of unmapped statements in the second code fragment1
    Time elapsed for statement mapping (ms)0.9
    Clone typeType 3
    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++)
    4
    for (int i = 0; i < includePatterns.length; i++)
    Differences
    Expression1Expression2Difference
    counteriVARIABLE_NAME_MISMATCH
    counteriVARIABLE_NAME_MISMATCH
    RESOLVE_MODESincludePatternsVARIABLE_NAME_MISMATCH
    counteriVARIABLE_NAME_MISMATCH
    4
    for (int i = 0; i < includePatterns.length; i++)
    3
    if (resolvemode.equals(RESOLVE_MODES[counter]))
    3
    if (resolvemode.equals(RESOLVE_MODES[counter]))
    5
    if (matchPath(includePatterns[i], name, isCaseSensitive()))
    Differences
    Expression1Expression2Difference
    equalsmatchPathMETHOD_INVOCATION_NAME_MISMATCH
    resolvemode.equals(RESOLVE_MODES[counter])matchPath(includePatterns[i],name,isCaseSensitive())ARGUMENT_NUMBER_MISMATCH
    resolvemodeMISSING_METHOD_INVOCATION_EXPRESSION
    Preondition Violations
    Expression resolvemode.equals(RESOLVE_MODES[counter]) cannot be parameterized, because it has dependencies to/from statements that will be extracted
    Expression matchPath(includePatterns[i],name,isCaseSensitive()) cannot be parameterized, because it has dependencies to/from statements that will be extracted
    Expression resolvemode.equals(RESOLVE_MODES[counter]) cannot be parameterized, because it has dependencies to/from statements that will be extracted
    Expression matchPath(includePatterns[i],name,isCaseSensitive()) cannot be parameterized, because it has dependencies to/from statements that will be extracted
    5
    if (matchPath(includePatterns[i], name, isCaseSensitive()))
    4
    found = true;
    4
    found = true;
    Preondition Violations
    Unmatched statement found=true; cannot be moved before or after the extracted code, because it has dependencies to/from statements that will be extracted
                                
    5
    break;
    5
    break;
    Preondition Violations
    Unmatched break;
                      
                                  
    6
    return true;
    Preondition Violations
    Unmatched return true;
    6
    return true;
    Precondition Violations (7)
    Row Violation
    1Expression resolvemode.equals(RESOLVE_MODES[counter]) cannot be parameterized, because it has dependencies to/from statements that will be extracted
    2Expression matchPath(includePatterns[i],name,isCaseSensitive()) cannot be parameterized, because it has dependencies to/from statements that will be extracted
    3Expression resolvemode.equals(RESOLVE_MODES[counter]) cannot be parameterized, because it has dependencies to/from statements that will be extracted
    4Expression matchPath(includePatterns[i],name,isCaseSensitive()) cannot be parameterized, because it has dependencies to/from statements that will be extracted
    5Unmatched statement found=true; cannot be moved before or after the extracted code, because it has dependencies to/from statements that will be extracted
    6Unmatched break;
    7Unmatched return true;