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);
}
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);
}
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: 10
|
|
Number of AST nodes: 10
|
|
1 | for (int item = 0; item < categoryCount; item++) {↵ | | 1 | for (int item = 0; item < categoryCount; item++) {↵
|
2 | double total = 0.0;↵ | | 2 | double total = 0.0;↵
|
|
3 | int seriesCount = dataset.getColumnCount();↵ | | 3 | int seriesCount = dataset.getRowCount();↵
|
4 | for (int series = 0; series < seriesCount; series++) {↵ | | 4 | for (int series = 0; series < seriesCount; series++) {↵
|
5 | Number number = dataset.getValue(series, item);↵ | | 5 | Number number = dataset.getValue(series, item);↵
|
6 | if (number != null) {↵ | | 6 | if (number != null) {↵
|
7 | double value = number.doubleValue();↵ | | 7 | double value = number.doubleValue();↵
|
8 | if (value < 0.0) {↵ | | 8 | if (value > 0.0) {↵
|
9 | total = total + value;↵ | | 9 | total = total + value;↵
|
10 | // '+', remember value is negative↵ | | |
|
11 | }↵ | | 10 | }↵
|
12 | }↵ | | 11 | }↵
|
13 | }↵ | | 12 | }↵
|
14 | minimum = Math.min(minimum, total);↵ | | 13 | maximum = Math.max(maximum, total);↵
|
|
15 | } | | 14 | }
|
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 declared in the same class |
Number of node comparisons | 1 |