double total = 0.0; int seriesCount = dataset.getColumnCount(); 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; // '+', remember value is negative } } } minimum = Math.min(minimum, total);
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);
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 findMinimumStackedRangeValue(CategoryDataset) Method name: Number findMaximumStackedRangeValue(CategoryDataset)
Number of AST nodes: 9 Number of AST nodes: 9
1
double total = 0.0;
1
double total = 0.0;
2
                int seriesCount = dataset.getColumnCount();
2
                int seriesCount = dataset.getRowCount();
3
                for (int series = 0; series < seriesCount; series++) {
3
                for (int series = 0; series < seriesCount; series++) {
4
                    Number number = dataset.getValue(series, item);
4
                    Number number = dataset.getValue(series, item);
5
                    if (number != null) {
5
                    if (number != null) {
6
                        double value = number.doubleValue();
6
                        double value = number.doubleValue();
7
                        if (value < 0.0) {
7
                        if (value > 0.0) {
8
                            total = total + value;
8
                            total = total + value;
9
                            // '+', remember value is negative
10
                        }
9
                        }
11
                    }
10
                    }
12
                }
11
                }
13
                minimum = Math.min(minimum, total);
12
                maximum = Math.max(maximum, total);
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