for (Iterator i = additionalPatterns.iterator(); i.hasNext();) { if (hasPatterns((PatternSet) i.next())) { 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/types/resources/Files.java File path: /apache-ant-1.7.0/src/org/apache/tools/mail/MailMessage.java
Method name: boolean hasPatterns() Method name: boolean isResponseOK(String, int[])
Number of AST nodes: 3 Number of AST nodes: 3
1
for (Iterator i = additionalPatterns.iterator(); i.hasNext();) {
1
for (
2
            if (hasPatterns((PatternSet) i.next()
2
int i = 0; i < ok.length; i++) {
3
)) {
3
      if (response.startsWith("" + ok[i])) {
4
                return true;
4
        return true;
5
            }
5
      
6
    
6
}
7
    }
7
    }
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.2
Clones locationClones are in different classes
Number of node comparisons1