for (int i = 0; i < 2; ++i)
{
// time_mid
//
uuid[i + 4] = (byte)((currentTime >> 8 * (1 - i) + 32) & 0xFFL);
}
for (int i = 0; i < 2; ++i)
{
// time_hi
//
uuid[i + 6] = (byte)((currentTime >> 8 * (1 - i) + 48) & 0xFFL);
}
Clone fragments detected by clone detection tool
File path: /emf-2.4.1/src/org/eclipse/emf/ecore/util/EcoreUtil.java
|
|
File path: /emf-2.4.1/src/org/eclipse/emf/ecore/util/EcoreUtil.java
|
Method name: void updateCurrentTime()
|
|
Method name: void updateCurrentTime()
|
Number of AST nodes: 2
|
|
Number of AST nodes: 2
|
|
1 | for (int i = 0; i < 2; ++i)↵ | | 1 | for (int i = 0; i < 2; ++i)↵
|
2 | {↵ | | 2 | {↵
|
3 | // time_mid↵ | | 3 | // time_hi↵
|
4 | //↵ | | 4 | //↵
|
5 | uuid[i + 4] = (byte)((currentTime >> 8 * (1 - i) + 32) & 0xFFL);↵ | | 5 | uuid[i + 6] = (byte)((currentTime >> 8 * (1 - i) + 48) & 0xFFL);↵
|
6 | } | | 6 | }
|
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.2 |
Clones location | Clones are in the same method |
Number of node comparisons | 9 |
-
{Refactorable}
Mapping Summary
Number of mapped statements | 2 |
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 2 |
Mapped Statements
ID |
Statement |
|
ID |
Statement |
26 | for (int i = 0; i < 2; ++i) | | 28 | for (int i = 0; i < 2; ++i) |
27 | uuid[i + 4] = (byte)((currentTime >> 8 * (1 - i) + 32) & 0xFFL); | | 29 | uuid[i + 6] = (byte)((currentTime >> 8 * (1 - i) + 48) & 0xFFL); |
Precondition Violations (0)
Row |
Violation |