for (int i = 0; i < name.length(); ++i) {
if (!isValidNameCharacter(name.charAt(i))) {
return false;
}
}
for (int i = 0, sz = this.getRecordSize(); i < sz; ++i) {
if (record[i] != 0) {
return false;
}
}
Clone fragments detected by clone detection tool
File path: /apache-ant-1.7.0/src/org/apache/tools/ant/taskdefs/MacroDef.java
|
|
File path: /apache-ant-1.7.0/src/org/apache/tools/tar/TarBuffer.java
|
Method name: boolean isValidName(String)
|
|
Method name: boolean isEOFRecord(byte[])
|
Number of AST nodes: 3
|
|
Number of AST nodes: 3
|
|
1 | for (int i = 0; i < name.length(); ++i) {↵ | | 1 | for (int i = 0↵
|
2 | if (!isValidNameCharacter(name.charAt(i))↵ | | 2 | , sz = this.getRecordSize(); i < sz; ++i) {↵
|
3 | ) {↵ | | 3 | if (record[i] != 0) {↵
|
4 | return false;↵ | | 4 | return false;↵
|
5 | }↵ | | 5 | }↵
|
6 | } | | 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 |