int j = 0; int k = i; for (int parent_k; (parent_k = parent[k]) >= 0;) { k = parent_k; j++; } len[i - 1] = (char) j; if (j > maxLen) { tooLong = true; }
int j = 0; int k = i; for (int parent_k; (parent_k = parent[k]) >= 0;) { k = parent_k; j++; } len[i - 1] = (byte) j; if (j > maxLen) { tooLong = true; }
Clone fragments detected by clone detection tool
File path: /apache-ant-1.7.0/src/org/apache/tools/bzip2/CBZip2OutputStream.java File path: /apache-ant-1.7.0/src/org/apache/tools/bzip2/CBZip2OutputStream.java
Method name: Method name:
Number of AST nodes: 0 Number of AST nodes: 0
1
int j = 0;
1
int j = 0;
2
                int k = i;
2
                int k = i;
3
                for (int parent_k; (parent_k = parent[k]) >= 0;) {
3
                for (int parent_k; (parent_k = parent[k]) >= 0;) {
4
                    k = parent_k;
4
                    k = parent_k;
5
                    j++;
5
                    j++;
6
                }
6
                }
7
                len[i - 1] = (char) j;
7
                len[i - 1] = (byte) j;
8
                if (j > maxLen) {
8
                if (j > maxLen) {
9
                    tooLong = true;
9
                    tooLong = true;
10
                }
10
                }
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.0
Clones location
Number of node comparisons0