for (; same < minLength; same++) {
if (!fromPathStack[same].equals(toPathStack[same])) {
break;
}
}
for (int i = 0; i < lastChars.length; ++i) {
if (lastChars[i] != eolString.charAt(i)) {
return true;
}
}
Clone fragments detected by clone detection tool
File path: /apache-ant-1.7.0/src/org/apache/tools/ant/util/FileUtils.java
|
|
File path: /apache-ant-1.7.0/src/org/apache/tools/ant/taskdefs/Concat.java
|
Method name: String getRelativePath(File, File)
|
|
Method name: boolean isMissingEndOfLine()
|
Number of AST nodes: 3
|
|
Number of AST nodes: 3
|
|
1 | for (; same < minLength; same++) {↵ | | 1 | for (int i = 0; i < lastChars.length; ++i) {↵
|
2 | if (!fromPathStack[same].equals(toPathStack[same])) {↵ | | 2 | if (lastChars[i] != eolString.charAt(i)) {↵
|
3 | break;↵ | | 3 | return true;↵
|
4 | }↵ | | 4 | ↵
|
| | | 5 | }↵
|
5 | } | | 6 | }
|
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 |