for (int i = 0; i < delims.length; ++i) { if (delims[i] == ch) { return true; } }
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/org/apache/tools/ant/util/StringTokenizer.java File path: /apache-ant-1.7.0/src/org/apache/tools/mail/MailMessage.java
Method name: boolean isDelim(char) Method name: boolean isResponseOK(String, int[])
Number of AST nodes: 3 Number of AST nodes: 3
1
for (int i = 0; i < delims.length; ++i) {
1
for (int i = 0; i < ok.length; i++) {
2
            if (delims[i] == ch) {
2
      if (response.startsWith("" + ok[i])) {
3
                return true;
3
        return true;
4
            }
4
      
5
    
5
}
6
    }
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