for (int j = 0; j < receivedBytes; ++j)
{
result.append((char)bytes[j]);
}
receivedBytes = 0;
for (int j = 0; j < receivedBytes; ++j)
{
result.append((char)bytes[j]);
}
receivedBytes = 0;
Clone fragments detected by clone detection tool
File path: /emf-2.4.1/src/org/eclipse/emf/common/util/URI.java
|
|
File path: /emf-2.4.1/src/org/eclipse/emf/common/util/URI.java
|
Method name: String decode(String)
|
|
Method name: String decode(String)
|
Number of AST nodes: 3
|
|
Number of AST nodes: 3
|
|
1 | for (int j = 0; j < receivedBytes; ++j)↵ | | 1 | for (int j = 0; j < receivedBytes; ++j)↵
|
2 | {↵ | | 2 | ↵
|
3 | ↵ | | 3 | {↵
|
4 | result.append((char)bytes[j]);↵ | | 4 | result.append((char)bytes[j]);↵
|
5 | }↵ | | 5 | ↵
|
6 | ↵ | | 6 | }↵
|
7 | receivedBytes = 0; | | 7 | receivedBytes = 0;
|
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 | 13 |
-
{Refactorable}
Mapping Summary
Number of mapped statements | 3 |
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.8 |
Clone type | Type 1 |
Mapped Statements
ID |
Statement |
|
ID |
Statement |
42 | for (int j = 0; j < receivedBytes; ++j) | | 46 | for (int j = 0; j < receivedBytes; ++j) |
43 | result.append((char)bytes[j]); | | 47 | result.append((char)bytes[j]); |
44 | receivedBytes = 0; | | 48 | receivedBytes = 0; |
Precondition Violations (0)
Row |
Violation |