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;
}
}
}
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/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: 12
|
|
Number of AST nodes: 12
|
|
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 | Number v1 = getValue(i);↵ | | 7 | Number v1 = getValue(i);↵
|
8 | Number v2 = that.getValue(i);↵ | | 8 | Number v2 = that.getValue(i);↵
|
9 | if (v1 == null) {↵ | | 9 | if (v1 == null) {↵
|
10 | if (v2 != null) {↵ | | 10 | if (v2 != null) {↵
|
11 | return false;↵ | | 11 | return false;↵
|
12 | }↵ | | 12 | }↵
|
13 | }↵ | | 13 | }↵
|
14 | else {↵ | | 14 | else {↵
|
15 | if (!v1.equals(v2)) {↵ | | 15 | if (!v1.equals(v2)) {↵
|
16 | return false;↵ | | 16 | return false;↵
|
17 | }↵ | | 17 | }↵
|
18 | }↵ | | 18 | }↵
|
19 | } | | 19 | }
|
See real code fragment |
|
See real code fragment |
Summary
Number of common nesting structure subtrees | 1 |
Number of refactorable cases | 0 |
Number of non-refactorable cases | 1 |
Time elapsed for finding largest common nesting structure subtrees (ms) | 0.5 |
Clones location | Clones are in different classes |
Number of node comparisons | 41 |
-
{Non-refactorable}
Mapping Summary
Number of mapped statements | 12 |
Number of unmapped statements in the first code fragment | 0 |
Number of unmapped statements in the second code fragment | 0 |
Time elapsed for statement mapping (ms) | 4.6 |
Clone type | Type 2 |
Mapped Statements
ID |
Statement |
|
ID |
Statement |
9 | for (int i = 0; i < count; i++) | | 9 | for (int i = 0; i < count; i++) |
10 | Comparable k1 = getKey(i); | | 10 | Comparable k1 = getKey(i); |
11 | Comparable k2 = that.getKey(i); | | 11 | Comparable k2 = that.getKey(i); |
12 | | | 12 | |
13 | | | 13 | |
14 | | | 14 | |
15 | Number v2 = that.getValue(i); | | 15 | Number v2 = that.getValue(i); |
16 | | | 16 | |
17 | | | 17 | |
18 | | | 18 | |
| | | | |
19 | | | 19 | |
20 | | | 20 | |
Precondition Violations (2)
Row |
Violation |
1 | Not all possible execution flows end in a return statement |
2 | The refactoring of the clones is infeasible, because classes org.jfree.data.DefaultKeyedValues and org.jfree.data.category.CategoryToPieDataset do not have a common superclass |