1506-2-3

if (isInverted()) { result = axisMax - ((java2DValue - min) / (max - min) * (axisMax - axisMin)); } else { result = axisMin + ((java2DValue - min) / (max - min) * (axisMax - axisMin)); }
if (isInverted()) { result = maxX + ((value - axisMin) / (axisMax - axisMin)) * (minX - maxX); } else { result = minX + ((value - axisMin) / (axisMax - axisMin)) * (maxX - minX); }

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 = axisMax - ((java2DValue - min) / (max - min)↵

2

                    result = maxX + ((value - axisMin) / (↵

3

    axisMax - axisMin)) ↵

3

                          * (axisMax - axisMin));↵

4

                             * (minX - max↵

5

    X);↵

4

            }↵

6

                }↵

5

            else {↵

7

                else {↵

6

                 result = axisMin + ((java2DValue - min) / (max - min)↵

8

                    result = minX + ((value - axisMin) / (↵

9

    axisMax - axisMin)) ↵

7

                          * (axisMax - axisMin));↵

10

                             * (maxX - minX);↵

8

            }

11

                }

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.0
Clones location |
Number of node comparisons | 0