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); }
Number value; if (dataset instanceof IntervalCategoryDataset) { IntervalCategoryDataset icd = (IntervalCategoryDataset) dataset; value = icd.getEndValue(series, item); } else { value = dataset.getValue(series, item); } if (value != null) { maximum = Math.max(maximum, value.doubleValue()); }
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: Number findMinimumDomainValue(XYDataset) Method name: Number findMaximumRangeValue(CategoryDataset)
Number of AST nodes: 7 Number of AST nodes: 7
1
double value;
1
Number value;
2
                    if (dataset instanceof IntervalXYDataset) {
2
                    if (dataset instanceof IntervalCategoryDataset) {
3
                        IntervalXYDataset intervalXYData
3
                        IntervalCategoryDataset icd
4
                            = (IntervalXYDataset) dataset;
4
                            = (IntervalCategoryDataset) dataset;
5
                        value = intervalXYData.getStartXValue(series, item);
5
                        value = icd.getEndValue(series, item);
6
                    }
6
                    }
7
                    else {
7
                    else {
8
                        value = dataset.getXValue(series, item);
8
                        value = dataset.getValue(series, item);
9
                    }
9
                    }
10
                    if (!Double.isNaN(value)) {
10
                    if (value != null) {
11
                        minimum = Math.min(minimum, value);
11
                        maximum = Math.max(maximum, value.doubleValue());
12
                    }
12
                    }
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.1
Clones locationClones are declared in the same class
Number of node comparisons4