for (int i = 0, sz = this.getRecordSize(); i < sz; ++i) {
if (record[i] != 0) {
return false;
}
}
while ((line = br.readLine()) != null) {
if (!filterLine(line)) {
pw.println(line);
}
}
Clone fragments detected by clone detection tool
File path: /apache-ant-1.7.0/src/org/apache/tools/tar/TarBuffer.java
|
|
File path: /apache-ant-1.7.0/src/org/apache/tools/ant/taskdefs/optional/junit/JUnitTestRunner.java
|
Method name: boolean isEOFRecord(byte[])
|
|
Method name: String filterStack(String)
|
Number of AST nodes: 3
|
|
Number of AST nodes: 3
|
|
1 | for (int i = 0, sz = this.getRecordSize(); i < sz; ++i) {↵ | | |
|
2 | if (record[i] != 0↵ | | 1 | while ((line = br.readLine()) != null) {↵
|
3 | ) {↵ | | 2 | if (!filterLine(line)) {↵
|
4 | return false;↵ | | 3 | pw.println(line);↵
|
5 | }↵ | | 4 | ↵
|
| | | 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 |