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: void updateBounds()
|
Method name: void updateBounds()
|
|||
Number of AST nodes: 7 | Number of AST nodes: 7 | |||
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 | }↵ | |
10 | }↵ | 10 | }↵ | |
11 | } | 11 |
| |
See real code fragment | See real code fragment |
Number of common nesting structure subtrees | 0 |
Number of refactorable cases | 0 |
Number of non-refactorable cases | 0 |
Time elapsed for finding largest common nesting structure subtrees (ms) | 0.3 |
Clones location | Clones are in the same method |
Number of node comparisons | 1 |