if ((meanValue.doubleValue() + valueDelta) > rangeAxis.getRange().getUpperBound()) { highVal = rangeAxis.valueToJava2D( rangeAxis.getRange().getUpperBound(), dataArea, yAxisLocation); } else { highVal = rangeAxis.valueToJava2D(meanValue.doubleValue() + valueDelta, dataArea, yAxisLocation); }
if ((meanValue.doubleValue() + valueDelta) < rangeAxis.getRange().getLowerBound()) { lowVal = rangeAxis.valueToJava2D( rangeAxis.getRange().getLowerBound(), dataArea, yAxisLocation); } else { lowVal = rangeAxis.valueToJava2D(meanValue.doubleValue() - valueDelta, dataArea, yAxisLocation); }
Clone fragments detected by clone detection tool
File path: /jfreechart-1.0.10/src/org/jfree/chart/renderer/category/StatisticalLineAndShapeRenderer.java File path: /jfreechart-1.0.10/src/org/jfree/chart/renderer/category/StatisticalLineAndShapeRenderer.java
Method name: void drawItem(Graphics2D, CategoryItemRendererState, Rectangle2D, CategoryPlot, CategoryAxis, ValueAxis, CategoryDataset, int, int, int) Method name: void drawItem(Graphics2D, CategoryItemRendererState, Rectangle2D, CategoryPlot, CategoryAxis, ValueAxis, CategoryDataset, int, int, int)
Number of AST nodes: 3 Number of AST nodes: 3
1
if ((meanValue.doubleValue() + valueDelta)
1
if ((meanValue.doubleValue() + valueDelta)
2
                > rangeAxis.getRange().getUpperBound()) {
2
                < rangeAxis.getRange().getLowerBound()) {
3
            highVal = rangeAxis.valueToJava2D(
3
            lowVal = rangeAxis.valueToJava2D(
4
                    rangeAxis.getRange().getUpperBound(), dataArea,
4
                    rangeAxis.getRange().getLowerBound(), dataArea,
5
                    yAxisLocation);
5
                    yAxisLocation);
6
        }
6
        }
7
        else {
7
        else {
8
            highVal = rangeAxis.valueToJava2D(meanValue.doubleValue()
8
            lowVal = rangeAxis.valueToJava2D(meanValue.doubleValue()
9
                    + valueDelta, dataArea, yAxisLocation);
9
                    - valueDelta, dataArea, yAxisLocation);
10
        }
10
        }
Summary
Number of common nesting structure subtrees0
Number of refactorable cases0
Number of non-refactorable cases0
Time elapsed for finding largest common nesting structure subtrees (ms)0.3
Clones locationClones are in the same method
Number of node comparisons1