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 findMinimumDomainValue(XYDataset)
|
Method name: Number findMaximumDomainValue(XYDataset)
|
|||
Number of AST nodes: 18 | Number of AST nodes: 18 | |||
1 | if (dataset instanceof DomainInfo) {↵ | 1 | if (dataset instanceof DomainInfo) {↵ | |
2 | DomainInfo info = (DomainInfo) dataset;↵ | 2 | DomainInfo info = (DomainInfo) dataset;↵ | |
3 | return new Double(info.getDomainLowerBound(true));↵ | 3 | return new Double(info.getDomainUpperBound(true));↵ | |
4 | } ↵ | 4 | } ↵ | |
5 | // hasn't implemented DomainInfo, so iterate... ↵ | |||
5 | else {↵ | 6 | else {↵ | |
6 | double minimum = Double.POSITIVE_INFINITY;↵ | 7 | double maximum = Double.NEGATIVE_INFINITY;↵ | |
7 | int seriesCount = dataset.getSeriesCount();↵ | 8 | int seriesCount = dataset.getSeriesCount();↵ | |
8 | for (int series = 0; series < seriesCount; series++) {↵ | 9 | for (int series = 0; series < seriesCount; series++) {↵ | |
9 | int itemCount = dataset.getItemCount(series);↵ | 10 | int itemCount = dataset.getItemCount(series);↵ | |
10 | for (int item = 0; item < itemCount; item++) {↵ | 11 | for (int item = 0; item < itemCount; item++) {↵ | |
11 | double value;↵ | 12 | double value;↵ | |
12 | if (dataset instanceof IntervalXYDataset) {↵ | 13 | if (dataset instanceof IntervalXYDataset) {↵ | |
13 | IntervalXYDataset intervalXYData↵ | 14 | IntervalXYDataset intervalXYData↵ | |
14 | = (IntervalXYDataset) dataset;↵ | 15 | = (IntervalXYDataset) dataset;↵ | |
15 | value = intervalXYData.getStartXValue(series, item);↵ | 16 | value = intervalXYData.getEndXValue(series, item);↵ | |
16 | }↵ | 17 | }↵ | |
17 | else {↵ | 18 | else {↵ | |
18 | value = dataset.getXValue(series, item);↵ | 19 | value = dataset.getXValue(series, item);↵ | |
19 | }↵ | 20 | }↵ | |
20 | if (!Double.isNaN(value)) {↵ | 21 | if (!Double.isNaN(value)) {↵ | |
21 | minimum = Math.min(minimum, value);↵ | 22 | maximum = Math.max(maximum, value);↵ | |
22 | }↵ | 23 | }↵ | |
23 | }↵ | 24 | }↵ | |
24 | }↵ | 25 | }↵ | |
25 | if (minimum == Double.POSITIVE_INFINITY) {↵ | 26 | if (maximum == Double.NEGATIVE_INFINITY) {↵ | |
26 | result = null;↵ | 27 | result = null;↵ | |
27 | }↵ | 28 | }↵ | |
28 | else {↵ | 29 | else {↵ | |
29 | result = new Double(minimum);↵ | 30 | result = new Double(maximum);↵ | |
30 | }↵ | 31 | }↵ | |
31 | } | 32 |
| |
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.8 |
Clones location | Clones are declared in the same class |
Number of node comparisons | 73 |
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) | 5.3 |
Clone type | Type 2 |
ID | Statement | ID | Statement | |||||||||||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
4 | if (dataset instanceof DomainInfo) | 4 | if (dataset instanceof DomainInfo) | |||||||||||||||||||
5 | DomainInfo info = (DomainInfo)dataset; | 5 | DomainInfo info = (DomainInfo)dataset; | |||||||||||||||||||
6 | return new Double(info.getDomainLowerBound(true)); |
| 6 | return new Double(info.getDomainUpperBound(true)); | ||||||||||||||||||
else | else | |||||||||||||||||||||
7 | double minimum = Double.POSITIVE_INFINITY; |
| 7 | double maximum = Double.NEGATIVE_INFINITY; | ||||||||||||||||||
8 | int seriesCount = dataset.getSeriesCount(); | 8 | int seriesCount = dataset.getSeriesCount(); | |||||||||||||||||||
9 | for (int series = 0; series < seriesCount; series++) | 9 | for (int series = 0; series < seriesCount; series++) | |||||||||||||||||||
10 | int itemCount = dataset.getItemCount(series); | 10 | int itemCount = dataset.getItemCount(series); | |||||||||||||||||||
11 | for (int item = 0; item < itemCount; item++) | 11 | for (int item = 0; item < itemCount; item++) | |||||||||||||||||||
12 | double value; | 12 | double value; | |||||||||||||||||||
13 | if (dataset instanceof IntervalXYDataset) | 13 | if (dataset instanceof IntervalXYDataset) | |||||||||||||||||||
14 | IntervalXYDataset intervalXYData = (IntervalXYDataset)dataset; | 14 | IntervalXYDataset intervalXYData = (IntervalXYDataset)dataset; | |||||||||||||||||||
15 | value = intervalXYData.getStartXValue(series, item); |
| 15 | value = intervalXYData.getEndXValue(series, item); | ||||||||||||||||||
else | else | |||||||||||||||||||||
16 | value = dataset.getXValue(series, item); | 16 | value = dataset.getXValue(series, item); | |||||||||||||||||||
17 | if (!Double.isNaN(value)) | 17 | if (!Double.isNaN(value)) | |||||||||||||||||||
18 | minimum = Math.min(minimum, value); |
| 18 | maximum = Math.max(maximum, value); | ||||||||||||||||||
19 | if (minimum == Double.POSITIVE_INFINITY) |
| 19 | if (maximum == Double.NEGATIVE_INFINITY) | ||||||||||||||||||
20 | result = null; | 20 | result = null; | |||||||||||||||||||
else | else | |||||||||||||||||||||
21 | result = new Double(minimum); |
| 21 | result = new Double(maximum); |
Row | Violation |
---|---|
1 | Expression info.getDomainLowerBound(true) cannot be parameterized, because it has dependencies to/from statements that will be extracted |
2 | Expression info.getDomainUpperBound(true) cannot be parameterized, because it has dependencies to/from statements that will be extracted |
3 | Expression intervalXYData.getStartXValue(series,item) cannot be parameterized, because it has dependencies to/from statements that will be extracted |
4 | Expression intervalXYData.getEndXValue(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 |