for (int i = 0, sz = this.getRecordSize(); i < sz; ++i) { if (record[i] != 0) { return false; } }
for (int i = 0; i < arr.length; i++) { if (!couldHoldIncluded(arr[i])) { scandir(new File(basedir, arr[i]), arr[i] + File.separator, false); } }
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/DirectoryScanner.java
Method name: boolean isEOFRecord(byte[]) Method name: void processSlowScan(String[])
Number of AST nodes: 3 Number of AST nodes: 3
1
for (int i = 0, sz = this.getRecordSize(); i < sz; ++i) {
1
for (int i = 0; i < arr.length; i++) {
2
            if (record[i] != 0) {
2
            if (
3
                return
3
!couldHoldIncluded(arr[i])) {
4
                scandir(new File(basedir, arr[i]),
4
 false;
5
                        arr[i] + File.separator, false);
5
            }
6
            }
6
        }
7
        }
Summary
Number of common nesting structure subtrees0
Number of refactorable cases0
Number of non-refactorable cases0
Time elapsed for finding largest common nesting structure subtrees (ms)0.1
Clones locationClones are in different classes
Number of node comparisons1