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(HistogramType.FREQUENCY)) { return HistogramType.FREQUENCY; } else if (this.equals(HistogramType.RELATIVE_FREQUENCY)) { return HistogramType.RELATIVE_FREQUENCY; } else if (this.equals(HistogramType.SCALE_AREA_TO_1)) { return HistogramType.SCALE_AREA_TO_1; }
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/statistics/HistogramType.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(HistogramType.FREQUENCY)) {
2
            return DomainOrder.ASCENDING;
2
            return HistogramType.FREQUENCY;
3
        }
3
        }
4
        else if (this.equals(DomainOrder.DESCENDING)) {
4
        else if (this.equals(
5
            return DomainOrder.DESCENDING
5
HistogramType.RELATIVE_FREQUENCY)) {
6
;
6
            return HistogramType.RELATIVE_FREQUENCY;
7
        }
7
        }
8
        else if (this.equals(DomainOrder.NONE)) {
8
        else if (this.equals(
9
            return DomainOrder.NONE
9
HistogramType.SCALE_AREA_TO_1)) {
10
;
10
            return HistogramType.SCALE_AREA_TO_1;
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)0.9
Clones locationClones are in different classes
Number of node comparisons9