double min = Math.min(linkW, linkH) / 2;
linkX = (linkX + linkX + linkW) / 2 - min;
linkY = (linkY + linkY + linkH) / 2 - min;
linkW = 2 * min;
linkH = 2 * min;
double min = Math.min(linkW, linkH) / 2;
linkX = (linkX + linkX + linkW) / 2 - min;
linkY = (linkY + linkY + linkH) / 2 - min;
linkW = 2 * min;
linkH = 2 * min;
Clone fragments detected by clone detection tool
File path: /jfreechart-1.0.10/src/org/jfree/chart/plot/PiePlot.java
|
|
File path: /jfreechart-1.0.10/src/org/jfree/chart/plot/PiePlot3D.java
|
Method name: void drawPie(Graphics2D, Rectangle2D, PlotRenderingInfo)
|
|
Method name: void draw(Graphics2D, Rectangle2D, Point2D, PlotState, PlotRenderingInfo)
|
Number of AST nodes: 5
|
|
Number of AST nodes: 5
|
|
1 | double min = Math.min(linkW, linkH) / 2;↵ | | 1 | double min = Math.min(linkW, linkH) / 2;↵
|
2 | linkX = (linkX + linkX + linkW) / 2 - min;↵ | | 2 | linkX = (linkX + linkX + linkW) / 2 - min;↵
|
3 | linkY = (linkY + linkY + linkH) / 2 - min;↵ | | 3 | linkY = (linkY + linkY + linkH) / 2 - min;↵
|
4 | linkW = 2 * min;↵ | | 4 | linkW = 2 * min;↵
|
5 | linkH = 2 * min; | | 5 | linkH = 2 * min;
|
See real code fragment |
|
See real code fragment |
Summary
Number of common nesting structure subtrees | 1 |
Number of refactorable cases | 0 |
Number of non-refactorable cases | 1 |
Time elapsed for finding largest common nesting structure subtrees (ms) | 0.0 |
Clones location | Clones are in different classes having the same super class |
Number of node comparisons | 25 |
-
{Non-refactorable}
Mapping Summary
Number of mapped statements | 5 |
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.0 |
Clone type | Type 1 |
Mapped Statements
ID |
Statement |
|
ID |
Statement |
21 | double min = Math.min(linkW, linkH) / 2; | | 30 | double min = Math.min(linkW, linkH) / 2; |
22 | linkX = (linkX + linkX + linkW) / 2 - min; | | 31 | linkX = (linkX + linkX + linkW) / 2 - min; |
23 | linkY = (linkY + linkY + linkH) / 2 - min; | | 32 | linkY = (linkY + linkY + linkH) / 2 - min; |
24 | linkW = 2 * min; | | 33 | linkW = 2 * min; |
25 | linkH = 2 * min; | | 34 | linkH = 2 * min; |
Precondition Violations (1)
Row |
Violation |
1 | Clone fragment #1 returns variables linkX, linkY, linkW, linkH , while Clone fragment #2 returns variables linkX, linkY, linkW, linkH |