File path: /jfreechart-1.0.10/src/org/jfree/data/statistics/DefaultStatisticalCategoryDataset.java | File path: /jfreechart-1.0.10/src/org/jfree/data/statistics/DefaultStatisticalCategoryDataset.java | |||
Method name: void updateBounds()
|
Method name: void updateBounds()
|
|||
Number of AST nodes: 8 | Number of AST nodes: 8 | |||
1 | if (Double.isNaN(this.maximumRangeValue)) {↵ | 1 | if (Double.isNaN(this.minimumRangeValue)) {↵ | |
2 | this.maximumRangeValue = m;↵ | 2 | this.minimumRangeValue = m;↵ | |
3 | this.maximumRangeValueRow = r;↵ | 3 | this.minimumRangeValueRow = r;↵ | |
4 | this.maximumRangeValueColumn = c;↵ | 4 | this.minimumRangeValueColumn = c;↵ | |
5 | }↵ | 5 | }↵ | |
6 | else {↵ | 6 | else {↵ | |
7 | if (m > this.maximumRangeValue) {↵ | 7 | if (m < this.minimumRangeValue) {↵ | |
8 | this.maximumRangeValue = m;↵ | 8 | this.minimumRangeValue = m;↵ | |
9 | this.maximumRangeValueRow = r;↵ | 9 | this.minimumRangeValueRow = r;↵ | |
10 | this.maximumRangeValueColumn = c;↵ | 10 | this.minimumRangeValueColumn = c;↵ | |
11 | }↵ | 11 | }↵ | |
12 | } | 12 |
| |
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.1 |
Clones location | Clones are in the same method |
Number of node comparisons | 1 |