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(XYDataset)
|
Method name: Number findMaximumRangeValue(XYDataset)
|
|||
Number of AST nodes: 18 | Number of AST nodes: 18 | |||
1 | double minimum = Double.POSITIVE_INFINITY;↵ | 1 | double maximum = Double.NEGATIVE_INFINITY;↵ | |
2 | int seriesCount = dataset.getSeriesCount();↵ | 2 | int seriesCount = dataset.getSeriesCount();↵ | |
3 | for (int series = 0; series < seriesCount; series++) {↵ | 3 | for (int series = 0; series < seriesCount; series++) {↵ | |
4 | int itemCount = dataset.getItemCount(series);↵ | 4 | int itemCount = dataset.getItemCount(series);↵ | |
5 | for (int item = 0; item < itemCount; item++) {↵ | 5 | for (int item = 0; item < itemCount; item++) {↵ | |
6 | double value;↵ | 6 | double value;↵ | |
7 | if (dataset instanceof IntervalXYDataset) {↵ | 7 | if (dataset instanceof IntervalXYDataset) {↵ | |
8 | IntervalXYDataset intervalXYData↵ | 8 | IntervalXYDataset intervalXYData↵ | |
9 | = (IntervalXYDataset) dataset;↵ | 9 | = (IntervalXYDataset) dataset;↵ | |
10 | value = intervalXYData.getStartYValue(series, item);↵ | 10 | value = intervalXYData.getEndYValue(series, item);↵ | |
11 | }↵ | 11 | }↵ | |
12 | else if (dataset instanceof OHLCDataset) {↵ | 12 | else if (dataset instanceof OHLCDataset) {↵ | |
13 | OHLCDataset highLowData = (OHLCDataset) dataset;↵ | 13 | OHLCDataset highLowData = (OHLCDataset) dataset;↵ | |
14 | value = highLowData.getLowValue(series, item);↵ | 14 | value = highLowData.getHighValue(series, item);↵ | |
15 | }↵ | 15 | }↵ | |
16 | else {↵ | 16 | else {↵ | |
17 | value = dataset.getYValue(series, item);↵ | 17 | value = dataset.getYValue(series, item);↵ | |
18 | }↵ | 18 | }↵ | |
19 | if (!Double.isNaN(value)) {↵ | 19 | if (!Double.isNaN(value)) {↵ | |
20 | minimum = Math.min(minimum, value);↵ | 20 | maximum = Math.max(maximum, value);↵ | |
21 | }↵ | 21 | }↵ | |
22 | }↵ | 22 | }↵ | |
23 | }↵ | 23 | }↵ | |
24 | if (minimum == Double.POSITIVE_INFINITY) {↵ | 24 | if (maximum == Double.NEGATIVE_INFINITY) {↵ | |
25 | return null;↵ | 25 | return null;↵ | |
26 | }↵ | 26 | }↵ | |
27 | else {↵ | 27 | else {↵ | |
28 | return new Double(minimum);↵ | 28 | return new Double(maximum);↵ | |
29 | } | 29 |
| |
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.9 |
Clones location | Clones are declared in the same class |
Number of node comparisons | 70 |
Number of mapped statements | 18 |
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) | 3427.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.getSeriesCount(); | 7 | int seriesCount = dataset.getSeriesCount(); | |||||||||||||||||||
8 | for (int series = 0; series < seriesCount; series++) | 8 | for (int series = 0; series < seriesCount; series++) | |||||||||||||||||||
9 | int itemCount = dataset.getItemCount(series); | 9 | int itemCount = dataset.getItemCount(series); | |||||||||||||||||||
10 | for (int item = 0; item < itemCount; item++) | 10 | for (int item = 0; item < itemCount; item++) | |||||||||||||||||||
11 | double value; | 11 | double value; | |||||||||||||||||||
12 | if (dataset instanceof IntervalXYDataset) | 12 | if (dataset instanceof IntervalXYDataset) | |||||||||||||||||||
13 | IntervalXYDataset intervalXYData = (IntervalXYDataset)dataset; | 13 | IntervalXYDataset intervalXYData = (IntervalXYDataset)dataset; | |||||||||||||||||||
14 | value = intervalXYData.getStartYValue(series, item); |
| 14 | value = intervalXYData.getEndYValue(series, item); | ||||||||||||||||||
15 | else if (dataset instanceof OHLCDataset) | 15 | else if (dataset instanceof OHLCDataset) | |||||||||||||||||||
16 | OHLCDataset highLowData = (OHLCDataset)dataset; | 16 | OHLCDataset highLowData = (OHLCDataset)dataset; | |||||||||||||||||||
17 | value = highLowData.getLowValue(series, item); |
| 17 | value = highLowData.getHighValue(series, item); | ||||||||||||||||||
else | else | |||||||||||||||||||||
18 | value = dataset.getYValue(series, item); | 18 | value = dataset.getYValue(series, item); | |||||||||||||||||||
19 | if (!Double.isNaN(value)) | 19 | if (!Double.isNaN(value)) | |||||||||||||||||||
20 | minimum = Math.min(minimum, value); |
| 20 | maximum = Math.max(maximum, value); | ||||||||||||||||||
21 | if (minimum == Double.POSITIVE_INFINITY) |
| 21 | if (maximum == Double.NEGATIVE_INFINITY) | ||||||||||||||||||
22 | return null; | 22 | return null; | |||||||||||||||||||
else | else | |||||||||||||||||||||
23 | return new Double(minimum); |
| 23 | return new Double(maximum); |
Row | Violation |
---|---|
1 | Expression intervalXYData.getStartYValue(series,item) cannot be parameterized, because it has dependencies to/from statements that will be extracted |
2 | Expression intervalXYData.getEndYValue(series,item) cannot be parameterized, because it has dependencies to/from statements that will be extracted |
3 | Expression highLowData.getLowValue(series,item) cannot be parameterized, because it has dependencies to/from statements that will be extracted |
4 | Expression highLowData.getHighValue(series,item) cannot be parameterized, because it has dependencies to/from statements that will be extracted |
5 | Expression Math.min(minimum,value) cannot be parameterized, because it has dependencies to/from statements that will be extracted |
6 | Expression Math.max(maximum,value) cannot be parameterized, because it has dependencies to/from statements that will be extracted |
7 | Not all possible execution flows end in a return statement |