if (Double.isNaN(this.minimumRangeValue)) { this.minimumRangeValue = minval; this.minimumRangeValueRow = r; this.minimumRangeValueColumn = c; } else if (minval < this.minimumRangeValue) { this.minimumRangeValue = minval; this.minimumRangeValueRow = r; this.minimumRangeValueColumn = c; }
if (Double.isNaN(this.minimumRangeValue)) { this.minimumRangeValue = m; this.minimumRangeValueRow = r; this.minimumRangeValueColumn = c; } else { if (m < this.minimumRangeValue) { this.minimumRangeValue = m; this.minimumRangeValueRow = r; this.minimumRangeValueColumn = c; } }
Clone fragments detected by clone detection tool
File path: /jfreechart-1.0.10/src/org/jfree/data/statistics/DefaultBoxAndWhiskerCategoryDataset.java File path: /jfreechart-1.0.10/src/org/jfree/data/statistics/DefaultStatisticalCategoryDataset.java
Method name: void add(BoxAndWhiskerItem, Comparable, Comparable) Method name: void updateBounds()
Number of AST nodes: 8 Number of AST nodes: 8
1
if (Double.isNaN(this.minimumRangeValue)) {
1
if (Double.isNaN(this.minimumRangeValue)) {
2
                this.minimumRangeValue = minval;
2
                        this.minimumRangeValue = m
3
;
3
                this.minimumRangeValueRow = r;
4
                        this.minimumRangeValueRow = r;
4
                this.minimumRangeValueColumn = c;
5
                        this.minimumRangeValueColumn = c;
5
            }
6
                    }
6
            else if (minval
7
                    else {
7
 < this.minimumRangeValue) {
8
                        if (m < this.minimumRangeValue) {
8
                this.minimumRangeValue = minval;
9
                            this.minimumRangeValue = m;
9
                this.minimumRangeValueRow = r;
10
                            this.minimumRangeValueRow = r;
10
                this.minimumRangeValueColumn = c;
11
                            this.minimumRangeValueColumn = c;
12
                        }
11
            }
13
                    }
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.4
Clones locationClones are in different classes having the same super class
Number of node comparisons2