File path: /jfreechart-1.0.10/src/org/jfree/chart/block/LengthConstraintType.java | File path: /jfreechart-1.0.10/src/org/jfree/data/time/TimePeriodAnchor.java | |||
Method name: Object readResolve()
|
Method name: Object readResolve()
|
|||
Number of AST nodes: 6 | Number of AST nodes: 6 | |||
1 | if (this.equals(LengthConstraintType.NONE)) {↵ | 1 | if (this.equals(↵ | |
2 | return LengthConstraintType.NONE↵ | 2 | TimePeriodAnchor.START)) {↵ | |
3 | ;↵ | 3 | return TimePeriodAnchor.START;↵ | |
4 | }↵ | 4 | }↵ | |
5 | else if (this.equals(LengthConstraintType.RANGE)) {↵ | 5 | else if (this.equals(TimePeriodAnchor.MIDDLE)) {↵ | |
6 | return LengthConstraintType.RANGE;↵ | 6 | return TimePeriodAnchor.MIDDLE;↵ | |
7 | }↵ | 7 | }↵ | |
8 | else if (this.equals(LengthConstraintType.FIXED)) {↵ | 8 | else if (this.equals(TimePeriodAnchor.END)) {↵ | |
9 | return LengthConstraintType.FIXED;↵ | 9 | return TimePeriodAnchor.END;↵ | |
10 | } | 10 |
| |
See real code fragment | See real code fragment |
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 |