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: void hbMakeCodeLengths(char[], int[], int, int)
|
Method name: void hbMakeCodeLengths(byte[], int[], Data, int, int)
|
|||
Number of AST nodes: 5 | Number of AST nodes: 5 | |||
1 | if (tooLong) {↵ | 1 | if (tooLong) {↵ | |
2 | for (int i = 1; i < alphaSize; i++) {↵ | 2 | for (int i = 1; i < alphaSize; i++) {↵ | |
3 | int j = weight[i] >> 8;↵ | 3 | int j = weight[i] >> 8;↵ | |
4 | j = 1 + (j >> 1);↵ | 4 | j = 1 + (j >> 1);↵ | |
5 | weight[i] = j << 8;↵ | 5 | weight[i] = j << 8;↵ | |
6 | }↵ | 6 | }↵ | |
7 | } | 7 |
| |
See real code fragment | See real code fragment |
Number of common nesting structure subtrees | 1 |
Number of refactorable cases | 1 |
Number of non-refactorable cases | 0 |
Time elapsed for finding largest common nesting structure subtrees (ms) | 0.2 |
Clones location | Clones are declared in the same class |
Number of node comparisons | 29 |
Number of mapped statements | 5 |
Number of unmapped statements in the first code fragment | 0 |
Number of unmapped statements in the second code fragment | 0 |
Time elapsed for statement mapping (ms) | 1.2 |
Clone type | Type 1 |
ID | Statement | ID | Statement | |
---|---|---|---|---|
83 | if (tooLong) | 83 | if (tooLong) | |
84 | for (int i = 1; i < alphaSize; i++) | 84 | for (int i = 1; i < alphaSize; i++) | |
85 | int j = weight[i] >> 8; | 85 | int j = weight[i] >> 8; | |
86 | j = 1 + (j >> 1); | 86 | j = 1 + (j >> 1); | |
87 | weight[i] = j << 8; | 87 | weight[i] = j << 8; |
Row | Violation |
---|