for (int i = 0; i < splitClasses.length; i++) {
if (simplename.equals(splitClasses[i])
|| simplename.startsWith(splitClasses[i] + '$')) {
return true;
}
}
for (int i = 0; i < delims.length; ++i) {
if (delims[i] == ch) {
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/util/StringTokenizer.java
|
Method name: boolean isSplit(String)
|
|
Method name: boolean isDelim(char)
|
Number of AST nodes: 3
|
|
Number of AST nodes: 3
|
|
1 | for (int i = 0; i < splitClasses.length; i++) {↵ | | 1 | for (int i = 0; i < delims.length; ++i) {↵
|
2 | if (simplename.equals(splitClasses[i])↵ | | 2 | if (↵
|
3 | || simplename.startsWith(splitClasses[i] + '$')) {↵ | | |
|
4 | ↵ | | 3 | delims[i] == ch) {↵
|
5 | return true;↵ | | 4 | return true;↵
|
6 | }↵ | | 5 | ↵
|
7 | ↵ | | 6 | }↵
|
8 | } | | 7 | }
|
See real code fragment |
|
See real code fragment |
Summary
Number of common nesting structure subtrees | 0 |
Number of refactorable cases | 0 |
Number of non-refactorable cases | 0 |
Time elapsed for finding largest common nesting structure subtrees (ms) | 0.2 |
Clones location | Clones are in different classes |
Number of node comparisons | 1 |