for (int i = 0; i < lastChars.length; ++i) {
if (lastChars[i] != eolString.charAt(i)) {
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/taskdefs/Concat.java
|
|
File path: /apache-ant-1.7.0/src/org/apache/tools/ant/taskdefs/Available.java
|
Method name: boolean isMissingEndOfLine()
|
|
Method name: boolean checkFile()
|
Number of AST nodes: 3
|
|
Number of AST nodes: 4
|
|
1 | for (int i = 0; i < lastChars.length; ++i) {↵ | | 1 | while (searchParents && parent != null && parent.exists()) {↵
|
2 | if (lastChars[i] != eolString.charAt(i↵ | | 2 | if (checkFile(new File(parent, filename),↵
|
3 | )) {↵ | | 3 | filename + " in " + parent)) {↵
|
4 | return true;↵ | | 4 | return true;↵
|
5 | }↵ | | 5 | ↵
|
| | | 6 | }↵
|
| | | 7 | parent = parent.getParentFile();↵
|
6 | } | | 8 | }
|
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.1 |
Clones location | Clones are in different classes |
Number of node comparisons | 1 |