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