String soughtexclude = name + File.separator + "**"; for (int counter = 0; counter < excludes.length; counter++) { if (excludes[counter].equals(soughtexclude)) { return false; } } return true;
for (int i = 0; i < s.length; i++) { if (!isNmtoken(s[i])) { return false; } } return true;
Clone fragments detected by clone detection tool
File path: /apache-ant-1.7.0/src/org/apache/tools/ant/DirectoryScanner.java File path: /apache-ant-1.7.0/src/org/apache/tools/ant/taskdefs/AntStructure.java
Method name: boolean isMorePowerfulThanExcludes(String, String) Method name: boolean areNmtokens(String[])
Number of AST nodes: 5 Number of AST nodes: 4
1
String soughtexclude = name + File.separator + "**";
2
        for (int counter = 0; counter < excludes.length; counter++) {
1
for (int i = 0; i < s.length; i++) {
3
            if (excludes[counter].equals(soughtexclude))  {
2
                if (!isNmtoken(s[i])) {
4
                return false;
3
                    return false;
5
            }
4
            
6
        }
5
    }
6
            }
7
        return true;
7
            return true;
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.3
Clones locationClones are in different classes
Number of node comparisons7
  1. {Non-refactorable}
    Mapping Summary
    Number of mapped statements4
    Number of unmapped statements in the first code fragment1
    Number of unmapped statements in the second code fragment0
    Time elapsed for statement mapping (ms)0.6
    Clone typeType 3
    Mapped Statements
    ID Statement ID Statement
    1
    String soughtexclude = name + File.separator + "**";
                                                                                                              
    2
    for (int counter = 0; counter < excludes.length; counter++)
    2
    for (int counter = 0; counter < excludes.length; counter++)
    1
    for (int i = 0; i < s.length; i++)
    Differences
    Expression1Expression2Difference
    counteriVARIABLE_NAME_MISMATCH
    counteriVARIABLE_NAME_MISMATCH
    excludessVARIABLE_NAME_MISMATCH
    counteriVARIABLE_NAME_MISMATCH
    1
    for (int i = 0; i < s.length; i++)
    3
    if (excludes[counter].equals(soughtexclude))
    3
    if (excludes[counter].equals(soughtexclude))
    2
    if (!isNmtoken(s[i]))
    Differences
    Expression1Expression2Difference
    excludes[counter].equals(soughtexclude)!isNmtoken(s[i])TYPE_COMPATIBLE_REPLACEMENT
    Preondition Violations
    Expression excludes[counter].equals(soughtexclude) cannot be parameterized, because it has dependencies to/from statements that will be extracted
    Expression !isNmtoken(s[i]) cannot be parameterized, because it has dependencies to/from statements that will be extracted
    2
    if (!isNmtoken(s[i]))
    4
    return false;
    3
    return false;
    5
    return true;
    4
    return true;
    Precondition Violations (2)
    Row Violation
    1Expression excludes[counter].equals(soughtexclude) cannot be parameterized, because it has dependencies to/from statements that will be extracted
    2Expression !isNmtoken(s[i]) cannot be parameterized, because it has dependencies to/from statements that will be extracted