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.getStartXValue(series, item); } else { value = dataset.getXValue(series, item); } if (!Double.isNaN(value)) { minimum = Math.min(minimum, value); } } } if (minimum == Double.POSITIVE_INFINITY) { result = null; } else { result = 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.getEndXValue(series, item); } else { value = dataset.getXValue(series, item); } if (!Double.isNaN(value)) { maximum = Math.max(maximum, value); } } } if (maximum == Double.NEGATIVE_INFINITY) { result = null; } else { result = 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.getStartXValue(series, item);
10
                        value = intervalXYData.getEndXValue(series, item);
11
                    }
11
                    }
12
                    else {
12
                    else {
13
                        value = dataset.getXValue(series, item);
13
                        value = dataset.getXValue(series, item);
14
                    }
14
                    }
15
                    if (!Double.isNaN(value)) {
15
                    if (!Double.isNaN(value)) {
16
                        minimum = Math.min(minimum, value);
16
                        maximum = Math.max(maximum, value);
17
                    }
17
                    }
18
                }
18
                }
19
            }
19
            }
20
            if (minimum == Double.POSITIVE_INFINITY) {
20
            if (maximum == Double.NEGATIVE_INFINITY) {
21
                result = null;
21
                result = null;
22
            }
22
            }
23
            else {
23
            else {
24
                result = new Double(minimum);
24
                result = new Double(maximum);
25
            }
25
            }
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