for (int d = 0; d < deleteChars.length(); ++d) {
if (deleteChars.charAt(d) == c) {
return true;
}
}
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/filters/TokenFilter.java
|
|
File path: /apache-ant-1.7.0/src/org/apache/tools/ant/taskdefs/Concat.java
|
Method name: boolean isDeleteCharacter(char)
|
|
Method name: boolean isMissingEndOfLine()
|
Number of AST nodes: 3
|
|
Number of AST nodes: 3
|
|
1 | for (int d = 0; d < deleteChars.length(); ++d) {↵ | | 1 | for (int i = 0; i < lastChars.length; ++i) {↵
|
2 | if (deleteChars.charAt(d) == c) {↵ | | 2 | if (lastChars[i] != eolString.charAt(i)) {↵
|
3 | return true;↵ | | 3 | return true;↵
|
4 | }↵ | | 4 | }↵
|
5 | } | | 5 | }
|
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 |