1209-4-8

if (this.foregroundRangeMarkers != null) { Collection markers = (Collection) this.foregroundRangeMarkers.get(key); if (markers != null) { Iterator iterator = markers.iterator(); while (iterator.hasNext()) { Marker m = (Marker) iterator.next(); m.removeChangeListener(this); } markers.clear();
if (this.foregroundRangeMarkers != null) { Collection markers = (Collection) this.foregroundRangeMarkers.get(key); if (markers != null) { Iterator iterator = markers.iterator(); while (iterator.hasNext()) { Marker m = (Marker) iterator.next(); m.removeChangeListener(this); } markers.clear();

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/XYPlot.java
Method name: `` |  | Method name: ``
Number of AST nodes: 0 |  | Number of AST nodes: 0

1

    if (this.foregroundRangeMarkers != null) {↵

1

    if (this.foregroundRangeMarkers != null) {↵

2

                Collection markers↵

2

                Collection markers↵

3

                    = (Collection) this.foregroundRangeMarkers.get(key);↵

3

                    = (Collection) this.foregroundRangeMarkers.get(key);↵

4

                if (markers != null) {↵

4

                if (markers != null) {↵

5

                    Iterator iterator = markers.iterator();↵

5

                    Iterator iterator = markers.iterator();↵

6

                    while (iterator.hasNext()) {↵

6

                    while (iterator.hasNext()) {↵

7

                        Marker m = (Marker) iterator.next();↵

7

                        Marker m = (Marker) iterator.next();↵

8

                        m.removeChangeListener(this);↵

8

                        m.removeChangeListener(this);↵

9

                    }↵

9

                    }↵

10

                    markers.clear();↵

10

                    markers.clear();↵

11

11

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