for (int i = 0; i < this.subplots.size(); i++) { CategoryPlot subplot = (CategoryPlot) this.subplots.get(i); PlotRenderingInfo subplotInfo = info.getSubplotInfo(i); subplot.handleClick(x, y, subplotInfo); }
for (int item = 0, itemCount = this.rows.size(); item < itemCount; item++) { row = (DefaultKeyedValues) this.rows.get(item); int columnIndex = row.getIndex(columnKey); if (columnIndex >= 0) { row.removeValue(columnIndex); } }
Clone fragments detected by clone detection tool
File path: /jfreechart-1.0.10/src/org/jfree/chart/plot/CombinedDomainCategoryPlot.java File path: /jfreechart-1.0.10/src/org/jfree/data/DefaultKeyedValues2D.java
Method name: void handleClick(int, int, PlotRenderingInfo) Method name: void removeValue(Comparable, Comparable)
Number of AST nodes: 4 Number of AST nodes: 5
1
for (int i = 0; i < this.subplots.size(); i
1
for (int item = 0, itemCount = this.rows.size(); item < itemCount; 
2
++) {
2
                 item++) {
3
                CategoryPlot subplot = (CategoryPlot) this.subplots.get(i);
3
                row = (DefaultKeyedValues) this.rows.get(item);
4
                PlotRenderingInfo subplotInfo = info.getSubplotInfo(i);
4
                int columnIndex = row.getIndex(columnKey);
5
                subplot.handleClick(x, y, subplotInfo);
5
                if (columnIndex >= 0) {
6
                    row.removeValue(columnIndex);
7
                }
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.0
Clones locationClones are in different classes
Number of node comparisons1