1090-1-2

if (yAverage != null) { double aRadius = width / 4; // here we check that the average marker will in fact be visible // before drawing it... if ((yyAverage > (dataArea.getMinX() - aRadius)) && (yyAverage < (dataArea.getMaxX() + aRadius))) { Ellipse2D.Double avgEllipse = new Ellipse2D.Double( yyAverage - aRadius, xx - aRadius, aRadius * 2, aRadius * 2); g2.fill(avgEllipse); g2.draw(avgEllipse);
if (yAverage != null) { aRadius = width / 4; // here we check that the average marker will in fact be visible // before drawing it... if ((yyAverage > (dataArea.getMinY() - aRadius)) && (yyAverage < (dataArea.getMaxY() + aRadius))) { Ellipse2D.Double avgEllipse = new Ellipse2D.Double(xx - aRadius, yyAverage - aRadius, aRadius * 2, aRadius * 2); g2.fill(avgEllipse); g2.draw(avgEllipse);

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

1

    if (yAverage != null) {↵

1

    if (yAverage != null) {↵

2

                double aRadius = width / 4;↵

2

                aRadius = width / 4;↵

3

                // here we check that the average marker will in fact be visible↵

3

                // here we check that the average marker will in fact be visible↵

4

                // before drawing it...↵

4

                // before drawing it...↵

5

                if ((yyAverage > (dataArea.getMinX() - aRadius)) ↵

5

                if ((yyAverage > (dataArea.getMinY() - aRadius)) ↵

6

                        && (yyAverage < (dataArea.getMaxX() + aRadius))) {↵

6

                        && (yyAverage < (dataArea.getMaxY() + aRadius))) {↵

7

                    Ellipse2D.Double avgEllipse = new Ellipse2D.Double(↵

7

                    Ellipse2D.Double avgEllipse = new Ellipse2D.Double(xx - aRadius, ↵

8

                            yyAverage - aRadius, xx - aRadius, aRadius * 2, ↵

8

                            yyAverage - aRadius, ↵

9

                            aRadius * 2);↵

9

    aRadius * 2, aRadius * 2);↵

10

                    g2.fill(avgEllipse);↵

10

                    g2.fill(avgEllipse);↵

11

                    g2.draw(avgEllipse);↵

11

                    g2.draw(avgEllipse);↵

12

12

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