for (int series = 0; series < seriesCount; series++) { int itemCount = dataset.getItemCount(series); for (int item = 0; item < itemCount; item++) { lvalue = dataset.getXValue(series, item); uvalue = lvalue; minimum = Math.min(minimum, lvalue); maximum = Math.max(maximum, uvalue); } }
for (int row = 0; row < rowCount; row++) { for (int column = 0; column < columnCount; column++) { Number value = dataset.getValue(row, column); if (value != null) { double v = value.doubleValue(); minimum = Math.min(minimum, v); maximum = Math.max(maximum, v); } } }
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: Range iterateDomainBounds(XYDataset, boolean) Method name: Range iterateRangeBounds(CategoryDataset, boolean)
Number of AST nodes: 7 Number of AST nodes: 7
1
for (int series = 0; series < seriesCount; series++) {
1
for (int row = 0; row < rowCount; row++) {
2
                int itemCount = dataset.getItemCount(series);
3
                for (int item = 0; item < itemCount; item++) {
2
                for (int column = 0; column < columnCount; column++) {
4
                    lvalue = dataset.getXValue(series, item);
3
                    Number value = dataset.getValue(row, column);
5
                    uvalue = lvalue;
4
                    if (value != 
5
null) {
6
                        double v = value.doubleValue();
6
                    minimum = Math.min(minimum, lvalue);
7
                        minimum = Math.min(minimum, v);
7
                    maximum = Math.max(maximum, uvalue);
8
                        maximum = Math.max(maximum, v);
9
                    }
8
                }
10
                }
9
            }
11
            }
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 locationClones are declared in the same class
Number of node comparisons1