for (int i = 0; i < attributes.getLength(); i++)
{
Node item = attributes.item(i);
if (item == node)
{
return i;
}
}
for (int i = 0; i < attributes.getLength(); i++)
{
Node item = attributes.item(i);
if (item == node)
{
return i;
}
}
Clone fragments detected by clone detection tool
File path: /emf-2.4.1/src/org/eclipse/emf/ecore/xmi/impl/XMLLoadImpl.java
|
|
File path: /emf-2.4.1/src/org/eclipse/emf/ecore/xmi/impl/XMLLoadImpl.java
|
Method name: int getIndex(String, String)
|
|
Method name: int getIndex(String)
|
Number of AST nodes: 4
|
|
Number of AST nodes: 4
|
|
1 | for (int i = 0; i < attributes.getLength(); i++)↵ | | 1 | for (int i = 0; i < attributes.getLength(); i++)↵
|
2 | {↵ | | 2 | {↵
|
3 | Node item = attributes.item(i);↵ | | 3 | Node item = attributes.item(i);↵
|
4 | if (item == node)↵ | | 4 | if (item == node)↵
|
5 | {↵ | | 5 | {↵
|
6 | return i;↵ | | 6 | return i;↵
|
7 | }↵ | | 7 | }↵
|
8 | } | | 8 | }
|
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 declared in the same class |
Number of node comparisons | 9 |
-
{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.4 |
Clone type | Type 1 |
Mapped Statements
ID |
Statement |
|
ID |
Statement |
3 | for (int i = 0; i < attributes.getLength(); i++) | | 3 | for (int i = 0; i < attributes.getLength(); i++) |
4 | Node item = attributes.item(i); | | 4 | Node item = attributes.item(i); |
5 | | | 5 | |
6 | | | 6 | |
Precondition Violations (0)
Row |
Violation |