double lvalue = ixyd.getStartYValue(series, item); double uvalue = ixyd.getEndYValue(series, item); if (!Double.isNaN(lvalue)) { minimum = Math.min(minimum, lvalue); } if (!Double.isNaN(uvalue)) { maximum = Math.max(maximum, uvalue); }
double lvalue = ohlc.getLowValue(series, item); double uvalue = ohlc.getHighValue(series, item); if (!Double.isNaN(lvalue)) { minimum = Math.min(minimum, lvalue); } if (!Double.isNaN(uvalue)) { maximum = Math.max(maximum, uvalue); }
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: Method name:
Number of AST nodes: 0 Number of AST nodes: 0
1
double lvalue = ixyd.getStartYValue(series, item);
1
double lvalue = ohlc.getLowValue(series, item);
2
                    double uvalue = ixyd.getEndYValue(series, item);
2
                    double uvalue = ohlc.getHighValue(series, item);
3
                    if (!Double.isNaN(lvalue)) {
3
                    if (!Double.isNaN(lvalue)) {
4
                        minimum = Math.min(minimum, lvalue);
4
                        minimum = Math.min(minimum, lvalue);
5
                    }
5
                    }
6
                    if (!Double.isNaN(uvalue)) {
6
                    if (!Double.isNaN(uvalue)) {
7
                        maximum = Math.max(maximum, uvalue);
7
                        maximum = Math.max(maximum, uvalue);
8
                    }
8
                    }
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