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:
|
|
Method name:
|
Number of AST nodes: 0
|
|
Number of AST nodes: 0
|
|
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 |
|
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 |