1440-1-2

double transXs = transX0 + (getStepPoint() * (transX1 - transX0)); drawLine(g2, state.workingLine, transY0, transX0, transY0, transXs); drawLine(g2, state.workingLine, transY0, transXs, transY1, transXs); drawLine(g2, state.workingLine, transY1, transXs, transY1, transX1);
double transXs = transX0 + (getStepPoint() * (transX1 - transX0)); drawLine(g2, state.workingLine, transX0, transY0, transXs, transY0); drawLine(g2, state.workingLine, transXs, transY0, transXs, transY1); drawLine(g2, state.workingLine, transXs, transY1, transX1, transY1);

Clone fragments detected by clone detection tool
File path: /jfreechart-1.0.10/src/org/jfree/chart/renderer/xy/XYStepRenderer.java |  | File path: /jfreechart-1.0.10/src/org/jfree/chart/renderer/xy/XYStepRenderer.java
Method name: `` |  | Method name: ``
Number of AST nodes: 0 |  | Number of AST nodes: 0

1

    double transXs = transX0 + (getStepPoint()↵

1

    double transXs = transX0 + (getStepPoint()↵

2

                                * (transX1 - transX0));↵

2

                                * (transX1 - transX0));↵

3

                        drawLine(g2, state.workingLine, transY0, transX0, transY0,↵

3

                        drawLine(g2, state.workingLine, transX0, transY0, transXs,↵

4

                                transXs);↵

4

                                transY0);↵

5

                        drawLine(g2, state.workingLine, transY0, transXs, transY1,↵

5

                        drawLine(g2, state.workingLine, transXs, transY0, transXs,↵

6

                                transXs);↵

6

                                transY1);↵

7

                        drawLine(g2, state.workingLine, transY1, transXs, transY1,↵

7

                        drawLine(g2, state.workingLine, transXs, transY1, transX1,↵

8

                                transX1);↵

8

                                transY1);↵

9

9

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