File path: /jfreechart-1.0.10/src/org/jfree/chart/plot/Plot.java | File path: /jfreechart-1.0.10/src/org/jfree/chart/plot/Plot.java | |||
Method name: double getRectX(double, double, double, RectangleEdge)
|
Method name: double getRectY(double, double, double, RectangleEdge)
|
|||
Number of AST nodes: 6 | Number of AST nodes: 6 | |||
1 | double result = x;↵ | 1 | double result = y;↵ | |
2 | if (edge == RectangleEdge.LEFT) {↵ | 2 | if (edge == RectangleEdge.TOP) {↵ | |
3 | result = result + w1;↵ | 3 | result = result + h1;↵ | |
4 | }↵ | 4 | }↵ | |
5 | else if (edge == RectangleEdge.RIGHT) {↵ | 5 | else if (edge == RectangleEdge.BOTTOM) {↵ | |
6 | result = result + w2;↵ | 6 | result = result + h2;↵ | |
7 | }↵ | 7 | }↵ | |
8 | return result; | 8 |
| |
See real code fragment | See real code fragment |
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.4 |
Clones location | Clones are declared in the same class |
Number of node comparisons | 17 |
Number of mapped statements | 6 |
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.9 |
Clone type | Type 2 |
ID | Statement | ID | Statement | |||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1 | double result = x; |
| 1 | double result = y; | ||||||||||
2 | if (edge == RectangleEdge.LEFT) |
| 2 | if (edge == RectangleEdge.TOP) | ||||||||||
3 | result = result + w1; |
| 3 | result = result + h1; | ||||||||||
4 | else if (edge == RectangleEdge.RIGHT) |
| 4 | else if (edge == RectangleEdge.BOTTOM) | ||||||||||
5 | result = result + w2; |
| 5 | result = result + h2; | ||||||||||
6 | return result; | 6 | return result; |
Row | Violation |
---|