if (min != null) { double minv = min.doubleValue(); if (!Double.isNaN(minv)) { if (minv < this.minimumRangeValue || Double.isNaN( this.minimumRangeValue)) { this.minimumRangeValue = minv; this.minimumRangeValueRow = r; this.minimumRangeValueColumn = c;
if (max != null) { double maxv = max.doubleValue(); if (!Double.isNaN(maxv)) { if (maxv > this.maximumRangeValue || Double.isNaN( this.maximumRangeValue)) { this.maximumRangeValue = maxv; this.maximumRangeValueRow = r; this.maximumRangeValueColumn = 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/DefaultBoxAndWhiskerCategoryDataset.java
Method name: Method name:
Number of AST nodes: 0 Number of AST nodes: 0
1
if (min != null) {
1
if (max != null) {
2
                        double minv = min.doubleValue();
2
                        double maxv = max.doubleValue();
3
                        if (!Double.isNaN(minv)) {
3
                        if (!Double.isNaN(maxv)) {
4
                            if (minv < this.minimumRangeValue || Double.isNaN(
4
                            if (maxv > this.maximumRangeValue || Double.isNaN(
5
                                    this.minimumRangeValue)) {
5
                                    this.maximumRangeValue)) {
6
                                this.minimumRangeValue = minv;
6
                                this.maximumRangeValue = maxv;
7
                                this.minimumRangeValueRow = r;
7
                                this.maximumRangeValueRow = r;
8
                                this.minimumRangeValueColumn = c;
8
                                this.maximumRangeValueColumn = c;
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.0
Clones location
Number of node comparisons0