1054-2-5

for (int item = 0; item < urlCount; item++) { String u1 = getURL(series, item); String u2 = that.getURL(series, item); if (u1 != null) { if (!u1.equals(u2)) { return false; } } else { if (u2 != null) { return false;
for (int c = 0; c < colCount; c++) { Number v1 = getValue(r, c); Number v2 = that.getValue(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/chart/urls/CustomXYURLGenerator.java |  | File path: /jfreechart-1.0.10/src/org/jfree/data/category/DefaultCategoryDataset.java
Method name: `` |  | Method name: ``
Number of AST nodes: 0 |  | Number of AST nodes: 0

1

    for (int item = 0; item < urlCount; item++) {↵

1

    for (int c = 0; c < colCount; c++) {↵

2

                    String u1 = getURL(series, item);↵

2

                    Number v1 = getValue(r, c);↵

3

                    String u2 = that.getURL(series, item);↵

3

                    Number v2 = that.getValue(r, c);↵

4

                    if (u1 != null) {↵

4

                    if (v1 == null) {↵

5

                        if (!u1.equals(u2)) {↵

5

                        if (v2 != null) {↵

6

                            return false;↵

6

                            return false;↵

7

                        }↵

7

                        }↵

8

                    }↵

8

                    }↵

9

                    else {↵

9

                    else ↵

10

                        if (u2 != null) {↵

10

    if (!v1.equals(v2)) {↵

11

                            return false;↵

11

                        return false;↵

12

12

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.0
Clones location |
Number of node comparisons | 0