int itemCount = dataset.getItemCount(series);
for (int item = 0; item < itemCount; item++) {
lvalue = dataset.getStartXValue(series, item);
uvalue = dataset.getEndXValue(series, item);
double offset = (uvalue - lvalue) / 2.0;
lvalue = lvalue - offset;
uvalue = uvalue - offset;
minimum = Math.min(minimum, lvalue);
maximum = Math.max(maximum, uvalue);
}
for (int item = 0; item < itemCount; item++) {
double delta = vdataset.getVectorYValue(series, item);
if (delta < 0.0) {
uvalue = vdataset.getYValue(series, item);
lvalue = uvalue + delta;
}
else {
lvalue = vdataset.getYValue(series, item);
uvalue = lvalue + delta;
}
minimum = Math.min(minimum, lvalue);
maximum = Math.max(maximum, uvalue);
}
Clone fragments detected by clone detection tool
File path: /jfreechart-1.0.10/src/org/jfree/chart/renderer/xy/ClusteredXYBarRenderer.java
|
|
File path: /jfreechart-1.0.10/src/org/jfree/chart/renderer/xy/VectorRenderer.java
|
Method name: Range findDomainBoundsWithOffset(IntervalXYDataset)
|
|
Method name: Range findRangeBounds(XYDataset)
|
Number of AST nodes: 9
|
|
Number of AST nodes: 9
|
|
1 | int itemCount = dataset.getItemCount(series);↵ | | |
|
2 | for (int item = 0; item < itemCount; item++) {↵ | | 1 | for (int item = 0; item < itemCount; item++) {↵
|
3 | lvalue = dataset.getStartXValue(series, item);↵ | | 2 | double delta = vdataset.getVectorYValue(series, item);↵
|
| | | 3 | if (delta < 0.0) {↵
|
4 | uvalue = dataset.getEndXValue(series, item);↵ | | 4 | uvalue = vdataset.getYValue(series, item);↵
|
5 | double offset = (uvalue - lvalue) / 2.0;↵ | | 5 | lvalue = uvalue ↵
|
6 | lvalue = lvalue - offset;↵ | | |
|
| | | 6 | + delta;↵
|
| | | 7 | }↵
|
| | | 8 | else {↵
|
| | | 9 | lvalue = vdataset.getYValue(series, item);↵
|
7 | uvalue = uvalue - offset;↵ | | 10 | uvalue = lvalue ↵
|
| | | 11 | + delta;↵
|
| | | 12 | }↵
|
8 | minimum = Math.min(minimum, lvalue);↵ | | 13 | minimum = Math.min(minimum, lvalue);↵
|
9 | maximum = Math.max(maximum, uvalue);↵ | | 14 | maximum = Math.max(maximum, uvalue);↵
|
10 | } | | 15 | }
|
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.0 |
Clones location | Clones are in different classes having the same super class |
Number of node comparisons | 1 |