byte[] result = new byte[2];
result[0] = (byte) (value & 0xFF);
result[1] = (byte) ((value & 0xFF00) >> 8);
return result;
byte[] result = new byte[2];
result[0] = (byte) (value & 0xFF);
result[1] = (byte) ((value & 0xFF00) >> 8);
return result;
Clone fragments detected by clone detection tool
File path: /apache-ant-1.7.0/src/org/apache/tools/zip/ZipShort.java
|
|
File path: /apache-ant-1.7.0/src/org/apache/tools/zip/ZipShort.java
|
Method name: byte[] getBytes()
|
|
Method name: byte[] getBytes(int)
|
Number of AST nodes: 4
|
|
Number of AST nodes: 4
|
|
1 | byte[] result = new byte[2];↵ | | 1 | byte[] result = new byte[2];↵
|
2 | result[0] = (byte) (value & 0xFF);↵ | | 2 | result[0] = (byte) (value & 0xFF);↵
|
3 | result[1] = (byte) ((value & 0xFF00) >> 8);↵ | | 3 | result[1] = (byte) ((value & 0xFF00) >> 8);↵
|
4 | return result; | | 4 | return result;
|
See real code fragment |
|
See real code fragment |
Summary
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.0 |
Clones location | Clones are declared in the same class |
Number of node comparisons | 16 |
-
{Refactorable}
Mapping Summary
Number of mapped statements | 4 |
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) | 0.0 |
Clone type | Type 1 |
Mapped Statements
ID |
Statement |
|
ID |
Statement |
1 | byte[] result = new byte[2]; | | 1 | byte[] result = new byte[2]; |
2 | result[0] = (byte)(value & 0xFF); | | 2 | result[0] = (byte)(value & 0xFF); |
3 | result[1] = (byte)((value & 0xFF00) >> 8); | | 3 | result[1] = (byte)((value & 0xFF00) >> 8); |
4 | return result; | | 4 | return result; |
Precondition Violations (0)
Row |
Violation |