if (this.equals(DialShape.CIRCLE)) {
return DialShape.CIRCLE;
}
else if (this.equals(DialShape.CHORD)) {
return DialShape.CHORD;
}
else if (this.equals(DialShape.PIE)) {
return DialShape.PIE;
}
if (this.equals(DomainOrder.ASCENDING)) {
return DomainOrder.ASCENDING;
}
else if (this.equals(DomainOrder.DESCENDING)) {
return DomainOrder.DESCENDING;
}
else if (this.equals(DomainOrder.NONE)) {
return DomainOrder.NONE;
}
Clone fragments detected by clone detection tool
File path: /jfreechart-1.0.10/src/org/jfree/chart/plot/DialShape.java
|
|
File path: /jfreechart-1.0.10/src/org/jfree/data/DomainOrder.java
|
Method name: Object readResolve()
|
|
Method name: Object readResolve()
|
Number of AST nodes: 6
|
|
Number of AST nodes: 6
|
|
1 | if (this.equals(DialShape.CIRCLE)) {↵ | | 1 | if (this.equals(DomainOrder.ASCENDING)) {↵
|
2 | return DialShape.CIRCLE;↵ | | 2 | return DomainOrder.ASCENDING;↵
|
3 | }↵ | | 3 | }↵
|
4 | else if (this.equals(DialShape.CHORD)) {↵ | | 4 | else if (this.equals(DomainOrder.DESCENDING)) {↵
|
5 | return DialShape.CHORD;↵ | | 5 | return DomainOrder.DESCENDING;↵
|
6 | } ↵ | | 6 | }↵
|
7 | else if (this.equals(DialShape.PIE)) {↵ | | 7 | else if (this.equals(DomainOrder.NONE)) {↵
|
8 | return DialShape.PIE;↵ | | 8 | return DomainOrder.NONE;↵
|
9 | } | | 9 | }
|
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.9 |
Clones location | Clones are in different classes |
Number of node comparisons | 9 |