File path: /jfreechart-1.0.10/src/org/jfree/chart/renderer/xy/XYDifferenceRenderer.java | File path: /jfreechart-1.0.10/src/org/jfree/chart/renderer/xy/XYDifferenceRenderer.java | |||
Method name: void drawItemPass0(Graphics2D, Rectangle2D, PlotRenderingInfo, XYPlot, ValueAxis, ValueAxis, XYDataset, int, int, CrosshairState)
|
Method name: void drawItemPass0(Graphics2D, Rectangle2D, PlotRenderingInfo, XYPlot, ValueAxis, ValueAxis, XYDataset, int, int, CrosshairState)
|
|||
Number of AST nodes: 13 | Number of AST nodes: 13 | |||
1 | l_x1 = x_dataset.getXValue(0, l_minuendItem);↵ | 1 | l_x3 = x_dataset.getXValue(1, l_subtrahendItem);↵ | |
2 | l_y1 = x_dataset.getYValue(0, l_minuendItem);↵ | 2 | l_y3 = x_dataset.getYValue(1, l_subtrahendItem);↵ | |
3 | l_minuendCurX = new Double(l_x1);↵ | 3 | l_subtrahendCurX = new Double(l_x3);↵ | |
4 | l_minuendCurY = new Double(l_y1);↵ | 4 | l_subtrahendCurY = new Double(l_y3);↵ | |
5 | if (!b_minuendAtIntersect) {↵ | 5 | if (!b_subtrahendAtIntersect) {↵ | |
6 | l_minuendXs.add(l_minuendCurX);↵ | 6 | l_subtrahendXs.add(l_subtrahendCurX);↵ | |
7 | l_minuendYs.add(l_minuendCurY);↵ | 7 | l_subtrahendYs.add(l_subtrahendCurY);↵ | |
8 | }↵ | 8 | }↵ | |
9 | l_minuendMaxY = Math.max(l_minuendMaxY, l_y1);↵ | 9 | l_subtrahendMaxY = Math.max(l_subtrahendMaxY, l_y3);↵ | |
10 | l_minuendMinY = Math.min(l_minuendMinY, l_y1);↵ | 10 | l_subtrahendMinY = Math.min(l_subtrahendMinY, l_y3);↵ | |
11 | l_x2 = x_dataset.getXValue(0, l_minuendItem + 1);↵ | 11 | l_x4 = x_dataset.getXValue(1, l_subtrahendItem + 1);↵ | |
12 | l_y2 = x_dataset.getYValue(0, l_minuendItem + 1);↵ | 12 | l_y4 = x_dataset.getYValue(1, l_subtrahendItem + 1);↵ | |
13 | l_minuendNextX = new Double(l_x2);↵ | 13 | l_subtrahendNextX = new Double(l_x4);↵ | |
14 | l_minuendNextY = new Double(l_y2); | 14 | l_subtrahendNextY = new Double(l_y4); | |
See real code fragment | See real code fragment |
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.2 |
Clones location | Clones are in the same method |
Number of node comparisons | 114 |
Number of mapped statements | 13 |
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) | 18.3 |
Clone type | Type 2 |
ID | Statement | ID | Statement | |||||||||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
106 | l_x1 = x_dataset.getXValue(0, l_minuendItem); |
| 120 | l_x3 = x_dataset.getXValue(1, l_subtrahendItem); | ||||||||||||||||
107 | l_y1 = x_dataset.getYValue(0, l_minuendItem); |
| 121 | l_y3 = x_dataset.getYValue(1, l_subtrahendItem); | ||||||||||||||||
108 | l_minuendCurX = new Double(l_x1); |
| 122 | l_subtrahendCurX = new Double(l_x3); | ||||||||||||||||
109 | l_minuendCurY = new Double(l_y1); |
| 123 | l_subtrahendCurY = new Double(l_y3); | ||||||||||||||||
110 | if (!b_minuendAtIntersect) |
| 124 | if (!b_subtrahendAtIntersect) | ||||||||||||||||
111 | l_minuendXs.add(l_minuendCurX); |
| 125 | l_subtrahendXs.add(l_subtrahendCurX); | ||||||||||||||||
112 | l_minuendYs.add(l_minuendCurY); |
| 126 | l_subtrahendYs.add(l_subtrahendCurY); | ||||||||||||||||
113 | l_minuendMaxY = Math.max(l_minuendMaxY, l_y1); |
| 127 | l_subtrahendMaxY = Math.max(l_subtrahendMaxY, l_y3); | ||||||||||||||||
114 | l_minuendMinY = Math.min(l_minuendMinY, l_y1); |
| 128 | l_subtrahendMinY = Math.min(l_subtrahendMinY, l_y3); | ||||||||||||||||
115 | l_x2 = x_dataset.getXValue(0, l_minuendItem + 1); |
| 129 | l_x4 = x_dataset.getXValue(1, l_subtrahendItem + 1); | ||||||||||||||||
116 | l_y2 = x_dataset.getYValue(0, l_minuendItem + 1); |
| 130 | l_y4 = x_dataset.getYValue(1, l_subtrahendItem + 1); | ||||||||||||||||
117 | l_minuendNextX = new Double(l_x2); |
| 131 | l_subtrahendNextX = new Double(l_x4); | ||||||||||||||||
118 | l_minuendNextY = new Double(l_y2); |
| 132 | l_subtrahendNextY = new Double(l_y4); |
Row | Violation |
---|---|
1 | Clone fragment #1 returns variables l_x2, l_y2, l_x1, l_y1, l_minuendCurX, l_minuendCurY, l_minuendMaxY, l_minuendMinY, l_minuendNextX, l_minuendNextY , while Clone fragment #2 returns variables l_x4, l_y4, l_x3, l_y3, l_subtrahendCurX, l_subtrahendCurY, l_subtrahendMaxY, l_subtrahendMinY, l_subtrahendNextX, l_subtrahendNextY |