for (int i = 0; i < this.rangeAxes.size(); i++) { ValueAxis yAxis = (ValueAxis) this.rangeAxes.get(i); if (yAxis != null) { ValueAxis clonedAxis = (ValueAxis) yAxis.clone(); clone.setRangeAxis(i, clonedAxis); } }
for (int item = 0, itemCount = this.rows.size(); item < itemCount; item++) { row = (KeyedObjects) this.rows.get(item); int colIndex = row.getIndex(columnKey); if (colIndex >= 0) { row.removeValue(colIndex); } }
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/data/KeyedObjects2D.java
Method name: Object clone() Method name: void removeObject(Comparable, Comparable)
Number of AST nodes: 5 Number of AST nodes: 5
1
for (int i = 0; i < this.rangeAxes.size(); i++) {
1
for (int item = 0, i
2
            ValueAxis yAxis = (ValueAxi
2
temCount = this.rows.size(); item < itemCount; 
3
                 item++) {
3
s) this.rangeAxes.get(i);
4
                row = (KeyedObjects) this.rows.get(item);
4
            if (yAxis != null) {
5
            
5
                ValueAxis clonedAxis = (ValueAxis) yAxis.clone();
6
                clone.setRangeAxis(i, clonedAxis
6
    int colIndex = row.getIndex(columnKey);
7
                if (colIndex >= 0) {
7
);
8
                    row.removeValue(colIndex);
8
            }
9
            
10
    }
9
        }
11
            }
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.1
Clones locationClones are in different classes
Number of node comparisons1