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; }
if (this.equals(TimePeriodAnchor.START)) { return TimePeriodAnchor.START; } else if (this.equals(TimePeriodAnchor.MIDDLE)) { return TimePeriodAnchor.MIDDLE; } else if (this.equals(TimePeriodAnchor.END)) { return TimePeriodAnchor.END; }
Clone fragments detected by clone detection tool
File path: /jfreechart-1.0.10/src/org/jfree/data/DomainOrder.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(DomainOrder.ASCENDING)) {
1
if (this.equals(TimePeriodAnchor.START)) {
2
            return DomainOrder.ASCENDING;
2
            return TimePeriodAnchor.START;
3
        }
3
        }
4
        else if (this.equals(DomainOrder.DESCENDING)) {
4
        else if (this.equals(TimePeriodAnchor.MIDDLE)) {
5
            return DomainOrder.DESCENDING;
5
            return TimePeriodAnchor.MIDDLE;
6
        }
6
        }
7
        else if (this.equals(DomainOrder.NONE)) {
7
        else if (this.equals(TimePeriodAnchor.END)) {
8
            return DomainOrder.NONE;
8
            return TimePeriodAnchor.END;
9
        }
9
        }
Summary
Number of common nesting structure subtrees0
Number of refactorable cases0
Number of non-refactorable cases0
Time elapsed for finding largest common nesting structure subtrees (ms)0.9
Clones locationClones are in different classes
Number of node comparisons9