for (int i = 0; i < ok.length; i++) { if (response.startsWith("" + ok[i])) { return true; } }
for (int j = 0; j < alphaSize; j++) { if (length[j] == i) { perm[pp++] = j; } }
Clone fragments detected by clone detection tool
File path: /apache-ant-1.7.0/src/org/apache/tools/mail/MailMessage.java File path: /apache-ant-1.7.0/src/org/apache/tools/bzip2/CBZip2InputStream.java
Method name: boolean isResponseOK(String, int[]) Method name: void hbCreateDecodeTables(int[], int[], int[], char[], int, int, int)
Number of AST nodes: 3 Number of AST nodes: 3
1
for (int i = 0; i < ok.length; i++) {
1
for (int j = 0; j < alphaSize; j++) {
2
      if (response.startsWith("" + ok[i])) {
2
      
3
        return true;
4
      }
3
          if (length[j] == i) {
4
                    perm[pp++] = j;
5
                }
5
    }
6
            }
Summary
Number of common nesting structure subtrees0
Number of refactorable cases0
Number of non-refactorable cases0
Time elapsed for finding largest common nesting structure subtrees (ms)0.1
Clones locationClones are in different classes
Number of node comparisons1