while (exStr.hasMoreTokens()) { if (DirectoryScanner.match(exStr.nextToken(), pName)) { 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/taskdefs/optional/scm/AntStarTeamCheckOut.java File path: /apache-ant-1.7.0/src/org/apache/tools/mail/MailMessage.java
Method name: boolean matchPatterns(String, String) Method name: boolean isResponseOK(String, int[])
Number of AST nodes: 3 Number of AST nodes: 3
1
while (exStr.hasMoreTokens()) {
2
     
1
for (int i = 0; i < ok.length; i++) {
3
       if (DirectoryScanner.match(exStr.nextToken(), pName)) {
2
      if (response.startsWith("" + ok[i])) {
4
                return true;
3
        return true;
5
            }
4
      
6
    
5
}
7
    }
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