double minimum = Double.POSITIVE_INFINITY; int seriesCount = dataset.getSeriesCount(); for (int series = 0; series < seriesCount; series++) { int itemCount = dataset.getItemCount(series); for (int item = 0; item < itemCount; item++) { double value; if (dataset instanceof IntervalXYDataset) { IntervalXYDataset intervalXYData = (IntervalXYDataset) dataset; value = intervalXYData.getStartYValue(series, item); } else if (dataset instanceof OHLCDataset) { OHLCDataset highLowData = (OHLCDataset) dataset; value = highLowData.getLowValue(series, item); } else { value = dataset.getYValue(series, item); } if (!Double.isNaN(value)) { minimum = Math.min(minimum, value); } } } if (minimum == Double.POSITIVE_INFINITY) { return null; } else { return new Double(minimum); }
double maximum = Double.NEGATIVE_INFINITY; int seriesCount = dataset.getSeriesCount(); for (int series = 0; series < seriesCount; series++) { int itemCount = dataset.getItemCount(series); for (int item = 0; item < itemCount; item++) { double value; if (dataset instanceof IntervalXYDataset) { IntervalXYDataset intervalXYData = (IntervalXYDataset) dataset; value = intervalXYData.getEndYValue(series, item); } else if (dataset instanceof OHLCDataset) { OHLCDataset highLowData = (OHLCDataset) dataset; value = highLowData.getHighValue(series, item); } else { value = dataset.getYValue(series, item); } if (!Double.isNaN(value)) { maximum = Math.max(maximum, value); } } } if (maximum == Double.NEGATIVE_INFINITY) { return null; } else { return new Double(maximum); }
Clone fragments detected by clone detection tool
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: Method name:
Number of AST nodes: 0 Number of AST nodes: 0
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
            }
Summary
Number of common nesting structure subtrees0
Number of refactorable cases0
Number of non-refactorable cases0
Time elapsed for finding largest common nesting structure subtrees (ms)0.0
Clones location
Number of node comparisons0