DefaultPieDataset result = new DefaultPieDataset();
int columnCount = dataset.getColumnCount();
for (int current = 0; current < columnCount; current++) {
Comparable columnKey = dataset.getColumnKey(current);
result.setValue(columnKey, dataset.getValue(row, current));
}
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 createPieDatasetForRow(CategoryDataset, int)
|
|
Method name: Collection getTimePeriodsUniqueToOtherSeries(TimeSeries)
|
Number of AST nodes: 6
|
|
Number of AST nodes: 7
|
|
1 | DefaultPieDataset result = new DefaultPieDataset();↵ | | |
|
2 | int columnCount = dataset.getColumnCount();↵ | | |
|
3 | for (int current = 0; current < columnCount; current++) {↵ | | |
|
4 | Comparable columnKey = dataset.getColumnKey(current);↵ | | |
|
5 | result.setValue(columnKey, dataset.getValue(row, current));↵ | | 1 | Collection result = new java.util.ArrayList();↵
|
| | | 2 | for (int i = 0; i < series.getItemCount(); i++) {↵
|
| | | 3 | RegularTimePeriod period = series.getTimePeriod(i);↵
|
| | | 4 | int index = getIndex(period);↵
|
| | | 5 | if (index < 0) {↵
|
| | | 6 | result.add(period);↵
|
| | | 7 | }↵
|
6 | }↵ | | 8 | }↵
|
7 | return result; | | 9 | return result;
|
See real code fragment |
|
See real code fragment |
Summary
Number of common nesting structure subtrees | 0 |
Number of refactorable cases | 0 |
Number of non-refactorable cases | 0 |
Time elapsed for finding largest common nesting structure subtrees (ms) | 0.1 |
Clones location | Clones are in different classes |
Number of node comparisons | 10 |