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/CBZip2InputStream.java | |||
Method name: void sendMTFValues3(int, int)
|
Method name: void createHuffmanDecodingTables(int, int)
|
|||
Number of AST nodes: 6 | Number of AST nodes: 6 | |||
1 | for (int i = alphaSize; --i >= 0;) {↵ | 1 | for (int i = alphaSize; --i >= 0;) {↵ | |
2 | final int l = len_t[i] & 0xff;↵ | 2 | final char lent = len_t[i];↵ | |
3 | if (l > maxLen) {↵ | 3 | if (lent > maxLen) {↵ | |
4 | maxLen = l;↵ | 4 | maxLen = lent;↵ | |
5 | }↵ | 5 | }↵ | |
6 | if (l < minLen) {↵ | 6 | if (lent < minLen) {↵ | |
7 | minLen = l;↵ | 7 | minLen = lent;↵ | |
8 | }↵ | 8 | }↵ | |
9 | } | 9 |
| |
See real code fragment | See real code fragment |
Number of common nesting structure subtrees | 1 |
Number of refactorable cases | 0 |
Number of non-refactorable cases | 1 |
Time elapsed for finding largest common nesting structure subtrees (ms) | 0.6 |
Clones location | Clones are in different classes |
Number of node comparisons | 19 |
Number of mapped statements | 3 |
Number of unmapped statements in the first code fragment | 3 |
Number of unmapped statements in the second code fragment | 3 |
Time elapsed for statement mapping (ms) | 1.0 |
Clone type | Type 2 |
ID | Statement | ID | Statement | |||||||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
7 | for (int i = alphaSize; --i >= 0; ) | 11 | for (int i = alphaSize; --i >= 0; ) | |||||||||||||||
8 | final int l = len_t[i] & 0xff; |
| | |||||||||||||||
|
| 12 | final char lent = len_t[i]; | |||||||||||||||
9 | if (l > maxLen) |
| 13 | if (lent > maxLen) | ||||||||||||||
10 | maxLen = l; |
| | |||||||||||||||
|
| 14 | maxLen = lent; | |||||||||||||||
11 | if (l < minLen) |
| 15 | if (lent < minLen) | ||||||||||||||
12 | minLen = l; |
| | |||||||||||||||
|
| 16 | minLen = lent; |
Row | Violation |
---|---|
1 | Unmatched statement final int l=len_t[i] & 0xff; cannot be moved before or after the extracted code, because it has dependencies to/from statements that will be extracted |
2 | Unmatched statement final char lent=len_t[i]; cannot be moved before or after the extracted code, because it has dependencies to/from statements that will be extracted |
3 | Type int of variable l does not match with type char of variable lent |
4 | Unmatched statement maxLen=l; cannot be moved before or after the extracted code, because it has dependencies to/from statements that will be extracted |
5 | Unmatched statement maxLen=lent; cannot be moved before or after the extracted code, because it has dependencies to/from statements that will be extracted |
6 | Type int of variable l does not match with type char of variable lent |
7 | Unmatched statement minLen=l; cannot be moved before or after the extracted code, because it has dependencies to/from statements that will be extracted |
8 | Unmatched statement minLen=lent; cannot be moved before or after the extracted code, because it has dependencies to/from statements that will be extracted |