for (int i = 0; i < this.domainAxes.size(); i++) { CategoryAxis axis = (CategoryAxis) this.domainAxes.get(i); if (axis != null) { axis.removeChangeListener(this); } }
for (int i = 0; i < this.labels.size(); i++) { PieLabelRecord plr = getPieLabelRecord(i); if (y > plr.getLowerY()) { return true; } y = plr.getUpperY(); }
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/PieLabelDistributor.java
Method name: void clearDomainAxes() Method name: boolean isOverlap()
Number of AST nodes: 4 Number of AST nodes: 5
1
for (int i = 0; i < this.domainAxes.size(); i++) {
1
for (int i = 0; i < this.labels.size(); i++) {
2
            CategoryAxis axis = (CategoryAxis) this.domainAxes.get(i);
2
            
3
            if (axis != null) {
4
                axis.removeChangeListener(this);
5
            }
3
PieLabelRecord plr = getPieLabelRecord(i);
4
            if (y > plr.getLowerY()) {
5
                return true;
6
            }
7
            y = plr.getUpperY();    
6
        }
8
        }
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.2
Clones locationClones are in different classes
Number of node comparisons1