for (int item = 0; item < itemCount; item++) { double delta = vdataset.getVectorXValue(series, item); if (delta < 0.0) { uvalue = vdataset.getXValue(series, item); lvalue = uvalue + delta; } else { lvalue = vdataset.getXValue(series, item); uvalue = lvalue + delta; } 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/VectorRenderer.java File path: /jfreechart-1.0.10/src/org/jfree/chart/renderer/xy/VectorRenderer.java
Method name: Method name:
Number of AST nodes: 0 Number of AST nodes: 0
1
for (int item = 0; item < itemCount; item++) {
1
for (int item = 0; item < itemCount; item++) {
2
                    double delta = vdataset.getVectorXValue(series, item);
2
                    double delta = vdataset.getVectorYValue(series, item);
3
                    if (delta < 0.0) {
3
                    if (delta < 0.0) {
4
                        uvalue = vdataset.getXValue(series, item);
4
                        uvalue = vdataset.getYValue(series, item);
5
                        lvalue = uvalue + delta;
5
                        lvalue = uvalue + delta;
6
                    }
6
                    }
7
                    else {
7
                    else {
8
                        lvalue = vdataset.getXValue(series, item);
8
                        lvalue = vdataset.getYValue(series, item);
9
                        uvalue = lvalue + delta;
9
                        uvalue = lvalue + delta;
10
                    }
10
                    }
11
                    minimum = Math.min(minimum, lvalue);
11
                    minimum = Math.min(minimum, lvalue);
12
                    maximum = Math.max(maximum, uvalue);
12
                    maximum = Math.max(maximum, uvalue);
13
                }
13
                }
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.0
Clones location
Number of node comparisons0