public Shape[] createShapes(int count) {
Shape[] shapes = new Shape[count];
for (int idx=0; idx < count; idx++) {
shapes[idx] = nextShape();
}
return shapes;
public Shape[] createShapes(int count) {
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:
|
|
Method name:
|
Number of AST nodes: 0
|
|
Number of AST nodes: 0
|
|
1 | public Shape[] createShapes(int count) {↵ | | 1 | public Shape[] createShapes(int count) {↵
|
2 | Shape[] shapes = new Shape[count];↵ | | 2 | Shape[] shapes = new Shape[count];↵
|
3 | for (int idx=0; idx < count; idx++) {↵ | | 3 | for (int idx=0; idx < count; idx++) {↵
|
4 | shapes[idx] = nextShape();↵ | | 4 | shapes[idx] = nextShape();↵
|
5 | }↵ | | 5 | }↵
|
6 | return shapes;↵ | | 6 | return shapes;↵
|
7 | | | 7 |
|
See real code fragment |
|
See real code fragment |
Summary
Number of common nesting structure subtrees | 0 |
Number of refactorable cases | 0 |
Number of non-refactorable cases | 0 |
Time elapsed for finding largest common nesting structure subtrees (ms) | 0.0 |
Clones location | |
Number of node comparisons | 0 |