for (int d = 0; d < deleteChars.length(); ++d) { if (deleteChars.charAt(d) == c) { return true; } }
while (exStr.hasMoreTokens()) { if (DirectoryScanner.match(exStr.nextToken(), pName)) { return true; } }
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/optional/starteam/TreeBasedTask.java
Method name: boolean isDeleteCharacter(char) Method name: boolean matchPatterns(String, String)
Number of AST nodes: 3 Number of AST nodes: 3
1
for (int d = 0; d < deleteChars.length(); ++d) {
1
while (exStr.hasMoreTokens()) {
2
                if (deleteChars.charAt(d) ==  c) {
2
            if (
3
    
3
DirectoryScanner.match(exStr.nextToken(), pName)) {
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.1
Clones locationClones are in different classes having the same super class
Number of node comparisons1