1545-1-2

while (iterator.hasNext()) { ValueTick tick = (ValueTick) iterator.next(); CategoryItemRenderer renderer1 = getRenderer(); if (renderer1 != null) { renderer1.drawRangeGridline(g2, this, getRangeAxis(), dataArea, tick.getValue()); } }
if (getAnnotations() != null) { Iterator iterator = getAnnotations().iterator(); while (iterator.hasNext()) { CategoryAnnotation annotation = (CategoryAnnotation) iterator.next(); annotation.draw(g2, this, dataArea, getDomainAxis(), getRangeAxis()); } }

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: `void drawRangeGridlines(Graphics2D, Rectangle2D, List)` |  | Method name: `void drawAnnotations(Graphics2D, Rectangle2D)`
Number of AST nodes: 5 |  | Number of AST nodes: 5

1

    while (iterator.hasNext()) {↵

2

                            ValueTick tick = (ValueTick) ↵

1

    if (getAnnotations() != null) {↵

2

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

3

    iterator.next();↵

3

                while (iterator.hasNext()↵

4

            ↵

4

    ) {↵

5

                    CategoryItemRenderer renderer1 = getRenderer();↵

5

                    Category↵

6

                            if (renderer1 != null) {↵

7

                                renderer1.drawRangeGridline(g2, this,↵

8

                ↵

6

    Annotation annotation↵

7

                            = (CategoryAnnotation) iterator.next();↵

8

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

9

                            getRangeAxis(), dataArea, tick.getValue());↵

9

                            getRangeAxis());↵

10

                            }↵

10

                ↵

11

                ↵

11

    }↵

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 | Clones are declared in the same class
Number of node comparisons | 1