else if (RectangleEdge.isLeftOrRight(edge)) { double minY = area.getMinY(); double maxY = area.getMaxY(); if (isInverted()) { result = minY + (((value - axisMin) / (axisMax - axisMin)) * (maxY - minY)); } else { result = maxY - (((value - axisMin) / (axisMax - axisMin)) * (maxY - minY));
else if (RectangleEdge.isLeftOrRight(edge)) { double minY = area.getMinY(); double maxY = area.getMaxY(); if (isInverted()) { result = minY + (((value - axisMin) / (axisMax - axisMin)) * (maxY - minY)); } else { result = maxY - (((value - axisMin) / (axisMax - axisMin)) * (maxY - minY));
Clone fragments detected by clone detection tool
File path: /jfreechart-1.0.10/src/org/jfree/chart/axis/DateAxis.java File path: /jfreechart-1.0.10/src/org/jfree/chart/axis/PeriodAxis.java
Method name: Method name:
Number of AST nodes: 0 Number of AST nodes: 0
1
else if (RectangleEdge.isLeftOrRight(edge)) {
1
else if (RectangleEdge.isLeftOrRight(edge)) {
2
            double minY = area.getMinY();
2
            double minY = area.getMinY();
3
            double maxY = area.getMaxY();
3
            double maxY = area.getMaxY();
4
            if (isInverted()) {
4
            if (isInverted()) {
5
                result = minY + (((value - axisMin) / (axisMax - axisMin))
5
                result = minY + (((value - axisMin) / (axisMax - axisMin)) 
6
                         * (maxY - minY));
6
                         * (maxY - minY));
7
            }
7
            }
8
            else {
8
            else {
9
                result = maxY - (((value - axisMin) / (axisMax - axisMin))
9
                result = maxY - (((value - axisMin) / (axisMax - axisMin)) 
10
                         * (maxY - minY));
10
                         * (maxY - minY));
11
            
11
            
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.0
Clones location
Number of node comparisons0