for (int i = indents.size() - 1; i < nesting; ++i)
{
indents.add(indents.get(i) + " ");
}
return indents.get(nesting);
for (int i = indents.size() - 1; i < nesting; ++i)
{
indents.add(indents.get(i) + " ");
}
return indents.get(nesting);
Clone fragments detected by clone detection tool
File path: /emf-2.4.1/src/org/eclipse/emf/ecore/xmi/impl/XMLString.java
|
|
File path: /emf-2.4.1/src/org/eclipse/emf/ecore/xmi/impl/XMLString.java
|
Method name: String getElementIndent(int)
|
|
Method name: String getAttributeIndent()
|
Number of AST nodes: 3
|
|
Number of AST nodes: 3
|
|
1 | for (int i = indents.size() - 1; i < nesting; ++i)↵ | | 1 | for (int i = indents.size() - 1; i < nesting; ++i)↵
|
2 | {↵ | | 2 | {↵
|
3 | indents.add(indents.get(i) + " ");↵ | | 3 | indents.add(indents.get(i) + " ");↵
|
4 | }↵ | | 4 | }↵
|
5 | return indents.get(nesting); | | 5 | return indents.get(nesting);
|
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 | 5 |
-
{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.4 |
Clone type | Type 1 |
Mapped Statements
ID |
Statement |
|
ID |
Statement |
2 | for (int i = indents.size() - 1; i < nesting; ++i) | | 2 | for (int i = indents.size() - 1; i < nesting; ++i) |
3 | indents.add(indents.get(i) + " "); | | 3 | indents.add(indents.get(i) + " "); |
4 | return indents.get(nesting); | | 4 | return indents.get(nesting); |
Precondition Violations (0)
Row |
Violation |