for (int item = 0; item < itemCount; item++) {
double value = dataset.getYValue(series, item);
if (!Double.isNaN(value)) {
minimum = Math.min(minimum, value);
maximum = Math.max(maximum, value);
}
}
for (int column = 0; column < columnCount; column++) {
Number value = dataset.getValue(row, column);
if (value != null) {
double v = value.doubleValue();
minimum = Math.min(minimum, v);
maximum = Math.max(maximum, v);
}
}
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: Range iterateRangeBounds(XYDataset, boolean)
|
|
Method name: Range iterateRangeBounds(CategoryDataset, boolean)
|
Number of AST nodes: 5
|
|
Number of AST nodes: 6
|
|
1 | for (int item = 0; item < itemCount; item++) {↵ | | 1 | for (int column = 0; column < columnCount; column++) {↵
|
2 | double value = dataset.getYValue(series, item);↵ | | 2 | Number value = dataset.getValue(row, column);↵
|
3 | if (!Double.isNaN(value)) {↵ | | 3 | if (value != null) {↵
|
| | | 4 | double v = value.doubleValue();↵
|
4 | minimum = Math.min(minimum, value);↵ | | 5 | minimum = Math.min(minimum, v);↵
|
5 | maximum = Math.max(maximum, value);↵ | | 6 | maximum = Math.max(maximum, v);↵
|
6 | }↵ | | 7 | }↵
|
7 | } | | 8 | }
|
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 |