Shape[] shapes = new Shape[count];
for (int idx=0; idx < count; idx++) {
shapes[idx] = nextShape();
}
return shapes;
Shape[] shapes = new Shape[count];
for (int idx=0; idx < count; idx++) {
shapes[idx] = nextShape();
}
return shapes;
Clone fragments detected by clone detection tool
File path: /jakarta-jmeter-2.3.2/src/org/apache/jmeter/testelement/LineChart.java
|
|
File path: /jakarta-jmeter-2.3.2/src/org/apache/jmeter/visualizers/LineGraph.java
|
Method name: Shape[] createShapes(int)
|
|
Method name: Shape[] createShapes(int)
|
Number of AST nodes: 4
|
|
Number of AST nodes: 4
|
|
1 | Shape[] shapes = new Shape[count];↵ | | 1 | Shape[] shapes = new Shape[count];↵
|
2 | for (int idx=0; idx < count; idx++) {↵ | | 2 | for (int idx=0; idx < count; idx++) {↵
|
3 | shapes[idx] = nextShape();↵ | | 3 | shapes[idx] = nextShape();↵
|
4 | }↵ | | 4 | }↵
|
5 | return shapes; | | 5 | return shapes;
|
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 in different classes |
Number of node comparisons | 8 |
-
{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.6 |
Clone type | Type 1 |
Mapped Statements
ID |
Statement |
|
ID |
Statement |
1 | Shape[] shapes = new Shape[count]; | | 1 | Shape[] shapes = new Shape[count]; |
2 | for (int idx = 0; idx < count; idx++) | | 2 | for (int idx = 0; idx < count; idx++) |
3 | shapes[idx] = nextShape(); | | 3 | shapes[idx] = nextShape(); |
4 | return shapes; | | 4 | return shapes; |
Precondition Violations (0)
Row |
Violation |