if (edge == RectangleEdge.TOP) {
used = findMaximumTickLabelHeight(ticks, g2, plotArea,
isVerticalTickLabels());
state.cursorUp(used);
}
else if (edge == RectangleEdge.BOTTOM) {
used = findMaximumTickLabelHeight(ticks, g2, plotArea,
isVerticalTickLabels());
state.cursorDown(used);
}
shape = getItemShape(series, item);
if (orientation == PlotOrientation.VERTICAL) {
shape = ShapeUtilities.createTranslatedShape(shape, transX1,
transY1);
}
else if (orientation == PlotOrientation.HORIZONTAL) {
shape = ShapeUtilities.createTranslatedShape(shape, transY1,
transX1);
}
g2.draw(shape);
Clone fragments detected by clone detection tool
File path: /jfreechart-1.0.10/src/org/jfree/chart/axis/ValueAxis.java
|
|
File path: /jfreechart-1.0.10/src/org/jfree/chart/renderer/xy/XYAreaRenderer.java
|
Method name: AxisState drawTickMarksAndLabels(Graphics2D, double, Rectangle2D, Rectangle2D, RectangleEdge)
|
|
Method name: void drawItem(Graphics2D, XYItemRendererState, Rectangle2D, PlotRenderingInfo, XYPlot, ValueAxis, ValueAxis, XYDataset, int, int, CrosshairState, int)
|
Number of AST nodes: 6
|
|
Number of AST nodes: 6
|
|
1 | if (edge == RectangleEdge.TOP) {↵ | | 1 | shape = ↵
|
2 | used = findMaximumTickLabelHeight(ticks, g2, plotArea,↵ | | |
|
3 | isVerticalTickLabels());↵ | | |
|
4 | state.cursorUp(used);↵ | | |
|
5 | }↵ | | |
|
6 | else if (edge == RectangleEdge.BOTTOM) {↵ | | |
|
7 | used = findMaximumTickLabelHeight(ticks, g2, plotArea,↵ | | |
|
8 | isVerticalTickLabels());↵ | | |
|
9 | state.cursorDown(used);↵ | | |
|
10 | } | | 2 | getItemShape(series, item);↵
|
| | | 3 | if (orientation == PlotOrientation.VERTICAL) {↵
|
| | | 4 | shape = ShapeUtilities.createTranslatedShape(shape, transX1, ↵
|
| | | 5 | transY1);↵
|
| | | 6 | }↵
|
| | | 7 | else if (orientation == PlotOrientation.HORIZONTAL) {↵
|
| | | 8 | shape = ShapeUtilities.createTranslatedShape(shape, transY1, ↵
|
| | | 9 | transX1);↵
|
| | | 10 | }↵
|
| | | 11 | g2.draw(shape);
|
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.5 |
Clones location | Clones are in different classes |
Number of node comparisons | 4 |