439-1-2

if (RectangleEdge.isTopOrBottom(edge)) { double minX = area.getX(); double maxX = area.getMaxX(); if (isInverted()) { result = maxX + ((value - axisMin) / (axisMax - axisMin)) * (minX - maxX); } else { result = minX + ((value - axisMin) / (axisMax - axisMin)) * (maxX - minX); } } 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)); } }
if (RectangleEdge.isTopOrBottom(edge)) { double minX = area.getX(); double maxX = area.getMaxX(); if (isInverted()) { result = maxX + ((value - axisMin) / (axisMax - axisMin)) * (minX - maxX); } else { result = minX + ((value - axisMin) / (axisMax - axisMin)) * (maxX - minX); } } 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: `double valueToJava2D(double, Rectangle2D, RectangleEdge)` |  | Method name: `double valueToJava2D(double, Rectangle2D, RectangleEdge)`
Number of AST nodes: 12 |  | Number of AST nodes: 12

1

    if (RectangleEdge.isTopOrBottom(edge)) {↵

1

    if (RectangleEdge.isTopOrBottom(edge)) {↵

2

                double minX = area.getX();↵

2

                double minX = area.getX();↵

3

                double maxX = area.getMaxX();↵

3

                double maxX = area.getMaxX();↵

4

                if (isInverted()) {↵

4

                if (isInverted()) {↵

5

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

5

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

6

                             * (minX - maxX);↵

6

                             * (minX - maxX);↵

7

                }↵

7

                }↵

8

                else {↵

8

                else {↵

9

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

9

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

10

                             * (maxX - minX);↵

10

                             * (maxX - minX);↵

11

                }↵

11

                }↵

12

            }↵

12

            }↵

13

            else if (RectangleEdge.isLeftOrRight(edge)) {↵

13

            else if (RectangleEdge.isLeftOrRight(edge)) {↵

14

                double minY = area.getMinY();↵

14

                double minY = area.getMinY();↵

15

                double maxY = area.getMaxY();↵

15

                double maxY = area.getMaxY();↵

16

                if (isInverted()) {↵

16

                if (isInverted()) {↵

17

                    result = minY + (((value - axisMin) / (axisMax - axisMin))↵

17

                    result = minY + (((value - axisMin) / (axisMax - axisMin)) ↵

18

                             * (maxY - minY));↵

18

                             * (maxY - minY));↵

19

                }↵

19

                }↵

20

                else {↵

20

                else {↵

21

                    result = maxY - (((value - axisMin) / (axisMax - axisMin))↵

21

                    result = maxY - (((value - axisMin) / (axisMax - axisMin)) ↵

22

                             * (maxY - minY));↵

22

                             * (maxY - minY));↵

23

                }↵

23

                }↵

24

            }

24

            }

See real code fragment |  | See real code fragment

Summary
Number of common nesting structure subtrees | 1
Number of refactorable cases | 1
Number of non-refactorable cases | 0
Time elapsed for finding largest common nesting structure subtrees (ms) | 0.4
Clones location | Clones are in different classes having the same super class
Number of node comparisons | 48

1. {Refactorable}

   Mapping Summary
   Number of mapped statements | 12
   Number of unmapped statements in the first code fragment | 0
   Number of unmapped statements in the second code fragment | 0
   Time elapsed for statement mapping (ms) | 3.8
   Clone type | Type 1

   Mapped Statements
   ID | Statement |  | ID | Statement
   --- | --- | --- | --- | ---

   6

       if (RectangleEdge.isTopOrBottom(edge))

   4

       if (RectangleEdge.isTopOrBottom(edge))

   7

       double minX = area.getX();

   5

       double minX = area.getX();

   8

       double maxX = area.getMaxX();

   6

       double maxX = area.getMaxX();

   9

       if (isInverted())

   7

       if (isInverted())

   10

       result = maxX + ((value - axisMin) / (axisMax - axisMin)) * (minX - maxX);

   8

       result = maxX + ((value - axisMin) / (axisMax - axisMin)) * (minX - maxX);

       else

       else

   11

       result = minX + ((value - axisMin) / (axisMax - axisMin)) * (maxX - minX);

   9

       result = minX + ((value - axisMin) / (axisMax - axisMin)) * (maxX - minX);

   12

       else if (RectangleEdge.isLeftOrRight(edge))

   10

       else if (RectangleEdge.isLeftOrRight(edge))

   13

       double minY = area.getMinY();

   11

       double minY = area.getMinY();

   14

       double maxY = area.getMaxY();

   12

       double maxY = area.getMaxY();

   15

       if (isInverted())

   13

       if (isInverted())

   16

       result = minY + (((value - axisMin) / (axisMax - axisMin)) * (maxY - minY));

   14

       result = minY + (((value - axisMin) / (axisMax - axisMin)) * (maxY - minY));

       else

       else

   17

       result = maxY - (((value - axisMin) / (axisMax - axisMin)) * (maxY - minY));

   15

       result = maxY - (((value - axisMin) / (axisMax - axisMin)) * (maxY - minY));

   Precondition Violations (0)
   Row | Violation
   --- | ---