for (int i = 0; i < count; i++) { Comparable k1 = getKey(i); Comparable k2 = that.getKey(i); if (!k1.equals(k2)) { return false; } Object o1 = getObject(i); Object o2 = that.getObject(i); if (o1 == null) { if (o2 != null) { return false; } } else { if (!o1.equals(o2)) { return false;
for (int i = 0; i < count; i++) { Comparable k1 = getKey(i); Comparable k2 = that.getKey(i); if (!k1.equals(k2)) { return false; } Number v1 = getValue(i); Number v2 = that.getValue(i); 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/KeyedObjects.java File path: /jfreechart-1.0.10/src/org/jfree/data/category/CategoryToPieDataset.java
Method name: Method name:
Number of AST nodes: 0 Number of AST nodes: 0
1
for (int i = 0; i < count; i++) {
1
for (int i = 0; i < count; i++) {
2
            Comparable k1 = getKey(i);
2
            Comparable k1 = getKey(i);
3
            Comparable k2 = that.getKey(i);
3
            Comparable k2 = that.getKey(i);
4
            if (!k1.equals(k2)) {
4
            if (!k1.equals(k2)) {
5
                return false;
5
                return false;
6
            }
6
            }
7
            Object o1 = getObject(i);
7
            Number v1 = getValue(i);
8
            Object o2 = that.getObject(i);
8
            Number v2 = that.getValue(i);
9
            if (o1 == null) {
9
            if (v1 == null) {
10
                if (o2 != null) {
10
                if (v2 != null) {
11
                    return false;
11
                    return false;
12
                }
12
                }
13
            }
13
            }
14
            else {
14
            else {
15
                if (!o1.equals(o2)) {
15
                if (!v1.equals(v2)) {
16
                    return false;
16
                    return false;
17
                
17
                
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