if (this.equals(DateTickMarkPosition.START)) { return DateTickMarkPosition.START; } else if (this.equals(DateTickMarkPosition.MIDDLE)) { return DateTickMarkPosition.MIDDLE; } else if (this.equals(DateTickMarkPosition.END)) { return DateTickMarkPosition.END; }
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/axis/DateTickMarkPosition.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(DateTickMarkPosition.START)) {
1
if (this.equals(DomainOrder.ASCENDING)) {
2
            return DateTickMarkPosition.START;
2
            return DomainOrder.ASCENDING;
3
        }
3
        }
4
        else if (this.equals(DateTickMarkPosition.MIDDLE)) {
4
        else if (this.equals(D
5
            return DateTickMarkPosition.MIDDLE
5
omainOrder.DESCENDING)) {
6
;
6
            return DomainOrder.DESCENDING;
7
        }    
7
        }
8
        else if (this.equals(DateTickMarkPosition.END)) {
8
        else if (this.equals(DomainOrder.NONE)) {
9
            return DateTickMarkPosition.END;
9
            return DomainOrder.NONE;
10
        }
10
        }
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)1.0
Clones locationClones are in different classes
Number of node comparisons9