for (int d = 0; d < deleteChars.length(); ++d) { if (deleteChars.charAt(d) == c) { return true; } }
while (searchParents && parent != null && parent.exists()) { if (checkFile(new File(parent, filename), filename + " in " + parent)) { return true; } parent = parent.getParentFile(); }
Clone fragments detected by clone detection tool
File path: /apache-ant-1.7.0/src/org/apache/tools/ant/filters/TokenFilter.java File path: /apache-ant-1.7.0/src/org/apache/tools/ant/taskdefs/Available.java
Method name: boolean isDeleteCharacter(char) Method name: boolean checkFile()
Number of AST nodes: 3 Number of AST nodes: 4
1
for (int d = 0; d < deleteChars.length(); ++d) {
1
while (searchParents && parent != null && parent.exists()) {
2
                if (deleteChars.charAt(d) ==  c) {
2
                
3
    if (checkFile(new File(parent, filename),
4
                                  filename + " in " + parent)) {
3
                    return true;
5
                        return true;
4
                }
6
                 
7
   }
8
                    parent = parent.getParentFile();
5
            }
9
                }
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 having the same super class
Number of node comparisons1