for (int i=0; i<l1.length; i++) { if (!l1[i].equals(l2[i])) { assertTrue(msg, !shouldBeEqual); } }
for (int i = 0; i < ok.length; i++) { if (response.startsWith("" + ok[i])) { return true; } }
Clone fragments detected by clone detection tool
File path: /apache-ant-1.7.0/src/tests/junit/org/apache/tools/ant/taskdefs/AntTest.java File path: /apache-ant-1.7.0/src/org/apache/tools/mail/MailMessage.java
Method name: void targetStarted(BuildEvent) Method name: boolean isResponseOK(String, int[])
Number of AST nodes: 3 Number of AST nodes: 3
1
for (int i=0; i<l1.length; i++) {
1
for (int i = 0; i < ok.length; i++) {
2
                                    if (!l1[i].equals(l2[i])) {
2
      
3
                                        assertTrue(msg, !shouldBeEqual);
4
                                    }
5
                            
3
if (response.startsWith("" + ok[i])) {
4
        return true;
5
      }
6
    }
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 comparisons5
  1. {Non-refactorable}
    Mapping Summary
    Number of mapped statements2
    Number of unmapped statements in the first code fragment1
    Number of unmapped statements in the second code fragment1
    Time elapsed for statement mapping (ms)0.4
    Clone typeType 2
    Mapped Statements
    ID Statement ID Statement
    19
    for (int i = 0; i < l1.length; i++)
    19
    for (int i = 0; i < l1.length; i++)
    1
    for (int i = 0; i < ok.length; i++)
    Differences
    Expression1Expression2Difference
    l1okVARIABLE_NAME_MISMATCH
    java.lang.String[]int[]VARIABLE_TYPE_MISMATCH
    Preondition Violations
    Type java.lang.String[] of variable l1 does not match with type int[] of variable ok
    • Make classes java.lang.String[] and int[] extend a common superclass
    1
    for (int i = 0; i < ok.length; i++)
    20
    if (!l1[i].equals(l2[i]))
    20
    if (!l1[i].equals(l2[i]))
    2
    if (response.startsWith("" + ok[i]))
    Differences
    Expression1Expression2Difference
    !l1[i].equals(l2[i])response.startsWith("" + ok[i])TYPE_COMPATIBLE_REPLACEMENT
    Preondition Violations
    Expression !l1[i].equals(l2[i]) cannot be parameterized, because it has dependencies to/from statements that will be extracted
    Expression response.startsWith("" + ok[i]) cannot be parameterized, because it has dependencies to/from statements that will be extracted
    2
    if (response.startsWith("" + ok[i]))
                                  
    3
    return true;
    Preondition Violations
    Unmatched return true;
    3
    return true;
    21
    assertTrue(msg, !shouldBeEqual);
                                                                          
    Precondition Violations (4)
    Row Violation
    1Type java.lang.String[] of variable l1 does not match with type int[] of variable ok
    2Expression !l1[i].equals(l2[i]) cannot be parameterized, because it has dependencies to/from statements that will be extracted
    3Expression response.startsWith("" + ok[i]) cannot be parameterized, because it has dependencies to/from statements that will be extracted
    4Unmatched return true;