if (isInverted()) { result = maxX + ((value - axisMin) / (axisMax - axisMin)) * (minX - maxX); } else { result = minX + ((value - axisMin) / (axisMax - axisMin)) * (maxX - minX); }
if (isInverted()) { result = axisMax - ((java2DValue - min) / (max - min) * (axisMax - axisMin)); } else { result = axisMin + ((java2DValue - min) / (max - min) * (axisMax - axisMin)); }
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
if (isInverted()) {
1
if (isInverted()) {
2
                result = maxX + ((value - axisMin) / (axisMax - axisMin))
2
             result = axisMax - ((java2DValue - min) / (max - min) 
3
                         * (minX - maxX);
3
                      * (axisMax - ax
4
    
4
isMin));
5
        }
5
        }
6
            else {
6
        else {
7
                result = minX + ((value - axisMin) / (axisMax - axisMin))
7
             result = axisMin + ((java2DValue - min) / (max - min) 
8
                         * (maxX - minX);
8
                      * (axisMax - axisMin));
9
            }
9
        }
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