int minLen = 32;
int maxLen = 0;
final char[] len_t = len[t];
int minLen = 32;
int maxLen = 0;
final byte[] len_t = len[t];
Clone fragments detected by clone detection tool
File path: /apache-ant-1.7.0/src/org/apache/tools/bzip2/CBZip2InputStream.java
|
|
File path: /apache-ant-1.7.0/src/org/apache/tools/bzip2/CBZip2OutputStream.java
|
Method name: void createHuffmanDecodingTables(int, int)
|
|
Method name: void sendMTFValues3(int, int)
|
Number of AST nodes: 3
|
|
Number of AST nodes: 3
|
|
1 | int minLen = 32;↵ | | 1 | int minLen = 32;↵
|
2 | int maxLen = 0;↵ | | 2 | int maxLen = 0;↵
|
3 | final char[] len_t = len[t]; | | 3 | final byte[] len_t = len[t];
|
See real code fragment |
|
See real code fragment |
Summary
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.0 |
Clones location | Clones are in different classes |
Number of node comparisons | 15 |
-
{Non-refactorable}
Mapping Summary
Number of mapped statements | 2 |
Number of unmapped statements in the first code fragment | 1 |
Number of unmapped statements in the second code fragment | 1 |
Time elapsed for statement mapping (ms) | 0.0 |
Clone type | Type 2 |
Mapped Statements
ID |
Statement |
|
ID |
Statement |
8 | int minLen = 32; | | 4 | int minLen = 32; |
9 | int maxLen = 0; | | 5 | int maxLen = 0; |
| | | 6 | final byte[] len_t = len[t]; |
10 | final char[] len_t = len[t]; | | | |
Precondition Violations (1)
Row |
Violation |
1 | Clone fragment #1 returns variables maxLen, minLen , while Clone fragment #2 returns variables maxLen, minLen |