int seriesCount = dataset.getRowCount(); for (int i = 0; i < seriesCount; i++) { if (isSeriesVisibleInLegend(i)) { LegendItem item = getLegendItem(index, i); if (item != null) { result.add(item); } } }
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 } } }
Clone fragments detected by clone detection tool
File path: /jfreechart-1.0.10/src/org/jfree/chart/renderer/category/AbstractCategoryItemRenderer.java File path: /jfreechart-1.0.10/src/org/jfree/data/general/DatasetUtilities.java
Method name: LegendItemCollection getLegendItems() Method name: Number findMinimumStackedRangeValue(CategoryDataset)
Number of AST nodes: 6 Number of AST nodes: 6
1
int seriesCount = dataset.getRowCount();
1
for (int series
2
            for (int i = 0; i < seriesCount; i++) {
3
                if (isSeriesVisibleInLegend(i)) {
4
                    LegendItem item = getLegendItem(index, i
2
 = 0; series < seriesCount; series++) {
3
                    Number number = dataset.getValue(series, item);
4
                    if (number != null) {
5
);
5
                        double value = number.doubleValue();
6
                    if (item != null) {
6
                        if (
7
                        result.add(item);
7
value < 0.0) {
8
                            total = total + value;
9
                            // '+', remember value is negative
8
                    }
10
                        }
9
                }
11
                
12
    }
10
            }
13
                }
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 in different classes
Number of node comparisons1