buffWriter.newLine();
for (int i = 0; i < justIndex; i++)
{
buffWriter.write('\t');
}
buffWriter.newLine();
for (int i = 0; i < justIndex; i++)
{
buffWriter.write('\t');
}
Clone fragments detected by clone detection tool
File path: /emf-2.4.1/src/org/eclipse/emf/importer/rose/parser/RoseWriter.java
|
|
File path: /emf-2.4.1/src/org/eclipse/emf/importer/rose/parser/RoseWriter.java
|
Method name: void writeList(RoseNode)
|
|
Method name: void writePair(RoseNode)
|
Number of AST nodes: 3
|
|
Number of AST nodes: 3
|
|
1 | buffWriter.newLine();↵ | | 1 | buffWriter.newLine();↵
|
2 | for (int i = 0; i < justIndex; i++)↵ | | 2 | for (int i = 0; i < justIndex; i++)↵
|
3 | {↵ | | 3 | ↵
|
4 | ↵ | | 4 | {↵
|
5 | buffWriter.write('\t');↵ | | 5 | buffWriter.write('\t');↵
|
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.1 |
Clones location | Clones are declared in the same class |
Number of node comparisons | 7 |
-
{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) | 0.6 |
Clone type | Type 1 |
Mapped Statements
ID |
Statement |
|
ID |
Statement |
10 | buffWriter.newLine(); | | 2 | buffWriter.newLine(); |
11 | for (int i = 0; i < justIndex; i++) | | 3 | for (int i = 0; i < justIndex; i++) |
12 | | | 4 | |
Precondition Violations (0)
Row |
Violation |