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.getValue(columnIndex) != null) {
allNull = false;
break;
}
}
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.getObject(colIndex) != null) {
allNull = false;
break;
}
}
Clone fragments detected by clone detection tool
File path: /jfreechart-1.0.10/src/org/jfree/data/DefaultKeyedValues2D.java
|
|
File path: /jfreechart-1.0.10/src/org/jfree/data/KeyedObjects2D.java
|
Method name: void removeValue(Comparable, Comparable)
|
|
Method name: void removeObject(Comparable, Comparable)
|
Number of AST nodes: 6
|
|
Number of AST nodes: 6
|
|
1 | for (int item = 0, itemCount = this.rows.size(); item < itemCount; ↵ | | 1 | for (int item = 0, itemCount = this.rows.size(); item < itemCount; ↵
|
2 | item++) {↵ | | 2 | item++) {↵
|
3 | row = (DefaultKeyedValues) this.rows.get(item);↵ | | 3 | row = (KeyedObjects) this.rows.get(item);↵
|
4 | int columnIndex = row.getIndex(columnKey);↵ | | 4 | int colIndex = row.getIndex(columnKey);↵
|
5 | if (columnIndex >= 0 && row.getValue(columnIndex) != null) {↵ | | 5 | if (colIndex >= 0 && row.getObject(colIndex) != null) {↵
|
6 | allNull = false;↵ | | 6 | allNull = false;↵
|
7 | break;↵ | | 7 | break;↵
|
8 | }↵ | | 8 | }↵
|
9 | } | | 9 | }
|
See real code fragment |
|
See real code fragment |
Summary
Number of common nesting structure subtrees | 0 |
Number of refactorable cases | 0 |
Number of non-refactorable cases | 0 |
Time elapsed for finding largest common nesting structure subtrees (ms) | 0.4 |
Clones location | Clones are in different classes |
Number of node comparisons | 1 |