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