if (this.equals(LengthConstraintType.NONE)) { return LengthConstraintType.NONE; } else if (this.equals(LengthConstraintType.RANGE)) { return LengthConstraintType.RANGE; } else if (this.equals(LengthConstraintType.FIXED)) { return LengthConstraintType.FIXED; }
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/block/LengthConstraintType.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(LengthConstraintType.NONE)) {
1
if (this.equals(
2
            return LengthConstraintType.NONE
2
DomainOrder.ASCENDING)) {
3
;
3
            return DomainOrder.ASCENDING;
4
        }
4
        }
5
        else if (this.equals(LengthConstraintType.RANGE)) {
5
        else if (this.equals(DomainOrder.DESCENDING)) {
6
            return LengthConstraintType.RANGE;
6
            return DomainOrder.DESCENDING;
7
        }
7
        }
8
        else if (this.equals(LengthConstraintType.FIXED)) {
8
        else if (this.equals(
9
            return LengthConstraintType.FIXED
9
DomainOrder.NONE)) {
10
;
10
            return DomainOrder.NONE;
11
        }
11
        }
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