data[length++] = (byte)(i >>> 24);
data[length++] = (byte)(i >>> 16);
data[length++] = (byte)(i >>> 8);
data[length++] = (byte)i;
data[length++] = (byte)(i >>> 24);
data[length++] = (byte)(i >>> 16);
data[length++] = (byte)(i >>> 8);
data[length++] = (byte)i;
Clone fragments detected by clone detection tool
File path: /jEdit-4.2/src/org/objectweb/asm/ByteVector.java
|
|
File path: /jEdit-4.2/src/org/objectweb/asm/ByteVector.java
|
Method name: ByteVector put4(int)
|
|
Method name: ByteVector put8(long)
|
Number of AST nodes: 4
|
|
Number of AST nodes: 4
|
|
1 | data[length++] = (byte)(i >>> 24);↵ | | 1 | data[length++] = (byte)(i >>> 24);↵
|
2 | data[length++] = (byte)(i >>> 16);↵ | | 2 | data[length++] = (byte)(i >>> 16);↵
|
3 | data[length++] = (byte)(i >>> 8);↵ | | 3 | data[length++] = (byte)(i >>> 8);↵
|
4 | data[length++] = (byte)i; | | 4 | data[length++] = (byte)i;
|
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 |
5 | data[length++] = (byte)(i >>> 24); | | 11 | data[length++] = (byte)(i >>> 24); |
6 | data[length++] = (byte)(i >>> 16); | | 12 | data[length++] = (byte)(i >>> 16); |
7 | data[length++] = (byte)(i >>> 8); | | 13 | data[length++] = (byte)(i >>> 8); |
8 | data[length++] = (byte)i; | | 14 | data[length++] = (byte)i; |
Precondition Violations (0)
Row |
Violation |