DefaultPieDataset result = new DefaultPieDataset(); int rowCount = dataset.getRowCount(); for (int i = 0; i < rowCount; i++) { Comparable rowKey = dataset.getRowKey(i); result.setValue(rowKey, dataset.getValue(i, column)); } return result;
Collection result = new java.util.ArrayList(); for (int i = 0; i < series.getItemCount(); i++) { RegularTimePeriod period = series.getTimePeriod(i); int index = getIndex(period); if (index < 0) { result.add(period); } } return result;
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/time/TimeSeries.java
Method name: PieDataset createPieDatasetForColumn(CategoryDataset, int) Method name: Collection getTimePeriodsUniqueToOtherSeries(TimeSeries)
Number of AST nodes: 6 Number of AST nodes: 7
1
DefaultPieDataset result = new DefaultPieDataset();
2
        int rowCount = dataset.getRowCount();
1
Collection result = new java.util.ArrayList();
3
        for (int i = 0; i < rowCount; i++) {
2
        for (int i = 0; i < series.getItemCount(); i++) {
4
            Comparable rowKey = dataset.getRowKey(i);
3
            
5
            result.setValue(rowKey, dataset.getValue(i, column));
4
RegularTimePeriod period = series.getTimePeriod(i);
5
            int index = getIndex(period);
6
            if (index < 0) {
7
                result.add(period);
8
            }
6
        }
9
        }
7
        return result;
10
        return result;
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 comparisons10