for (int i = 0; i < this.rangeAxes.size(); i++) { ValueAxis axis = (ValueAxis) this.rangeAxes.get(i); if (axis != null) { axis.removeChangeListener(this); } }
for (int i = 0; i < this.datasets.size(); i++) { if (this.datasets.get(i) == dataset) { result = (CategoryItemRenderer) this.renderers.get(i); break; } }
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 clearRangeAxes() Method name: CategoryItemRenderer getRendererForDataset(CategoryDataset)
Number of AST nodes: 4 Number of AST nodes: 4
1
for (int i = 0; i < this.rangeAxes.size(); i++) {
1
for (int i = 0; i < this.datasets.size(); i++) {
2
            ValueAxis axis = (ValueAxis) this.rangeAxes.get(i);
2
            
3
            if (axis != null) {
4
                axis.removeChangeListener(this)
3
if (this.datasets.get(i) == dataset) {
4
                result = (CategoryItemRenderer) this.renderers.get(i);
5
;
5
                break;
6
            }
6
            }
7
        }
7
        }
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 declared in the same class
Number of node comparisons1