for (int i = 1; i <= alphaSize; i++) {
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;
for (int i = 1; i <= alphaSize; i++) {
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 | for (int i = 1; i <= alphaSize; i++) {↵ | | 1 | for (int i = 1; i <= alphaSize; i++) {↵
|
2 | int j = 0;↵ | | 2 | int j = 0;↵
|
3 | int k = i;↵ | | 3 | int k = i;↵
|
|
4 | for (int parent_k; (parent_k = parent[k]) >= 0;) {↵ | | 4 | for (int parent_k; (parent_k = parent[k]) >= 0;) {↵
|
5 | k = parent_k;↵ | | 5 | k = parent_k;↵
|
6 | j++;↵ | | 6 | j++;↵
|
7 | }↵ | | 7 | }↵
|
|
8 | len[i - 1] = (char) j;↵ | | 8 | len[i - 1] = (byte) j;↵
|
9 | if (j > maxLen) {↵ | | 9 | if (j > maxLen) {↵
|
10 | tooLong = true;↵ | | 10 | tooLong = true;↵
|
11 | | | 11 |
|
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.0 |
Clones location | |
Number of node comparisons | 0 |