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; } }
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/DefaultKeyedValues.java File path: /jfreechart-1.0.10/src/org/jfree/data/category/CategoryToPieDataset.java
Method name: boolean equals(Object) Method name: boolean equals(Object)
Number of AST nodes: 11 Number of AST nodes: 11
1
Comparable k1 = getKey(i);
1
Comparable k1 = getKey(i);
2
            Comparable k2 = that.getKey(i);
2
            Comparable k2 = that.getKey(i);
3
            if (!k1.equals(k2)) {
3
            if (!k1.equals(k2)) {
4
                return false;
4
                return false;
5
            }
5
            }
6
            Number v1 = getValue(i);
6
            Number v1 = getValue(i);
7
            Number v2 = that.getValue(i);
7
            Number v2 = that.getValue(i);
8
            if (v1 == null) {
8
            if (v1 == null) {
9
                if (v2 != null) {
9
                if (v2 != null) {
10
                    return false;
10
                    return false;
11
                }
11
                }
12
            }
12
            }
13
            else {
13
            else {
14
                if (!v1.equals(v2)) {
14
                if (!v1.equals(v2)) {
15
                    return false;
15
                    return false;
16
                }
16
                }
17
            }
17
            }
Summary
Number of common nesting structure subtrees1
Number of refactorable cases0
Number of non-refactorable cases1
Time elapsed for finding largest common nesting structure subtrees (ms)0.5
Clones locationClones are in different classes
Number of node comparisons33
  1. {Non-refactorable}
    Mapping Summary
    Number of mapped statements11
    Number of unmapped statements in the first code fragment0
    Number of unmapped statements in the second code fragment0
    Time elapsed for statement mapping (ms)3.2
    Clone typeType 2
    Mapped Statements
    ID Statement ID Statement
    10
    Comparable k1 = getKey(i);
    10
    Comparable k1 = getKey(i);
    11
    Comparable k2 = that.getKey(i);
    11
    Comparable k2 = that.getKey(i);
    11
    Comparable k2 = that.getKey(i);
    Differences
    Expression1Expression2Difference
    org.jfree.data.KeyedValuesorg.jfree.data.general.PieDatasetSUBCLASS_TYPE_MISMATCH
    11
    Comparable k2 = that.getKey(i);
    12
    if (!k1.equals(k2))
    12
    if (!k1.equals(k2))
    13
    return false;
    13
    return false;
    14
    Number v1 = getValue(i);
    14
    Number v1 = getValue(i);
    15
    Number v2 = that.getValue(i);
    15
    Number v2 = that.getValue(i);
    15
    Number v2 = that.getValue(i);
    Differences
    Expression1Expression2Difference
    org.jfree.data.KeyedValuesorg.jfree.data.general.PieDatasetSUBCLASS_TYPE_MISMATCH
    15
    Number v2 = that.getValue(i);
    16
    if (v1 == null)
    16
    if (v1 == null)
    17
    if (v2 != null)
    17
    if (v2 != null)
    18
    return false;
    18
    return false;
    else
    else
    19
    if (!v1.equals(v2))
    19
    if (!v1.equals(v2))
    20
    return false;
    20
    return false;
    Precondition Violations (2)
    Row Violation
    1Not all possible execution flows end in a return statement
    2The refactoring of the clones is infeasible, because classes org.jfree.data.DefaultKeyedValues and org.jfree.data.category.CategoryToPieDataset do not have a common superclass