for (int c = 0; c < colCount; c++) { Number v1 = getValue(r, c); Number v2 = kv2D.getValue(r, c); if (v1 == null) { if (v2 != null) { return false; } } else { if (!v1.equals(v2)) { return false;
for (int c = 0; c < colCount; c++) { Object v1 = getObject(r, c); Object v2 = that.getObject(r, c); if (v1 == null) { if (v2 != null) { return false; } } else { if (!v1.equals(v2)) { return false;
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: Method name:
Number of AST nodes: 0 Number of AST nodes: 0
1
for (int c = 0; c < colCount; c++) {
1
for (int c = 0; c < colCount; c++) {
2
                Number v1 = getValue(r, c);
2
                Object v1 = getObject(r, c);
3
                Number v2 = kv2D.getValue(r, c);
3
                Object v2 = that.getObject(r, c);
4
                if (v1 == null) {
4
                if (v1 == null) {
5
                    if (v2 != null) {
5
                    if (v2 != null) {
6
                        return false;
6
                        return false;
7
                    }
7
                    }
8
                }
8
                }
9
                else {
9
                else {
10
                    if (!v1.equals(v2)) {
10
                    if (!v1.equals(v2)) {
11
                        return false;
11
                        return false;
12
                    
12
                    
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 location
Number of node comparisons0