for (int i = 0; i < splitClasses.length; i++) { if (simplename.equals(splitClasses[i]) || simplename.startsWith(splitClasses[i] + '$')) { 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/taskdefs/optional/junit/JUnitTask.java File path: /apache-ant-1.7.0/src/org/apache/tools/ant/taskdefs/optional/starteam/TreeBasedTask.java
Method name: boolean isSplit(String) Method name: boolean matchPatterns(String, String)
Number of AST nodes: 3 Number of AST nodes: 3
1
for (int i = 0; i < splitClasses.length; i++) {
2
                if (simplename.equals(splitClasses[i])
3
                        || simplename.startsWith(splitClasses[i] + '$'
1
while (exStr.hasMoreTokens()) {
4
)) {
2
            if (DirectoryScanner.match(exStr.nextToken(), pName)) {
5
                    return true;
3
                return true;
6
                }
4
            
7
    
5
}
8
        }
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