if (this.foregroundDomainMarkers != null) { Set keys = this.foregroundDomainMarkers.keySet(); Iterator iterator = keys.iterator(); while (iterator.hasNext()) { Integer key = (Integer) iterator.next(); clearDomainMarkers(key.intValue()); } this.foregroundDomainMarkers.clear(); }
if (this.backgroundRangeMarkers != null) { Set keys = this.backgroundRangeMarkers.keySet(); Iterator iterator = keys.iterator(); while (iterator.hasNext()) { Integer key = (Integer) iterator.next(); clearRangeMarkers(key.intValue()); } this.backgroundRangeMarkers.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/CategoryPlot.java
Method name: Method name:
Number of AST nodes: 0 Number of AST nodes: 0
1
if (this.foregroundDomainMarkers != null) {
1
if (this.backgroundRangeMarkers != null) {
2
            Set keys = this.foregroundDomainMarkers.keySet();
2
            Set keys = this.backgroundRangeMarkers.keySet();
3
            Iterator iterator = keys.iterator();
3
            Iterator iterator = keys.iterator();
4
            while (iterator.hasNext()) {
4
            while (iterator.hasNext()) {
5
                Integer key = (Integer) iterator.next();
5
                Integer key = (Integer) iterator.next();
6
                clearDomainMarkers(key.intValue());
6
                clearRangeMarkers(key.intValue());
7
            }
7
            }
8
            this.foregroundDomainMarkers.clear();
8
            this.backgroundRangeMarkers.clear();
9
        }
9
        }
Summary
Number of common nesting structure subtrees0
Number of refactorable cases0
Number of non-refactorable cases0
Time elapsed for finding largest common nesting structure subtrees (ms)0.0
Clones location
Number of node comparisons0