1682-1-2

while (iterator.hasNext()) { Title currentTitle = (Title) iterator.next(); EntityCollection e = drawTitle(currentTitle, g2, nonTitleArea, (entities != null)); if (e != null) { entities.addAll(e);
Axis xAxis = (Axis) this.domainAxes.get(i); if (xAxis != null) { RectangleEdge edge = getDomainAxisEdge(i); space = xAxis.reserveSpace(g2, this, plotArea, edge, space); }

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

1

    while (iterator.hasNext()) {↵

2

                Title currentTitle = (Title) iterator.next();↵

1

    Axis xAxis = (Axis) this.domainAxes.get(i);↵

3

                EntityCollection e = drawTitle(currentTitle, g2, nonTitleArea,↵

2

                ↵

4

                        (entities != null));↵

5

                if (e != null) {↵

6

                    entities.addAll(↵

3

        if (xAxis != null) {↵

4

                        RectangleEdge edge = getDomainAxisEdge(i);↵

7

    e);↵

5

                        space = xAxis.reserveSpace(g2, this, plotArea, edge, space);↵

8

6

                    }

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