1577-2-3

if (getAnnotations() != null) { Iterator iterator = getAnnotations().iterator(); while (iterator.hasNext()) { CategoryAnnotation annotation = (CategoryAnnotation) iterator.next(); annotation.draw(g2, this, dataArea, getDomainAxis(), getRangeAxis());
while (iterator.hasNext()) { CategoryDataset d = (CategoryDataset) iterator.next(); CategoryItemRenderer r = getRendererForDataset(d); if (r != null) { result = Range.combine(result, r.findRangeBounds(d));

Clone fragments detected by clone detection tool
File path: /jfreechart-1.0.10/src/org/jfree/chart/plot/CategoryPlot.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

    if (getAnnotations() != null) {↵

2

                Iterator iterator = getAnnotations().iterator();↵

3

                while (iterator.hasNext()) {↵

1

    while (iterator.hasNext()) {↵

4

                    CategoryAnnotation annotation↵

2

                Category↵

5

                            = (CategoryAnnotation) iterator.next();↵

3

    Dataset d = (CategoryDataset) iterator.next();↵

6

                    annotation.draw(g2, this, dataArea, getDomainAxis(),↵

4

                ↵

7

                            getRangeAxi↵

5

    CategoryItemRenderer r = getRendererForDataset(d);↵

6

                if (r != null) {↵

8

    s());↵

7

                    result = Range.combine(result, r.findRangeBounds(d));↵

9

8

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