File path: /jfreechart-1.0.10/src/org/jfree/data/general/DatasetUtilities.java | File path: /jfreechart-1.0.10/src/org/jfree/data/general/DatasetUtilities.java | |||
Method name: Number findMinimumRangeValue(CategoryDataset)
|
Method name: Number findMaximumRangeValue(CategoryDataset)
|
|||
Number of AST nodes: 15 | Number of AST nodes: 15 | |||
1 | double minimum = Double.POSITIVE_INFINITY;↵ | 1 | double maximum = Double.NEGATIVE_INFINITY;↵ | |
2 | int seriesCount = dataset.getRowCount();↵ | 2 | int seriesCount = dataset.getRowCount();↵ | |
3 | int itemCount = dataset.getColumnCount();↵ | 3 | int itemCount = dataset.getColumnCount();↵ | |
4 | for (int series = 0; series < seriesCount; series++) {↵ | 4 | for (int series = 0; series < seriesCount; series++) {↵ | |
5 | for (int item = 0; item < itemCount; item++) {↵ | 5 | for (int item = 0; item < itemCount; item++) {↵ | |
6 | Number value;↵ | 6 | Number value;↵ | |
7 | if (dataset instanceof IntervalCategoryDataset) {↵ | 7 | if (dataset instanceof IntervalCategoryDataset) {↵ | |
8 | IntervalCategoryDataset icd↵ | 8 | IntervalCategoryDataset icd↵ | |
9 | = (IntervalCategoryDataset) dataset;↵ | 9 | = (IntervalCategoryDataset) dataset;↵ | |
10 | value = icd.getStartValue(series, item);↵ | 10 | value = icd.getEndValue(series, item);↵ | |
11 | }↵ | 11 | }↵ | |
12 | else {↵ | 12 | else {↵ | |
13 | value = dataset.getValue(series, item);↵ | 13 | value = dataset.getValue(series, item);↵ | |
14 | }↵ | 14 | }↵ | |
15 | if (value != null) {↵ | 15 | if (value != null) {↵ | |
16 | minimum = Math.min(minimum, value.doubleValue());↵ | 16 | maximum = Math.max(maximum, value.doubleValue());↵ | |
17 | }↵ | 17 | }↵ | |
18 | }↵ | 18 | }↵ | |
19 | }↵ | 19 | }↵ | |
20 | if (minimum == Double.POSITIVE_INFINITY) {↵ | 20 | if (maximum == Double.NEGATIVE_INFINITY) {↵ | |
21 | return null;↵ | 21 | return null;↵ | |
22 | }↵ | 22 | }↵ | |
23 | else {↵ | 23 | else {↵ | |
24 | return new Double(minimum);↵ | 24 | return new Double(maximum);↵ | |
25 | } | 25 |
| |
See real code fragment | See real code fragment |
Number of common nesting structure subtrees | 1 |
Number of refactorable cases | 0 |
Number of non-refactorable cases | 1 |
Time elapsed for finding largest common nesting structure subtrees (ms) | 0.7 |
Clones location | Clones are declared in the same class |
Number of node comparisons | 55 |
Number of mapped statements | 15 |
Number of unmapped statements in the first code fragment | 0 |
Number of unmapped statements in the second code fragment | 0 |
Time elapsed for statement mapping (ms) | 4.5 |
Clone type | Type 2 |
ID | Statement | ID | Statement | |||||||||||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
6 | double minimum = Double.POSITIVE_INFINITY; |
| 6 | double maximum = Double.NEGATIVE_INFINITY; | ||||||||||||||||||
7 | int seriesCount = dataset.getRowCount(); | 7 | int seriesCount = dataset.getRowCount(); | |||||||||||||||||||
8 | int itemCount = dataset.getColumnCount(); | 8 | int itemCount = dataset.getColumnCount(); | |||||||||||||||||||
9 | for (int series = 0; series < seriesCount; series++) | 9 | for (int series = 0; series < seriesCount; series++) | |||||||||||||||||||
10 | for (int item = 0; item < itemCount; item++) | 10 | for (int item = 0; item < itemCount; item++) | |||||||||||||||||||
11 | Number value; | 11 | Number value; | |||||||||||||||||||
12 | if (dataset instanceof IntervalCategoryDataset) | 12 | if (dataset instanceof IntervalCategoryDataset) | |||||||||||||||||||
13 | IntervalCategoryDataset icd = (IntervalCategoryDataset)dataset; | 13 | IntervalCategoryDataset icd = (IntervalCategoryDataset)dataset; | |||||||||||||||||||
14 | value = icd.getStartValue(series, item); |
| 14 | value = icd.getEndValue(series, item); | ||||||||||||||||||
else | else | |||||||||||||||||||||
15 | value = dataset.getValue(series, item); | 15 | value = dataset.getValue(series, item); | |||||||||||||||||||
16 | if (value != null) | 16 | if (value != null) | |||||||||||||||||||
17 | minimum = Math.min(minimum, value.doubleValue()); |
| 17 | maximum = Math.max(maximum, value.doubleValue()); | ||||||||||||||||||
18 | if (minimum == Double.POSITIVE_INFINITY) |
| 18 | if (maximum == Double.NEGATIVE_INFINITY) | ||||||||||||||||||
19 | return null; | 19 | return null; | |||||||||||||||||||
else | else | |||||||||||||||||||||
20 | return new Double(minimum); |
| 20 | return new Double(maximum); |
Row | Violation |
---|---|
1 | Expression icd.getStartValue(series,item) cannot be parameterized, because it has dependencies to/from statements that will be extracted |
2 | Expression icd.getEndValue(series,item) cannot be parameterized, because it has dependencies to/from statements that will be extracted |
3 | Expression Math.min(minimum,value.doubleValue()) cannot be parameterized, because it has dependencies to/from statements that will be extracted |
4 | Expression Math.max(maximum,value.doubleValue()) cannot be parameterized, because it has dependencies to/from statements that will be extracted |